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

时间最优遍历搜索

Time Optimal Ergodic Search

Yale University(耶鲁大学)

Dayi Dong, Henry Berger, Ian Abraham

AI总结:

本文研究时间最优遍历搜索问题,将其表述为带遍历不等式约束的最短时间问题,利用Pontryagin最优性条件解析求解并通过直接转录优化方法数值演示,在仿真和无人机实验中验证了其生成时间最优轨迹及避障的有效性。

摘要:

具备在时间与搜索彻底性之间取得平衡能力的机器人,有望在搜救等应用中提供时间关键的援助。当前基于遍历覆盖的搜索方法的进展,使机器人能够在固定时间内完全探索和搜索某个区域。然而,针对自主遍历搜索的质量优化时间尚未得到证明。在本文中,我们研究了时间最优遍历搜索问题的解决方案,以实现快速且自适应的机器人搜索与探索。我们将该问题表述为带有遍历不等式约束的最短时间问题,其上限调节并平衡了搜索的粒度与时间。我们利用Pontryagin最优性条件解析地给出了该问题的解,并通过直接转录优化方法进行了数值演示。我们在仿真和杂乱环境中的无人机实验中展示了该方法在生成时间最优遍历搜索轨迹方面的有效性。结果表明避障可以很容易地集成到我们的公式中,并且我们进行了消融研究,探讨了参数对优化时间和搜索轨迹敏感性的依赖关系。

英文摘要:

Robots with the ability to balance time against the thoroughness of search have the potential to provide time-critical assistance in applications such as search and rescue. Current advances in ergodic coverage-based search methods have enabled robots to completely explore and search an area in a fixed amount of time. However, optimizing time against the quality of autonomous ergodic search has yet to be demonstrated. In this paper, we investigate solutions to the time-optimal ergodic search problem for fast and adaptive robotic search and exploration. We pose the problem as a minimum time problem with an ergodic inequality constraint whose upper bound regulates and balances the granularity of search against time. Solutions to the problem are presented analytically using Pontryagin's conditions of optimality and demonstrated numerically through a direct transcription optimization approach. We show the efficacy of the approach in generating time-optimal ergodic search trajectories in simulation and with drone experiments in a cluttered environment. Obstacle avoidance is shown to be readily integrated into our formulation, and we perform ablation studies that investigate parameter dependence on optimized time and trajectory sensitivity for search.

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

↑