arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.01973cs.RO
收藏

障碍物干扰未知环境中基于风险-回报权衡的抗碰撞移动机器人运动规划

Motion Planning for Collision-resilient Mobile Robots in Obstacle-cluttered Unknown Environments with Risk Reward Trade-offs

University of California, Riverside(加州大学河滨分校)

Zhouyu Lu, Zhichao Liu, Gustavo J. Correa, Konstantinos Karydis

摘要:

在未知障碍物杂乱的环境中避免碰撞可能并不总是可行的。本文重点介绍了一种新的范式转变,即可以利用而不是完全避免与环境的潜在碰撞。为此,我们引入了一种新的基于采样的在线规划算法,可以明确地处理与环境碰撞的风险,并可以在碰撞避免和碰撞利用之间切换。规划者的能力的核心是一个新的联合优化功能,使用反射模型评估可能的碰撞的影响。通过这种方式,规划者可以做出与环境碰撞的深思熟虑的决定,如果这种碰撞有望帮助机器人朝着目标前进。为了使算法在线,我们提出了一个状态扩展修剪技术,显着减少了搜索空间,同时确保完整性。该算法的实验评估与内置的内部完整轮式机器人,可以承受碰撞。我们进行了广泛的参数研究,以调查(用户调整)的风险水平之间的权衡,故意碰撞决策,和轨迹统计,如时间,以达到目标和路径长度。

英文摘要:

Collision avoidance in unknown obstacle-cluttered environments may not always be feasible. This paper focuses on an emerging paradigm shift in which potential collisions with the environment can be harnessed instead of being avoided altogether. To this end, we introduce a new sampling-based online planning algorithm that can explicitly handle the risk of colliding with the environment and can switch between collision avoidance and collision exploitation. Central to the planner's capabilities is a novel joint optimization function that evaluates the effect of possible collisions using a reflection model. This way, the planner can make deliberate decisions to collide with the environment if such collision is expected to help the robot make progress toward its goal. To make the algorithm online, we present a state expansion pruning technique that significantly reduces the search space while ensuring completeness. The proposed algorithm is evaluated experimentally with a built-in-house holonomic wheeled robot that can withstand collisions. We perform an extensive parametric study to investigate trade-offs between (user-tuned) levels of risk, deliberate collision decision making, and trajectory statistics such as time to reach the goal and path length.

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

↑