Distributed Navigation with Dynamic Obstacles

One of the key challenges for multi-agent systems is collision free navigation in an unknown environment. In this work, we propose a unified framework for joint localization, control, and collision avoidance of multi-agent systems navigating in an unknown environment in the presence of dynamic obstacles. The cooperative agents rely on information from immediate neighboring agents within their communication neighborhood, and the dynamic obstacles are modelled as non-cooperative agents. The agents achieve localization by exploiting the individual agent dynamics, and pairwise distance measurements with agents in the sensing neighborhood of each cooperative agent. To ensure collision-free navigation, we exploit a Model Predictive Control (MPC) for each agent, with avoidance constraints using safety radius between pairwise agents. Futhermore, to avoid single point of failure, we propose Cooperative Positioning, Control and Collision Avoidance (CPCCA), which is based on distributed Method of Multipliers methods. We validate our framework and algorithms through simulations, demonstrating its effectiveness in real world scenarios, and propose directions for future work.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10888973
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Navigation with Dynamic Obstacles

Raj Thilak Rajan, Ellen Riemens
1 citations
Robotic Path Planning Algorithms
1.28
article

Distributed Navigation with Dynamic Obstacles

Raj Thilak Rajan, Ellen Riemens
article en
1 citations

Abstract

One of the key challenges for multi-agent systems is collision free navigation in an unknown environment. In this work, we propose a unified framework for joint localization, control, and collision avoidance of multi-agent systems navigating in an unknown environment in the presence of dynamic obstacles. The cooperative agents rely on information from immediate neighboring agents within their communication neighborhood, and the dynamic obstacles are modelled as non-cooperative agents. The agents achieve localization by exploiting the individual agent dynamics, and pairwise distance measurements with agents in the sensing neighborhood of each cooperative agent. To ensure collision-free navigation, we exploit a Model Predictive Control (MPC) for each agent, with avoidance constraints using safety radius between pairwise agents. Futhermore, to avoid single point of failure, we propose Cooperative Positioning, Control and Collision Avoidance (CPCCA), which is based on distributed Method of Multipliers methods. We validate our framework and algorithms through simulations, demonstrating its effectiveness in real world scenarios, and propose directions for future work.

Delft University of Technology (NL)
European Commission
Affordable and clean energy
Openalex Percentile: Top 22%
Robotic Path Planning Algorithms
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.