Name
Abstract | ||
|---|---|---|
Multi-agent path planning has wide application in fields such as robotics, transportation, logistics, computer games, etc.. To formulate the multi-agent path finding as a concisely discretized problem, most of the previous works did not construct a detailed motion model of each agent. While many elegant algorithms were proposed in the literature, a method to efficiently plan the paths for multi agents with non-constant velocity is still lacking. In this paper, we propose two methods CRISE and COB to extend the existing algorithms for non-constant velocity motion path planning. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.5555/3306127.3332013 | adaptive agents and multi-agents systems |
Field | DocType | Citations |
Motion planning,Discretization,Mathematical optimization,Computer science,Artificial intelligence,Robotics,Distributed computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 9 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| ngai meng kou | 1 | 38 | 5.17 |
| Cheng Peng | 2 | 9 | 8.32 |
| Xiaowei Yan | 3 | 0 | 0.34 |
| Zhiyuan Yang | 4 | 20 | 7.61 |
| Heng Liu | 5 | 0 | 4.39 |
| Kai Zhou | 6 | 33 | 11.88 |
| Haibing Zhao | 7 | 0 | 0.34 |
| Lijun Zhu | 8 | 28 | 3.45 |
| Yinghui Xu | 9 | 172 | 20.23 |