Multi-agent path finding

• المؤلف الرئيسي: Jia, Xiaochen
• مؤلفون آخرون: Tang Xueyan
• التنسيق: Final Year Project
• اللغة: English
• منشور في: Nanyang Technological University 2021
• الموضوعات: Engineering::Computer science and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/148068
• المؤسسة: Nanyang Technological University

In the multi-agent path finding (MAPF) problem, we are given a set of agents, each with a start and goal position. The task is to find paths for all agents while avoiding any collision. In the k-Robust multi-agent path finding (kR-MAPF) problem, possible delays of agents are also taken into consid...