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

复杂环境中用于遍历搜索的测度保持流

Measure Preserving Flows for Ergodic Search in Convoluted Environments

Carnegie Mellon University(卡内基梅隆大学)

Albert Xu, Bhaskar Vundurthy, Geordan Gutow, Ian Abraham, Jeff Schneider, Howie Choset

AI总结:

针对复杂障碍环境下现有遍历搜索方法失效的问题,提出结合Laplace-Beltrami本征函数的改进遍历度量,用测度保持无散度向量场生成避障轨迹,还支持多智能体无碰撞规划,经仿真验证有效。

摘要:

自主机器人搜索在机器人领域有重要应用,例如灾难后生命迹象搜寻。当存在先验信息(如以分布形式给出)时,规划器可利用该分布引导搜索。遍历搜索是一种利用信息分布生成轨迹的方法,其生成的轨迹可最小化遍历度量,即鼓励机器人在高信息区域停留更长时间,在其余区域停留时间按比例缩短。遗憾的是,以往的遍历搜索方法在存在障碍物的复杂环境(如建筑物内部或迷宫)中表现不佳。为解决这一问题,本研究提出一种改进的遍历度量,利用Laplace-Beltrami本征函数将地图几何结构与障碍物位置纳入遍历度量中。此外,我们提出一种轨迹生成方法,可在利用测度保持向量场保证避障的同时,最小化遍历度量。最后,我们利用这些向量场的无散度特性,为多智能体生成无碰撞轨迹。我们通过在内部走廊和长走廊地图上开展单智能体与多智能体系统仿真,验证了所提方法的有效性,这些地图具有非均匀信息分布。我们特别展示了在以往方法失效的复杂环境中,可行轨迹的生成过程。

英文摘要:

Autonomous robotic search has important applications in robotics, such as the search for signs of life after a disaster. When \emph{a priori} information is available, for example in the form of a distribution, a planner can use that distribution to guide the search. Ergodic search is one method that uses the information distribution to generate a trajectory that minimizes the ergodic metric, in that it encourages the robot to spend more time in regions with high information and proportionally less time in the remaining regions. Unfortunately, prior works in ergodic search do not perform well in complex environments with obstacles such as a building's interior or a maze. To address this, our work presents a modified ergodic metric using the Laplace-Beltrami eigenfunctions to capture map geometry and obstacle locations within the ergodic metric. Further, we introduce an approach to generate trajectories that minimize the ergodic metric while guaranteeing obstacle avoidance using measure-preserving vector fields. Finally, we leverage the divergence-free nature of these vector fields to generate collision-free trajectories for multiple agents. We demonstrate our approach via simulations with single and multi-agent systems on maps representing interior hallways and long corridors with non-uniform information distribution. In particular, we illustrate the generation of feasible trajectories in complex environments where prior methods fail.

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

↑