Multi-agent path finding (part A)
Multi-Agent Path Finding algorithm has become a topic that has been actively researched in the field of Artificial Intelligence. As the technology advances each year, many of our process has been automated and are being carried out by robot agents to complete the tasks. Single-agent path finding alg...
Main Author: | Ong, Wei Hua |
---|---|
Other Authors: | Tang Xueyan |
Format: | Final Year Project (FYP) |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/138430 |
Similar Items
-
Shortest Dubins path for forward moving robots
by: Chan, Chor Cheng
Published: (2023) -
Find your neighbors (quickly!)
by: Wong, Wei Tian.
Published: (2012) -
Novel approach to solving stochastic constrained shortest path problem with quantum computing
by: Yang, Richard Chen Xiao
Published: (2023) -
Multi-agent path finding (part C)
by: Chua, Wen Kai
Published: (2020) -
A conceptual modeling of meme complexes in stochastic search
by: Chen, Xianshun, et al.
Published: (2013)