Skip to content

DPCN: enabling efficient multi-agent path finding via decentralized-planning-centralized-negotiation paradigm

Jul 2026 · Science China Information Sciences · Vol 69 · 0 citations · 9 references

TL;DR

This work presents a decentralized approach to solving the multi-agent path problem, allowing each agent to dynamically interact with the environment and make decisions based on information within its localFOV.

View source

Similar papers

Open access Aug 2026

Decentralized Model-Based ACKTR for Large-Scale Multi-Agent Path Planning Under Partial Observability

This work formulate large-scale MAPP as a partially observable networked Markov decision process as a decentralized model-based Actor-Critic using the Kronecker-factored trust region (DM-ACKTR) algorithm, which consistently obtains the highest TCR and lowest CR.

Ye-Min Liu, Jin-Hao Yang, Xiang-Yu Ma et al. · 0 citations
Open access Jul 2026

MULTI-UAV COORDINATED PATH PLANNING USING A MULTI-AGENT SOFT ACTOR-CRITIC ALGORITHM

An efficient way to resolve the curse of dimensionality, improve obstacle avoidance and cooperative formation control of UAVs was found and shows great prospects of practical application in such domains as military operations, search and rescue missions, transport automation and disaster management.

Qadir Talibov · 0 citations
Preprint Aug 2026

Scalable Multi-Agent Maze Traversal with Local Communication

This work proposes a distributed algorithm that enables agents to collectively traverse an unknown, possibly cyclic graph and proves that the algorithm is complete, that its makespan is asymptotically equivalent to that of an optimal full-knowledge strategy, and derive its time and space complexity.

Julian Rau, Jahir Argote-Gerald, Grace McFassel et al. · 0 citations
Open access 2023

Multi-Agent Coordination Framework for Autonomous Delivery Robots in Dense Urban Environments

A novel distributed hybrid coordination framework that integrates macroscopic consensus-based task allocation with localized, dynamic conflict resolution strategies and is highly resilient and viable for high-density, real-world autonomous logistics infrastructures is presented.

Thomas Fischer, Anna Schmidt · 0 citations
Preprint Aug 2026

Search-Aided Joint Agent-Environment Reinforcement Learning for Robust Lifelong Multi-Agent Path Finding with Rotations

This work introduces a unified RL formulation that jointly optimizes agent and environment policies, where the environment policy learns graph edge costs to provide global movement guidance via backward Dijkstra search and achieves significant improvements over the strong search-based planner, Causal-PIBT, across multi...

He Jiang, Jingtian Yan, Yulun Zhang et al. · 0 citations
#artificial intelligence Open access Aug 2026

Generalizable Multi-Agent Planning From Signal Temporal Logic Specifications via Diffusion

A new diffusion method for multi-agent planning with STL specifications is introduced, making the approach generalizable to novel formulas whose predicates are placed anywhere within the goal region covered during training, while achieving the same scalability as existing learning-based methods.

Joe Eappen, Zikang Xiong, S. Iyengar et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.