Robust Multi-Objective Path Planning for Flying Robots under Wind Disturbance

Yoonseon Oh, Kyunghoon Cho, Songhwai Oh
{"title":"Robust Multi-Objective Path Planning for Flying Robots under Wind Disturbance","authors":"Yoonseon Oh, Kyunghoon Cho, Songhwai Oh","doi":"10.1109/URAI.2018.8441822","DOIUrl":null,"url":null,"abstract":"This paper proposes a robust multi-objective path planning algorithm for flying robots carrying out complex missions. When a robot is put into the field, the robot is required to perform complex missions such as visiting sequential goals. We specify these missions using a linear temporal logic and search the path to accomplish the mission for flying robots. Since flying robots are more sensitive to air flow than ground robots, we should plan a path more carefully so that the disturbance by airflow does not cause mission failures or collision with obstacles. In addition, it is important to increase energy effectiveness for stability of flying robots. To achieve these purposes, we propose a multi-objective path planning problem which minimizes the mission failure probability and the moving distance while guaranteeing the safety of the robot and mission completion. We introduce a multi-layer path planning algorithm, where the high-level planner guides the low-level planner by generating a discrete path to accomplish the mission and the low-level planner searches the path to optimize multiple objective functions using a sampling-based RRT search tree. The presented low-level planner can improve the Pareto optimality of the trajectory effectively. We analyze the effectiveness theoretically and evaluate the performance by simulations.","PeriodicalId":347727,"journal":{"name":"2018 15th International Conference on Ubiquitous Robots (UR)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Conference on Ubiquitous Robots (UR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/URAI.2018.8441822","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a robust multi-objective path planning algorithm for flying robots carrying out complex missions. When a robot is put into the field, the robot is required to perform complex missions such as visiting sequential goals. We specify these missions using a linear temporal logic and search the path to accomplish the mission for flying robots. Since flying robots are more sensitive to air flow than ground robots, we should plan a path more carefully so that the disturbance by airflow does not cause mission failures or collision with obstacles. In addition, it is important to increase energy effectiveness for stability of flying robots. To achieve these purposes, we propose a multi-objective path planning problem which minimizes the mission failure probability and the moving distance while guaranteeing the safety of the robot and mission completion. We introduce a multi-layer path planning algorithm, where the high-level planner guides the low-level planner by generating a discrete path to accomplish the mission and the low-level planner searches the path to optimize multiple objective functions using a sampling-based RRT search tree. The presented low-level planner can improve the Pareto optimality of the trajectory effectively. We analyze the effectiveness theoretically and evaluate the performance by simulations.
风干扰下飞行机器人鲁棒多目标路径规划
针对执行复杂任务的飞行机器人,提出了一种鲁棒多目标路径规划算法。当机器人被投入战场时,机器人被要求执行复杂的任务,如访问顺序目标。我们使用线性时间逻辑来指定这些任务,并搜索飞行机器人完成任务的路径。由于飞行机器人比地面机器人对气流更敏感,我们应该更仔细地规划路径,使气流的干扰不会导致任务失败或与障碍物碰撞。此外,提高能量效率对飞行机器人的稳定性也很重要。为了实现这一目标,我们提出了一种多目标路径规划问题,在保证机器人安全和任务完成的同时,最小化任务失败概率和移动距离。我们引入了一种多层路径规划算法,其中高层规划器通过生成离散路径来引导低层规划器完成任务,低层规划器使用基于采样的RRT搜索树来搜索路径以优化多个目标函数。所提出的低级规划器可以有效地改善轨迹的帕累托最优性。从理论上分析了其有效性,并通过仿真对其性能进行了评价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信