蚁群优化算法
跳跃
计算机科学
路径(计算)
算法
运动规划
数学优化
平滑度
启发式
点(几何)
趋同(经济学)
人工智能
机器人
数学
数学分析
物理
几何学
量子力学
经济
程序设计语言
经济增长
作者
Tao Chen,Suifan Chen,Kuoran Zhang,Guoting Qiu,Qipeng Li,Xinmin Chen
标识
DOI:10.1177/17298806221127953
摘要
To improve the finding path accuracy of the ant colony algorithm and reduce the number of turns, a jump point search improved ant colony optimization hybrid algorithm has been proposed in this article. Firstly, the initial pheromone concentration distribution gets from the jump points has been introduced to guide the algorithm in finding the way, thus accelerating the early iteration speed. The turning cost factor in the heuristic function has been designed to improve the smoothness of the path. Finally, the adaptive reward and punishment factor, and the Max–Min ant system have been introduced to improve the iterative speed and global search ability of the algorithm. Simulation through three maps of different scales is carried out. Furthermore, the results prove that the jump point search improved ant colony optimization hybrid algorithm performs effectively in finding path accuracy and reducing the number of turns.
科研通智能强力驱动
Strongly Powered by AbleSci AI