A Heuristic-Guided Dynamical Multi-Rover Motion Planning Framework for Planetary Surface Missions
IEEE Robotics and Automation Letters（2023）
摘要
We present a heuristic-guided multi-robot motion planning framework that solves the problem of
n
dynamical agents visiting
m
unlabeled targets in a partially known environment for planetary surface missions without solving the two-point boundary value problem (BVP). The framework design is motivated by typical planetary surface mission constraints of limited power, limited computation, and limited communication. The framework maintains a centralized, dynamically updated probabilistic roadmap (PRM) that incorporates new obstacle updates as the agents move in the environment. The dynamic roadmap captures the changing obstacle topology and provides updated cost-to-go heuristics to accelerate each agent's independent single-query motion-planning process. The agents use a feasible sampling-based motion planner without computing the BVP while leveraging the roadmap heuristics to quickly plan and visit their assigned target. The agents handle robot-robot and robot-obstacle collision avoidance in a decentralized fashion. We conduct multiple simulation experiments using robots with non-linear dynamics to show our planner performs better in overall planning time and mission time than approaches not using the roadmap heuristic. We also field our algorithm on prototype rovers and demonstrate the viability of implementing our algorithm on real-world hardware platforms.
更多查看译文
关键词
Path planning for multiple mobile robots,motion planning,and dynamics
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要