Multi-agent path finding
The Multi-Agent Path Finding (MAPF) problem is about finding the paths for multiple agents from a source vertex to a target vertex. The key is to design and implement a collision-free algorithm with consideration of different types of constraints. It has many real-life applications, especially in th...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/165898 |