Decentralized Uncertainty-Aware Multi-Agent Collision Avoidance with Model Predictive Path Integral
Decentralized multi-agent navigation under uncertainty is a complex task that arises in numerous robotic applications. It requires collision avoidance strategies that account for both kinematic constraints, sensing and action execution noise. In this paper, we propose a novel approach that integrates the Model Predictive Path Integral (MPPI) with a probabilistic adaptation of Optimal Reciprocal Collision Avoidance. Our method ensures safe and efficient multi-agent navigation by incorporating probabilistic safety constraints directly into the MPPI sampling process via a Second-Order Cone Programming formulation. This approach enables agents to operate independently using local noisy observations while maintaining safety guarantees. We validate our algorithm through extensive simulations with differential-drive robots and benchmark it against state-of-the-art methods, including ORCA-DD and B-UAVC. Results demonstrate that our approach outperforms them while achieving high success rates, even in densely populated environments. Additionally, validation in the Gazebo simulator confirms its practical applicability to robotic platforms. A source code is available at http://github.com/PathPlanning/MPPI-Collision-Avoidance.
Code (0)
등록된 구현이 없습니다.
Tasks
Collision AvoidanceSimilar Papers 제목 키워드 기반
Risk-aware Safe Control for Decentralized Multi-agent Systems via Dynamic Responsibility Allocation
Decentralized control schemes are increasingly favored in various domains that involve multi-agent systems due to the need for computational efficiency as well as general applicability to large-scale systems. However, in…
Autonomous DrivingComputational EfficiencyRemote ID Spoofing-Aware Trajectory Planning for Small Unmanned Aerial Systems
This work presents a decentralized, spoofing-aware trajectory planning framework for small unmanned aerial systems operating under Remote Identification (RID) location spoofing attacks. Existing planners typically assume…
Computational EfficiencyTrajectory PlanningCollision AvoidanceOptimizing Crowd-Aware Multi-Agent Path Finding through Local Communication with Graph Neural Networks
Multi-Agent Path Finding (MAPF) in crowded environments presents a challenging problem in motion planning, aiming to find collision-free paths for all agents in the system. MAPF finds a wide range of applications in vari…
Decision MakingMotion PlanningMulti-Agent Path Findingreinforcement-learningQMNet: Importance-Aware Message Exchange for Decentralized Multi-Agent Reinforcement Learning
To improve the performance of multi-agent reinforcement learning under the constraint of wireless resources, we propose a message importance metric and design an importance-aware scheduling policy to effectively exchange…
Multi-agent Reinforcement Learningreinforcement-learningSchedulingSemi-Decentralized Multi-Spacecraft Collision Avoidance under Communication Constraints
Current spacecraft collision-avoidance operations rely on intermittent ground-station contacts, requiring operators to plan with delayed and asynchronously updated information. Consequently, maneuvers must be planned wit…
Collision Avoidance