Multi-agent path finding
The Multi-Agent Path Finding (MAPF) problem aims to find a set of paths for a set of agents to move from their respective initial positions to goal positions without collision. This problem has a number of real-life applications, especially in the area of robotics and planning. A novel approach...
Saved in:
Main Author: | Wang, Xiaoyu |
---|---|
Other Authors: | Tang Xueyan |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/148107 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Cloud driven implementation for multi-agent path finding
by: Datta, Anusha
Published: (2022) -
Lifelong multi-agent pathfinding with online tasks
by: Tay, David Ang Peng
Published: (2023) -
Solving multi-agent path planning by local search algorithms
by: Wang, Wenjie
Published: (2015) -
Building robust trust model for multi-agent systems
by: Weng, Jian Shu
Published: (2008) -
A path finding simulation model for human crowd using agent based ant colony optimization
by: Tin Htet Kyaw @ Jame Ng.
Published: (2011)