蚁群优化算法
路径(计算)
计算机科学
算法
数学优化
运动规划
元启发式
全局优化
启发式
元优化
人工智能
数学
机器人
程序设计语言
作者
Yun Ni,Qinghua Zhuo,Ning Li,Kaihuan Yu,Miao He,Xinlong Gao
标识
DOI:10.1142/s0218001423510060
摘要
A* algorithm and ant colony optimization (ACO) are more widely used in path planning among global path planning algorithms. The optimization process is analyzed and summarized from the principles and characteristics of the two algorithms, A* algorithm is mainly optimized in terms of point selection and improvement of heuristic function; and ACO is mainly investigated in terms of transfer probability and pheromone positive feedback for improvement and optimization. Taking a single algorithm solving complex optimization problems difficulties into consideration, a splitting strategy can be used. So that local path or intelligent path optimization algorithms are incorporated in global path planning to improve search efficiency and optimization quality.
科研通智能强力驱动
Strongly Powered by AbleSci AI