Multi-Agent Path Planning in Complex Environments using Gaussian Belief Propagation with Global Path Finding

Jens Høigaard Jensen, Kristoffer Plagborg Bak Sørensen, Jonas le Fevre Sejersen, Andriy Sarabakha
2/27/2025
cs.ROcs.MA

No official code found. Best implementation: AU-Master-Thesis/magics (18 stars, MIT, Rust, last commit 2025-10-12).

Abstract

Multi-agent path planning is a critical challenge in robotics, requiring agents to navigate complex environments while avoiding collisions and optimizing travel efficiency. This work addresses the limitations of existing approaches by combining Gaussian belief propagation with path integration and introducing a novel tracking factor to ensure strict adherence to global paths. The proposed method is tested with two different global path-planning approaches: rapidly exploring random trees and a structured planner, which leverages predefined lane structures to improve coordination. A simulation environment was developed to validate the proposed method across diverse scenarios, each posing unique challenges in navigation and communication. Simulation results demonstrate that the tracking factor reduces path deviation by 28% in single-agent and 16% in multi-agent scenarios, highlighting its effectiveness in improving multi-agent coordination, especially when combined with structured global planning.

View on arXivView PDF

Code Implementations(1)

RustMIT

Master Thesis Project in Computer Engineering at Aarhus University 2024 on "Simulating Multi-agent Path Planning in Complex environments using Gaussian Belief Propagation and Global Path Finding". Available here (https://drive.google.com/file/d/12g-7bqcy_yfkZdpKzxQAErayFJQhu4sE/view?usp=sharing)

183D2, CSSJan 29, 20241 years agoMIT
bevygaussian-belief-propagationroboticsrustsimulation+1 more

Similar Papers

Cite this paper

@article{jensen2025multiagent,
  title  = {Multi-Agent Path Planning in Complex Environments using Gaussian Belief Propagation with Global Path Finding},
  author = {Jens Høigaard Jensen and Kristoffer Plagborg Bak Sørensen and Jonas le Fevre Sejersen and Andriy Sarabakha},
  year   = {2025},
  eprint = {2502.20369},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.20369v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.20369.svg)](https://codeofpaper.com/paper/2502.20369)

Discussion