| 基于改进蚁群与动态窗口法的AGV动态路径规划 |
| |
| 引用本文： | 杨周,刘海滨. 基于改进蚁群与动态窗口法的AGV动态路径规划[J]. 计算机工程与应用, 2022, 58(6): 287-295. DOI: 10.3778/j.issn.1002-8331.2108-0501 |
| |
| 作者姓名： | 杨周 刘海滨 |
| |
| 作者单位： | 北京工业大学 材料与制造学部，北京 100124 |
| |
| 摘 要： | 针对全局静态路径规划算法无法有效躲避动态障碍物、局部动态路径规划算法缺少全局环境信息指导规划路径质量差或无法成功到达目标点等问题,提出了一种结合改进蚁群算法和动态窗口法的全局动态路径规划算法,实现在动态环境中的全局最优路径实时规划.对传统蚁群算法提出了初始信息素不均匀、双向分布、引入放大系数A增大相邻栅格启发信息差异、...
|
| 关 键 词： | 改进蚁群算法 动态窗口法 全局动态路径规划 |
AGV Dynamic Path Planning Based on Improved Ant Colony Algorithm and Dynamic Window Approach |
| |
| YANG Zhou,LIU Haibin. AGV Dynamic Path Planning Based on Improved Ant Colony Algorithm and Dynamic Window Approach[J]. Computer Engineering and Applications, 2022, 58(6): 287-295. DOI: 10.3778/j.issn.1002-8331.2108-0501 |
| |
| Authors: | YANG Zhou LIU Haibin |
| |
| Affiliation: | Faculty of Materials and Manufacturing, Beijing University of Technology, Beijing 100124, China |
| |
| Abstract: | Given the defects that the global static path planning algorithm cannot effectively avoid dynamic obstacles, and the local dynamic path planning algorithm lacks the guidance of global environmental information that the planning path quality is poor or cannot successfully reach the target point. A global dynamic path planning algorithm combining an improved ant colony algorithm and a dynamic window approach is proposed in this paper to realize the globally optimal path real-time planning in the dynamic environment. For the traditional ant colony algorithm, the improved strategies such as uneven and bidirectional distribution of the initial pheromone, increasing the difference of heuristic information between adjacent grids by introducing the increasing coefficient [A,] and considering the influence of turning times when selecting the optimal path are proposed. The distance evaluation sub-function and initial heading angle of the dynamic window approach are improved. The turning point of the globally optimal path planned by the improved ant colony algorithm is extracted as the sub-target point to guide the dynamic window method to carry out real-time dynamic path planning along the direction of the globally optimal path. Simulation experiments in different environments show that the global dynamic path planning algorithm proposed in this paper can effectively plan the globally optimal path while avoiding dynamic obstacles through real-time dynamic path planning. |
| |
| Keywords: | improved ant colony algorithm dynamic window approach global dynamic path planning |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
