多角形環境におけるエネルギー最適ロボット軌道生成のためのグラフベース手法
A Graph-Based Approach to Generate Energy-Optimal Robot Trajectories in Polygonal Environments
多角形障害物を含む混雑環境で、二重積分系のエネルギー最適軌道を整数計画問題として定式化し、距離情報を活用した探索で高速に解く手法を提案。RRT*やPRMよりエネルギーと計算時間で最大10倍優れ、Crazyflieで実機検証した。
著者: Logan E. Beaver, Roberto Tron, Christos G. Cassandras
分類: cs.RO, math.OC
原文アブストラクト
As robotic systems continue to address emerging issues in areas such as logistics, mobility, manufacturing, and disaster response, it is increasingly important to rapidly generate safe and energy-efficient trajectories. In this article, we present a new approach to plan energy-optimal trajectories through cluttered environments containing polygonal obstacles. In particular, we develop a method to quickly generate optimal trajectories for a double-integrator system, and we show that optimal path planning reduces to an integer program. To find an efficient solution, we present a distance-informed prefix search to efficiently generate optimal trajectories for a large class of environments. We demonstrate that our approach, while matching the performance of RRT* and Probabilistic Road Maps in terms of path length, outperforms both in terms of energy cost and computational time by up to an order of magnitude. We also demonstrate that our approach yields implementable trajectories in an experiment with a Crazyflie quadrotor.
