Solving multi-agent path planning by local search algorithms
Multi-Agent Path Planning (MAPP) in discrete space requires finding a collision-free path for each agent such that every agent can move from their starting positions to their respective destinations without colliding with other agents and static obstacles. With additional optimality criterion impose...
| Auteur principal: | |
|---|---|
| Autres auteurs: | |
| Format: | Thèse |
| Langue: | English |
| Publié: |
2015
|
| Sujets: | |
| Accès en ligne: | https://hdl.handle.net/10356/62106 |