The Quadruped Robot Uses the Trajectory Planned by DIACO to Complete the Obstacle Avoidance Task

Jing He, Junpeng Shao, Guitao Sun
{"title":"The Quadruped Robot Uses the Trajectory Planned by DIACO to Complete the Obstacle Avoidance Task","authors":"Jing He, Junpeng Shao, Guitao Sun","doi":"10.1155/2023/8128847","DOIUrl":null,"url":null,"abstract":"The diffusion-improved ant colony optimization (DIACO) algorithm, as introduced in this paper, addresses the slow convergence speed and poor stability of the ant colony optimization (ACO) in obstacle avoidance path planning for quadruped robots. DIACO employs a nonuniformly distributed initial pheromone, which reduces the blind search time in the early stage. The algorithm updates the heuristic information in the transition probability, which allows ants to better utilize the information from the previous iteration during their path search. Simultaneously, DIACO adjusts the pheromone concentration left by ants on the path based on the map information and diffuses the pheromone within a specific range following the artificial potential field algorithm. In the global pheromone update, DIACO adjusts the pheromone on both the optimal path and the worst path generated by the current iteration, thereby enhancing the probability of ants finding the optimal path in the subsequent iteration. This paper designs a steering gait based on the tort gait to fulfill the obstacle avoidance task of a quadruped robot. The effectiveness of the DIACO algorithm and steering gait is validated through a simulation environment with obstacles constructed in Adams. The simulation results reveal that DIACO demonstrates improved convergence speed and stability compared to ACO, and the quadruped robot effectively completes the obstacle avoidance task using the path planning provided by DIACO in combination with the steering gait.","PeriodicalId":72654,"journal":{"name":"Complex psychiatry","volume":"41 1","pages":"8128847:1-8128847:14"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex psychiatry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2023/8128847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The diffusion-improved ant colony optimization (DIACO) algorithm, as introduced in this paper, addresses the slow convergence speed and poor stability of the ant colony optimization (ACO) in obstacle avoidance path planning for quadruped robots. DIACO employs a nonuniformly distributed initial pheromone, which reduces the blind search time in the early stage. The algorithm updates the heuristic information in the transition probability, which allows ants to better utilize the information from the previous iteration during their path search. Simultaneously, DIACO adjusts the pheromone concentration left by ants on the path based on the map information and diffuses the pheromone within a specific range following the artificial potential field algorithm. In the global pheromone update, DIACO adjusts the pheromone on both the optimal path and the worst path generated by the current iteration, thereby enhancing the probability of ants finding the optimal path in the subsequent iteration. This paper designs a steering gait based on the tort gait to fulfill the obstacle avoidance task of a quadruped robot. The effectiveness of the DIACO algorithm and steering gait is validated through a simulation environment with obstacles constructed in Adams. The simulation results reveal that DIACO demonstrates improved convergence speed and stability compared to ACO, and the quadruped robot effectively completes the obstacle avoidance task using the path planning provided by DIACO in combination with the steering gait.
四足机器人利用DIACO规划的轨迹完成避障任务
针对蚁群算法在四足机器人避障路径规划中收敛速度慢、稳定性差的问题,提出了扩散改进蚁群算法。DIACO采用非均匀分布的初始信息素,减少了早期的盲搜索时间。该算法在转移概率中更新启发式信息,使蚂蚁在路径搜索中更好地利用前一次迭代的信息。同时,DIACO根据地图信息调整蚂蚁在路径上留下的信息素浓度,并按照人工势场算法将信息素扩散到特定范围内。在全局信息素更新中,DIACO对当前迭代生成的最优路径和最差路径上的信息素进行调整,从而提高蚂蚁在后续迭代中找到最优路径的概率。为了完成四足机器人的避障任务,本文在侵权步态的基础上设计了一种转向步态。通过在Adams中构建障碍物仿真环境,验证了DIACO算法和转向步态的有效性。仿真结果表明,与蚁群算法相比,DIACO算法具有更高的收敛速度和稳定性,四足机器人利用DIACO算法提供的路径规划与转向步态相结合,有效地完成了避障任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.80
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信