Conflict Mitigation in Shared Environments using Flow-Aware Multi-Agent Path Finding

• URL: http://arxiv.org/abs/2603.12736v1
• Date: Fri, 13 Mar 2026 07:28:36 GMT
• Title: Conflict Mitigation in Shared Environments using Flow-Aware Multi-Agent Path Finding
• Abstract summary: Flow-Aware Multi-Agent Path Finding (FA-MAPF) is a novel framework that integrates learned motion patterns of uncontrollable agents into centralized MAPF algorithms.<n>Results show that FA-MAPF can consistently reduce conflicts with uncontrollable agents, up to 55%, without compromising task efficiency.
• Score: 18.494688528497505
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deploying multi-robot systems in environments shared with dynamic and uncontrollable agents presents significant challenges, especially for large robot fleets. In such environments, individual robot operations can be delayed due to unforeseen conflicts with uncontrollable agents. While existing research primarily focuses on preserving the completeness of Multi-Agent Path Finding (MAPF) solutions considering delays, there is limited emphasis on utilizing additional environmental information to enhance solution quality in the presence of other dynamic agents. To this end, we propose Flow-Aware Multi-Agent Path Finding (FA-MAPF), a novel framework that integrates learned motion patterns of uncontrollable agents into centralized MAPF algorithms. Our evaluation, conducted on a diverse set of benchmark maps with simulated uncontrollable agents and on a real-world map with recorded human trajectories, demonstrates the effectiveness of FA-MAPF compared to state-of-the-art baselines. The experimental results show that FA-MAPF can consistently reduce conflicts with uncontrollable agents, up to 55%, without compromising task efficiency.

Related papers

• Learning to Communicate Locally for Large-Scale Multi-Agent Pathfinding [48.1609560841622]
  We present a learnable communication module tailored to enhance cooperation between agents via efficient feature sharing.<n>Our experiments show that the introduced method outperforms the existing learning-based MAPF solvers.
  arXiv  Detail & Related papers  (2026-05-08T12:05:08Z)
• Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning [56.240199425429445]
  Multi-Robot Motion Planning (MPMP) involves generating trajectories for multiple robots operating in a shared continuous workspace.<n>While discrete multi-agent finding (MAPF) methods are broadly adopted due to their scalability, their coarse discretization trajectory quality.<n>This paper tackles limitations of two approaches by introducing discrete MAPF solvers with constrained generative diffusion models.
  arXiv  Detail & Related papers  (2025-08-27T17:59:36Z)
• MAPF-World: Action World Model for Multi-Agent Path Finding [17.847921829680576]
  Multi-agent path finding (MAPF) is the problem of planning conflict-free paths from the designated start locations to goal positions for multiple agents.<n>Recent decentralized learnable solvers have shown great promise for large-scale MAPF.<n>We propose MAPF-World, an autoregressive action world model for MAPF that unifies situation understanding and action generation.
  arXiv  Detail & Related papers  (2025-08-16T15:50:26Z)
• SIGMA: Sheaf-Informed Geometric Multi-Agent Pathfinding [11.38008343729117]
  Multi-Agent Path Finding problem is core challenge for robotic deployments in large-scale logistics and transportation.<n>We introduce a new framework that applies sheaf theory to decentralized deep reinforcement learning.<n>Our proposed method demonstrates significant improvements over state-of-the-art learning-based MAPF planners.
  arXiv  Detail & Related papers  (2025-02-10T13:17:34Z)
• Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models [57.45019514036948]
  Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics.<n>This work proposes a novel approach that integrates constrained optimization with diffusion models for MAPF in continuous spaces.
  arXiv  Detail & Related papers  (2024-12-23T21:27:19Z)
• R-AIF: Solving Sparse-Reward Robotic Tasks from Pixels with Active Inference and World Models [50.19174067263255]
  We introduce prior preference learning techniques and self-revision schedules to help the agent excel in sparse-reward, continuous action, goal-based robotic control POMDP environments. We show that our agents offer improved performance over state-of-the-art models in terms of cumulative rewards, relative stability, and success rate.
  arXiv  Detail & Related papers  (2024-09-21T18:32:44Z)
• Caution for the Environment: Multimodal LLM Agents are Susceptible to Environmental Distractions [50.5976989558411]
  This paper investigates the faithfulness of multimodal large language model (MLLM) agents in a graphical user interface (GUI) environment.<n>A general scenario is proposed where both the user and the agent are benign, and the environment, while not malicious, contains unrelated content.<n> Experimental results reveal that even the most powerful models, whether generalist agents or specialist GUI agents, are susceptible to distractions.
  arXiv  Detail & Related papers  (2024-08-05T15:16:22Z)
• Optimizing Crowd-Aware Multi-Agent Path Finding through Local Communication with Graph Neural Networks [15.88107215224685]
  Multi-Agent Path Finding (MAPF) in crowded environments presents a challenging problem in motion planning. We introduce CRAMP, a novel crowd-aware decentralized reinforcement learning approach to address this problem. CRAMP improves the solution quality up to 59% measured in makespan and collision count, and up to 35% improvement in success rate in comparison to previous methods.
  arXiv  Detail & Related papers  (2023-09-19T03:02:43Z)
• Traj-MAE: Masked Autoencoders for Trajectory Prediction [69.7885837428344]
  Trajectory prediction has been a crucial task in building a reliable autonomous driving system by anticipating possible dangers. We propose an efficient masked autoencoder for trajectory prediction (Traj-MAE) that better represents the complicated behaviors of agents in the driving environment. Our experimental results in both multi-agent and single-agent settings demonstrate that Traj-MAE achieves competitive results with state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-03-12T16:23:27Z)
• Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation [12.401344261399613]
  Multi-agent pathfinding is concerned with planning collision-free paths for a team of agents from their start to goal locations in an environment cluttered with obstacles. We introduce a new extension of MAPF, which we call Terraforming MAPF (tMAPF), where some agents are responsible for moving obstacles to clear the way for other agents. We present extensions of two state-of-the-art algorithms, CBS and PBS, in order to tackle tMAPF, and demonstrate that they can consistently outperform the best solution possible under a static-obstacle setting.
  arXiv  Detail & Related papers  (2022-03-20T12:18:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.