MORRFx及其框架:基于多目标采样的不可预测环境路径规划

Théo Combelles, Camille Marmonnier, Louis Proffit, L. Jouanneau
{"title":"MORRFx及其框架:基于多目标采样的不可预测环境路径规划","authors":"Théo Combelles, Camille Marmonnier, Louis Proffit, L. Jouanneau","doi":"10.1109/ICMERR56497.2022.10097799","DOIUrl":null,"url":null,"abstract":"We present MORRFx, an asymptotically optimal sampling based motion planning algorithm for fast and multi-objective planning in unpredictable dynamic environments. Often in robotics applications, the representation of the environment can change. As a result, over time, the information used to compute the solutions can evolve. The algorithm we propose takes these modifications into account to produce an approximation of the Pareto optimal set of solutions, that are valid at any time, and from which the decision-maker can select a trajectory according to his/her preferences. MORRFx (Multi-Objective Rapidly exploring Random Forest x) is a combination of two algorithms: RRTx (Asymptotically Optimal Single-Query Sampling-Based Motion Planning with Quick Replanning) [1] and MORRF* (Sampling-Based Multi-Objective Motion Planning) [2]. In this paper, we present a minimal, multi-objective framework in an efficient implementation. We also use simulations to show the efficiency and capabilities of MORRFx.","PeriodicalId":302481,"journal":{"name":"2022 7th International Conference on Mechanical Engineering and Robotics Research (ICMERR)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MORRFx and Its Framework: Multi-objective Sampling Based Path Planning for Unpredictable Environments\",\"authors\":\"Théo Combelles, Camille Marmonnier, Louis Proffit, L. Jouanneau\",\"doi\":\"10.1109/ICMERR56497.2022.10097799\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present MORRFx, an asymptotically optimal sampling based motion planning algorithm for fast and multi-objective planning in unpredictable dynamic environments. Often in robotics applications, the representation of the environment can change. As a result, over time, the information used to compute the solutions can evolve. The algorithm we propose takes these modifications into account to produce an approximation of the Pareto optimal set of solutions, that are valid at any time, and from which the decision-maker can select a trajectory according to his/her preferences. MORRFx (Multi-Objective Rapidly exploring Random Forest x) is a combination of two algorithms: RRTx (Asymptotically Optimal Single-Query Sampling-Based Motion Planning with Quick Replanning) [1] and MORRF* (Sampling-Based Multi-Objective Motion Planning) [2]. In this paper, we present a minimal, multi-objective framework in an efficient implementation. We also use simulations to show the efficiency and capabilities of MORRFx.\",\"PeriodicalId\":302481,\"journal\":{\"name\":\"2022 7th International Conference on Mechanical Engineering and Robotics Research (ICMERR)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 7th International Conference on Mechanical Engineering and Robotics Research (ICMERR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMERR56497.2022.10097799\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 7th International Conference on Mechanical Engineering and Robotics Research (ICMERR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMERR56497.2022.10097799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于渐近最优采样的运动规划算法MORRFx,用于在不可预测的动态环境中进行快速多目标规划。通常在机器人应用中,环境的表示可以改变。因此,随着时间的推移,用于计算解决方案的信息会发生变化。我们提出的算法考虑了这些修改,以产生在任何时候都有效的帕累托最优解集的近似值,并且决策者可以根据他/她的偏好从中选择轨迹。MORRFx (Multi-Objective rapid exploring Random Forest x)是两种算法的结合:RRTx (asymptically Optimal Single-Query Sampling-Based Motion Planning with Quick Replanning)[1]和MORRF* (Sampling-Based Multi-Objective Motion Planning)[2]。在本文中,我们提出了一个最小的,多目标的框架,在一个有效的实现。我们还使用仿真来展示MORRFx的效率和能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MORRFx and Its Framework: Multi-objective Sampling Based Path Planning for Unpredictable Environments
We present MORRFx, an asymptotically optimal sampling based motion planning algorithm for fast and multi-objective planning in unpredictable dynamic environments. Often in robotics applications, the representation of the environment can change. As a result, over time, the information used to compute the solutions can evolve. The algorithm we propose takes these modifications into account to produce an approximation of the Pareto optimal set of solutions, that are valid at any time, and from which the decision-maker can select a trajectory according to his/her preferences. MORRFx (Multi-Objective Rapidly exploring Random Forest x) is a combination of two algorithms: RRTx (Asymptotically Optimal Single-Query Sampling-Based Motion Planning with Quick Replanning) [1] and MORRF* (Sampling-Based Multi-Objective Motion Planning) [2]. In this paper, we present a minimal, multi-objective framework in an efficient implementation. We also use simulations to show the efficiency and capabilities of MORRFx.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信