Multi-agent path finding
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...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2021
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/148068 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |