A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees

• Main Authors: He, Xiaoyu, Tang, Xueyan, Cai, Wentong, Li, Jingning
• Other Authors: School of Computer Science and Engineering
• Format: Article
• Language: English
• Published: 2024
• Subjects: Computer and Information Science; Multi-agent path finding; Non-asymptotic performance
• Online Access: https://hdl.handle.net/10356/174651
• Institution: Nanyang Technological University

Multi-agent path finding (MAPF) is a classical NP-hard problem that considers planning collision-free paths for multiple agents simultaneously. A MAPF problem is typically solved via addressing a sequence of single-agent path finding subproblems in which well-studied algorithms such as A⁎ are applic...