The ability to avoid collisions with moving robots is critical in many applications. Moreover, if the robots have limited battery life, the goal is not only to avoid collisions but also to design efficient trajectories in terms of energy consumption and total mission time. This paper proposes a novel strategy for assigning turn angles for collision-free path planning in scenarios where a small team of robots cooperate in a certain mission. The algorithm allows each robot to reach a predetermined destination safely. It establishes consecutive, short time intervals, and at each interval, possible conflicts are solved centrally in an optimal manner. This is done by keeping constant speeds but generating a discrete set of possible directions for each robot, and solving efficiently the turn-angle allocation for a collision-free path that minimizes the path deviation from the shortest one. Due to the discretization, the final paths are not optimal, but the system can react to possible failures during execution, as conflicts are resolved at each time interval. Computational results and Software-In-The-Loop simulations are presented in order to evaluate the proposed algorithm. A comparison with a state-of-the-art approach shows that our algorithm is more energy-efficient and achieves lower mission completion time.
原文链接
分享
引用
