Multi-agent motion planning with sporadic communications for collision avoidance

Beth Boardman, Troy Harden and Sonia Martínez
IFAC Journal of Systems and Control, 15 (2021) 100-126

Abstract:

A novel multi-vehicle motion planning and collision avoidance algorithm is proposed and analyzed in this paper. The algorithm aims to reduce the amount of onboard calculations and inter-agent communications needed for each vehicle to successfully navigate through an environment with static obstacles and reach their goals. To this end, each agent first calculates a path to the goal by means of an asymptotically optimal rapidly-exploring random tree (RRT*) with respect to the static obstacles. Then, other agents are treated as dynamic obstacles and potential collisions are determined by means of collision cones. Collision cones depend on the position and velocity from other agents and are grown conservatively between inter-agent communications. Based on the available information, each agent determines if a deconfliction maneuver is needed, if it can continue along its current path, or if communication is needed to make a decision about a conflict. With probability one, our algorithm guarantees that the agents keep from colliding with each other. Under an assumption on the existence of a solution for a vehicle to its goal, this algorithm also solves the planning problem with probability one. Simulations illustrate a group of agents successfully reaching their goal configurations and examine how the uncertainty affects the communication frequency of the multi-agent system.

File: (local copy)

Bib-tex entry:

@article{BB-TH-SM:21-ifacjsc,
author = {B. Boardmand and T. Harden and S. Mart{\'\i}nez},
title = {Multi-agent motion planning with sporadic communications for collision avoidance},
journal= {{IFAC} {J}ournal of {S}ystems and {C}ontrol},
pages = {100--126},
volume = {15},
year = {2021}
}