Author:
Hu Biao,Xu Shengjie,Cao Zhengcai
Subject
Control and Systems Engineering
Reference20 articles.
1. Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem;Barer;Frontiers in Artificial Intelligence and Applications,2014
2. Pareto-optimal coordination of multiple robots with safety guarantees;Cui;Autonomous Robots,2012
3. Dewangan, R.K., Godfrey, W.W., and Shukla, A. (2019). Conflict resolutions for trajectory co-ordination of multiple mobile robots. In International Conference on Computer Communication and Informatics (IGGGI), 1-4.
4. Han, S.D., Rodriguez, E.J., and Yu, J. (2018). Sear: A polynomial-time multi-robot path planning algorithm with expected constant-factor optimality guarantee. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 1—9.
5. Han, S.D. and Yu, J. (2019). Effective heuristics for multi-robot path planning in warehouse environments. In International Symposium on Multi-Robot and Multi-Agent Systems (MRS), 10-12.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Several Adaptable Robot engagements planning with blending Conflict and plan resolution;2022 International Conference on Innovative Computing, Intelligent Communication and Smart Electrical Systems (ICSES);2022-07-15
2. Research on intelligent path planning technology of logistics robots based on Giraph architecture;International Journal of Computing Science and Mathematics;2022