Robust and effective multi-agent path execution with timing uncertainty

DOI10.1016/J.ARTINT.2026.104586MaRDI QIDQ7323910zbMATH OpenFDO

Authors Yihao Liu, Xueyan Tang, Wentong Cai, Jingning Li

Publication date 2 September 2026

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2026.104586

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Agent technology and artificial intelligence (68T42)

Cites work

• Conflict-based search for optimal multi-agent pathfinding
• Depth-First Search and Linear Graph Algorithms
• Job-shop scheduling with blocking and no-wait constraints
• Predicting deadlock in store‐and‐forward networks
• Reducibility among combinatorial problems
• Robust multi-agent path finding and executing
• Safe multi-agent pathfinding with time uncertainty
• Selecting and covering colored points

This page was built for publication: Robust and effective multi-agent path execution with timing uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7323910)