Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Multi-agent motion planning with sporadic communications for collision avoidance

Journal Article · · IFAC Journal of Systems and Control
Here, a novel multi-vehicle motion planning and collision avoidance algorithm is proposed and analyzed. 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.
Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE; USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
89233218CNA000001
OSTI ID:
1727412
Alternate ID(s):
OSTI ID: 1810982
Report Number(s):
LA-UR--18-29960
Journal Information:
IFAC Journal of Systems and Control, Journal Name: IFAC Journal of Systems and Control Journal Issue: C Vol. 15; ISSN 2468-6018
Publisher:
ElsevierCopyright Statement
Country of Publication:
United States
Language:
English

References (13)

Reciprocal n-Body Collision Avoidance book December 2010
A Probabilistically Robust Path Planning Algorithm for UAVs Using Rapidly-Exploring Random Trees journal September 2012
The increasing cost tree search for optimal multi-agent pathfinding journal February 2013
Probabilistic roadmaps for path planning in high-dimensional configuration spaces journal January 1996
Distributed dynamic priority assignment and motion planning for multiple mobile robots with kinodynamic constraints conference July 2016
Robust adaptive motion planning in the presence of dynamic obstacles conference July 2016
Optimal kinodynamic motion planning using incremental sampling-based methods conference December 2010
Use of relaxation methods in sampling-based algorithms for optimal motion planning conference May 2013
Decoupled multiagent path planning via incremental sequential convex programming conference May 2015
A survey of intelligent vehicle applications worldwide conference January 2000
Sampling-based algorithms for optimal motion planning journal June 2011
Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions journal May 2015
Real-Time Motion Planning for Agile Autonomous Vehicles journal January 2002

Similar Records

Sampling-Based Motion Planning Algorithms for Replanning and Spatial Load Balancing
Technical Report · Thu Oct 12 00:00:00 EDT 2017 · OSTI ID:1400115

Distributionally Safe Path Planning: Wasserstein Safe RRT
Journal Article · Tue Nov 16 19:00:00 EST 2021 · IEEE Robotics and Automation Letters · OSTI ID:1878051

Improved Performance of Asymptotically Optimal Rapidly Exploring Random Trees
Journal Article · Sun Aug 19 20:00:00 EDT 2018 · Journal of Dynamic Systems, Measurement, and Control · OSTI ID:1467259