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...
Saved in:
Main Author: | Wang, Wenjie |
---|---|
Other Authors: | Goh Wooi Boon |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/62106 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Multi-agent path finding
by: Wang, Xiaoyu
Published: (2021) -
Cloud driven implementation for multi-agent path finding
by: Datta, Anusha
Published: (2022) -
Multi agent-based electronic commerce transactions
by: Wang, Guandong
Published: (2008) -
Distributed simulation of multi-agent systems and their environments
by: Wang, Lihua
Published: (2008) -
Mobile robot path planning algorithm research
by: Duan,Yibing
Published: (2022)