Multi-agent path finding (part B)
Multi-Agent Pathfinding (MAPF) is the problem of finding paths efficient collision-free paths for sets of agents with a designated start and end goal. This project aims to implement and evaluate the algorithms suitable for the MAPF problem in real-time with the involvement of a waypoint. In the proj...
Saved in:
Main Author: | Cao, Lifeng |
---|---|
Other Authors: | Tang Xueyan |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/138110 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Multi-agent path finding (part A)
by: Ong, Wei Hua
Published: (2020) -
Shortest Dubins path for forward moving robots
by: Chan, Chor Cheng
Published: (2023) -
Novel approach to solving stochastic constrained shortest path problem with quantum computing
by: Yang, Richard Chen Xiao
Published: (2023) -
Find your neighbors (quickly!)
by: Wong, Wei Tian.
Published: (2012) -
Stochastic genetic strategy in multi-objectives optimization
by: Gwee, Bah Hwee.
Published: (2008)