From Offline to Online: A Perception-Based Local Planner for Dynamic Obstacle Avoidance

L. Rossini, N. Tsagarakis
{"title":"From Offline to Online: A Perception-Based Local Planner for Dynamic Obstacle Avoidance","authors":"L. Rossini, N. Tsagarakis","doi":"10.1109/Humanoids53995.2022.10000245","DOIUrl":null,"url":null,"abstract":"The deployment of robots within realistic environments necessitates robots to be capable of replanning their loco-manipulation trajectories on the fly to avoid unexpected interactions that may occur due to the uncertainty that is present in such dynamic and varying workspaces. This work introduces a novel method for the online local replanning of precomputed global trajectories for redoundant robots. The local nature of the problem leads to a sparse system that a hyper-graph can encode more intuitively. Using a graph, we can also store the entire global trajectory, preventing the local planner from getting stuck in local minima, and vertices and edges can be dynamically added or removed to ignore those constraints that do not interfere with the local problem, further increasing the computational efficiency. This process is accompanied by a control layer that iteratively takes the online refined solution and safely moves the robot. The method is validated both in simulation and experimentally on the wheeled-legged quadrupedal robot CENTAURO, demonstrating its effectiveness in replanning online the loco-manipulation trajectories of the robot under the occurrence of obstacles that intervene with the initially planned trajectories.","PeriodicalId":180816,"journal":{"name":"2022 IEEE-RAS 21st International Conference on Humanoid Robots (Humanoids)","volume":"285 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE-RAS 21st International Conference on Humanoid Robots (Humanoids)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Humanoids53995.2022.10000245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The deployment of robots within realistic environments necessitates robots to be capable of replanning their loco-manipulation trajectories on the fly to avoid unexpected interactions that may occur due to the uncertainty that is present in such dynamic and varying workspaces. This work introduces a novel method for the online local replanning of precomputed global trajectories for redoundant robots. The local nature of the problem leads to a sparse system that a hyper-graph can encode more intuitively. Using a graph, we can also store the entire global trajectory, preventing the local planner from getting stuck in local minima, and vertices and edges can be dynamically added or removed to ignore those constraints that do not interfere with the local problem, further increasing the computational efficiency. This process is accompanied by a control layer that iteratively takes the online refined solution and safely moves the robot. The method is validated both in simulation and experimentally on the wheeled-legged quadrupedal robot CENTAURO, demonstrating its effectiveness in replanning online the loco-manipulation trajectories of the robot under the occurrence of obstacles that intervene with the initially planned trajectories.
从离线到在线:基于感知的动态避障局部规划
在现实环境中部署机器人需要机器人能够在飞行中重新规划其局部操作轨迹,以避免由于这种动态和变化的工作空间中存在的不确定性而可能发生的意外交互。本文介绍了一种对冗余机器人预先计算的全局轨迹进行在线局部重规划的新方法。问题的局域性导致了一个稀疏系统,超图可以更直观地对其进行编码。使用图,我们还可以存储整个全局轨迹,防止局部规划器陷入局部最小值,并且可以动态添加或删除顶点和边,忽略那些不干扰局部问题的约束,进一步提高计算效率。这个过程伴随着一个控制层,该控制层迭代地获取在线精细解并安全移动机器人。在轮腿四足机器人CENTAURO上进行了仿真和实验验证,验证了该方法在出现干扰初始规划轨迹的障碍物的情况下,能够有效地在线重新规划机器人的轨迹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信