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:
Main Author: | Jia, Xiaochen |
---|---|
Other Authors: | Tang Xueyan |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/148068 |
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: Feng, Qingyu
Published: (2023) -
Multi-agent path finding
by: Wang, Xiaoyu
Published: (2021) -
Multi-agent path finding visualizer
by: Tran, Anh Tai
Published: (2022) -
Multi-agent path finding (D)
by: Ang, Yong Xin
Published: (2022) -
Multi-agent path finding (part C)
by: Chua, Wen Kai
Published: (2020)