arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.20106cs.RO
收藏

利用阻挡障碍物的可移动性意识穿越杂乱环境

Pushing Through Clutter With Movability Awareness of Blocking Obstacles

TU Delft(代尔夫特理工大学)

Joris J. Weeda, Saray Bakker, Gang Chen, Javier Alonso-Mora

AI总结:

提出SVG-MPPI框架,结合语义可见性图与模型预测路径积分,考虑障碍物可移动性连续范围,通过物理引擎模拟生成低接触力轨迹,在NAMO任务中优于二元可移动性规划,提高成功率并减少累积接触力。

摘要:

可移动障碍物导航(NAMO)在障碍物阻挡路径时对传统路径规划方法构成挑战,需要执行推行动作才能到达目标。我们提出了一种框架,能够实现可移动性感知的规划,无需依赖显式的障碍物放置即可克服这一挑战。我们的框架整合了全局语义可见性图和局部模型预测路径积分(SVG-MPPI)方法,以高效采样滚动预测,同时考虑障碍物可移动性的连续范围。采用物理引擎模拟滚动预测与环境交互的结果,并生成最小化接触力的轨迹。在定性和定量实验中,SVG-MPPI优于仅使用二元可移动性进行规划的现有范式,以更低的累积接触力实现了更高的成功率。我们的代码可在以下网址获取:https://github.com/tud-amr/SVG-MPPI

英文摘要:

Navigation Among Movable Obstacles (NAMO) poses a challenge for traditional path-planning methods when obstacles block the path, requiring push actions to reach the goal. We propose a framework that enables movability-aware planning to overcome this challenge without relying on explicit obstacle placement. Our framework integrates a global Semantic Visibility Graph and a local Model Predictive Path Integral (SVG-MPPI) approach to efficiently sample rollouts, taking into account the continuous range of obstacle movability. A physics engine is adopted to simulate the interaction result of the rollouts with the environment, and generate trajectories that minimize contact force. In qualitative and quantitative experiments, SVG-MPPI outperforms the existing paradigm that uses only binary movability for planning, achieving higher success rates with reduced cumulative contact forces. Our code is available at: https://github.com/tud-amr/SVG-MPPI

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑