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

基于网格流形的全方位微型飞行器黎曼运动规划

Mesh Manifold based Riemannian Motion Planning for Omnidirectional Micro Aerial Vehicles

ETH Zürich(苏黎世联邦理工学院);Microsoft(微软公司)

Michael Pantic, Lionel Ott, Cesar Cadena, Roland Siegwart, Juan Nieto

摘要:

本文提出了一种新的在线路径规划方法,使空中机器人与表面的互动。我们提出了一个解决问题的轨迹,驱动机器人对一个表面,并沿着它移动。三角形网格被用来作为一个表面地图表示,是免费的固定离散化,并允许非常大的离散。我们建议利用平面参数化方法来获得原始表面的低维拓扑等价表示。此外,我们解释了原始表面及其低维表示为流形近似,允许使用黎曼运动策略(RMP),从而产生一个高效,通用和优雅的运动生成框架。我们比较几个快速探索随机树(RRT)规划,定制的CHOMP变体,和离散测地线算法。使用广泛的模拟现实世界的数据,我们表明,建议的规划器可以可靠地规划高质量的近最佳轨迹,以最小的计算成本。随附的多媒体附件演示了一个真正的OMAV的可行性。所获得的路径显示小于10%的偏差,从理论上的最佳,同时促进反应性重新规划在kHz的刷新率,使飞行机器人执行运动规划与复杂的表面相互作用。

英文摘要:

This paper presents a novel on-line path planning method that enables aerial robots to interact with surfaces. We present a solution to the problem of finding trajectories that drive a robot towards a surface and move along it. Triangular meshes are used as a surface map representation that is free of fixed discretization and allows for very large workspaces. We propose to leverage planar parametrization methods to obtain a lower-dimensional topologically equivalent representation of the original surface. Furthermore, we interpret the original surface and its lower-dimensional representation as manifold approximations that allow the use of Riemannian Motion Policies (RMPs), resulting in an efficient, versatile, and elegant motion generation framework. We compare against several Rapidly-exploring Random Tree (RRT) planners, a customized CHOMP variant, and the discrete geodesic algorithm. Using extensive simulations on real-world data we show that the proposed planner can reliably plan high-quality near-optimal trajectories at minimal computational cost. The accompanying multimedia attachment demonstrates feasibility on a real OMAV. The obtained paths show less than 10% deviation from the theoretical optimum while facilitating reactive re-planning at kHz refresh rates, enabling flying robots to perform motion planning for interaction with complex surfaces.

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

↑