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

森林中快速自主飞行的自适应重规划实验

Experiments in Adaptive Replanning for Fast Autonomous Flight in Forests

University of Pennsylvania(宾夕法尼亚大学)

Laura Jarin-Lipschitz, Xu Liu, Yuezhan Tao, Vijay Kumar

摘要:

在森林等非结构化、杂乱的环境中进行快速自主飞行是一项挑战,因为它需要机器人在计算受限的平台上实时计算新的计划。在本文中,我们使这一能力与基于搜索的规划框架,适应采样密度实时找到动态可行的计划,同时保持计算易处理。基于搜索的规划中的一个最大挑战是,密集的障碍既需要大型图(以保证完整性),又降低了图搜索的效率(因为搜索变得不那么准确)。为了解决这个问题,我们开发了一个规划框架,有两个部分:一个是最大限度地提高计划的完整性,对于一个给定的图形大小,第二,动态最大化图形大小的计算约束。该框架通过运动规划图来实现,所述运动规划图由单个参数离散度定义,离散度量化从图到达任意状态的最大轨迹成本。我们通过真实和模拟实验展示了分散如何实时适应不同的环境,允许在不同密度的环境中操作。仿真实验表明,改进的性能基线搜索为基础的规划算法。我们还在现实世界杂乱的松林中展示了高达2.5米/秒的飞行速度。

英文摘要:

Fast, autonomous flight in unstructured, cluttered environments such as forests is challenging because it requires the robot to compute new plans in realtime on a computationally-constrained platform. In this paper, we enable this capability with a search-based planning framework that adapts sampling density in realtime to find dynamically-feasible plans while remaining computationally tractable. A paramount challenge in search-based planning is that dense obstacles both necessitate large graphs (to guarantee completeness) and reduce the efficiency of graph search (as heuristics become less accurate). To address this, we develop a planning framework with two parts: one that maximizes planner completeness for a given graph size, and a second that dynamically maximizes graph size subject to computational constraints. This framework is enabled by motion planning graphs that are defined by a single parameter, dispersion, which quantifies the maximum trajectory cost to reach an arbitrary state from the graph. We show through real and simulated experiments how the dispersion can be adapted to different environments in realtime, allowing operation in environments with varying density. The simulated experiment demonstrates improved performance over a baseline search-based planning algorithm. We also demonstrate flight speeds of up to 2.5m/s in real-world cluttered pine forests.

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

↑