ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Multi-Agent Path Finding”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.ROcs.AIcs.MAEmpiricalRecentAug 6, 2026

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

He Jiang, Jingtian Yan, Yulun Zhang, Yimin Tang +4 more

This paper proposes Search-Aided Joint Reinforcement Learning (SJRL) for Lifelong Multi-Agent Path Finding (LMAPF) in realistic warehouse systems with robust safety and in-place rotation constraints.

View →
cs.DScs.CGcs.DMTheoreticalRecentAug 12, 2026

Going in Circles: Collaborative Multi-Robot Treasure Hunting

Bogumil Kaminski, Pawel Pralat, Maria Sadza

This paper studies the minimum time required for n robots to individually visit k treasures on the unit circle, sharing discovery information.

View →
cs.MAcs.GTcs.ROTheoreticalRecentJun 15, 2026

Intermittent Strategic Cooperation of Two Selfish Agents on Graphs

Itay Shedlezki, Noa Agmon

This paper characterizes Pure Nash Equilibria and presents a polynomial-time algorithm for finding them in the Intermittent Strategic Cooperation-Based Two-Agent Path Planning game.

View →
cs.ROEmpiricalRecentJun 23, 2026

Varying Bundle Size Reactive Multi-Task Assignment using Selective Cost Estimation for Multi-Agent Systems

Niklas Dahlquist, Shridhar Velhal, George Nikolakopoulos

The paper presents a scalable framework for multi-robot task allocation in complex environments.

View →
cs.GTcs.MAEmpiricalRecentJul 9, 2026

Offline Nash Solvers Meet Online Tree Search in Multi-Agent Games on Graphs

Mukesh Kumar, Yue Guan, Panagiotis Tsiotras

This paper proposes Primitive-Guided Tree Search (PGTS), a hybrid framework for computing Nash equilibrium policies in multi-agent Pursuit-Evasion games by integrating offline exact computation with o…

View →
cs.CGRecentMay 31, 2026

On Fréchet Traveling Salesmen Problems

Omrit Filtser, Tzalik Maimon, Michal Moiseev

This paper introduces a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.

View →
cs.DSTheoreticalRecentJun 16, 2026

Reducing Prize-Collecting Stroll and Related Routing Problems to Prize-Collecting TSP

Hong Li

This paper improves the approximation algorithm for the prize-collecting stroll problem.

View →
cs.AIRecentMay 27, 2026

TCP-MCP: Landscape-Guided Co-Evolution of Prompts and Communication Topologies for Multi-Agent Systems

Yi Ding, Zijie Xuan, Haowei Zhou, Zhenyu Ju +5 more

The paper proposes TCP-MCP, a co-evolution framework that jointly optimizes agent prompts and communication topologies to design highly efficient and effective multi-agent systems.

View →
cs.MAcs.CLcs.LGRecentJun 1, 2026

Multi-Agent Computer Use

Jing Yu Koh, Ruslan Salakhutdinov, Daniel Fried

The paper proposes Multi-Agent Computer Use (MACU) systems, which significantly improve performance on complex, long-horizon tasks by enabling parallel execution and dynamic task decomposition compare…

View →
cs.AIRecentJun 1, 2026

Coordination Graphs for Constrained Multi-Agent Reinforcement Learning

Santiago Amaya-Corredor, Miguel Calvo-Fullana, Anders Jonsson

The paper introduces Coordination Graphs for Constrained Multi-Agent Reinforcement Learning (CG-CMARL), a scalable framework that decomposes complex joint action spaces into pairwise regions to handle…

View →
cs.MAcs.AIcs.LGEmpiricalRecentJun 24, 2026

Multi-Agent Goal Recognition with Team- and Goal-Conditioned Reinforcement Learning and Factorized Branch-and-Bound

Thiago Thomas, Gabriel de Oliveira Ramos, Felipe Meneguzzi

MAGR-BB is a method for multi-agent goal recognition that uses a shared team- and goal-conditioned policy to efficiently rank team-goal hypotheses.

View →