运动规划
计算机科学
可扩展性
无人地面车辆
路径(计算)
数学优化
蚁群优化算法
人工智能
机器人
数学
数据库
程序设计语言
作者
Jing Liu,Sreenatha G. Anavatti,Matthew Garratt,Hussein A. Abbass
标识
DOI:10.1016/j.eswa.2022.116605
摘要
Path planning for multiple Unmanned Ground Vehicles (UGVs) is a critical problem for UGV autonomy and is increasingly attracting attention due to its wide applications. This paper presents a continuous ant colony-based multi-UGV path planner, which consists of UGV path planning and multi-UGV coordination. A continuous Ant Colony Optimisation with a Probability-based random-walk strategy and an Adaptive waypoints-repair method (ACOPAR) is proposed to optimise the path for each UGV. Collision avoidance among the UGVs for the multi-agent coordination problem is then resolved via a velocity shifting optimisation algorithm. In ACOPAR, exploration and exploitation are balanced using a probability-based random-walk strategy switching between a Brownian and a Cauchy motion to modify the construction process of new solutions. An adaptive waypoints-repair strategy and a re-initialisation strategy are designed to improve the algorithm's performance in finding feasible paths. A test suite of multi-UGV path planning with 12 cases is proposed to evaluate the search capability and scalability of the proposed ACOPAR compared to other algorithms. Experimental results validate the superiority of ACOPAR, especially when solving complex, high-dimensional problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI