国产欧美精品一区二区,中文字幕专区在线亚洲,国产精品美女网站在线观看,艾秋果冻传媒2021精品,在线免费一区二区,久久久久久青草大香综合精品,日韩美aaa特级毛片,欧美成人精品午夜免费影视

基于勢場(chǎng)蟻群算法的倉儲搬運機器人避障控制方法
DOI:
CSTR:
作者:
作者單位:

作者簡(jiǎn)介:

通訊作者:

中圖分類(lèi)號:

基金項目:

陜西省自然科學(xué)基金課題(2021JZ-04)


Obstacle Avoidance Control Method of Warehouse Handling Robot Based on Potential ant Colony Algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 圖/表
  • |
  • 訪(fǎng)問(wèn)統計
  • |
  • 參考文獻
  • |
  • 相似文獻
  • |
  • 引證文獻
  • |
  • 資源附件
  • |
  • 文章評論
    摘要:

    針對現有倉儲搬運機器人避障控制算法存在的路徑尋優(yōu)易陷入局部最優(yōu)解,及多機器人同時(shí)作業(yè)易發(fā)生碰撞等問(wèn)題,對物流機器人的避障控制進(jìn)行了研究,并提出一種基于改進(jìn)勢場(chǎng)蟻群的控制算法。對機器人搬運過(guò)程中的移動(dòng)軌跡進(jìn)行了研究,給出了機器人空間運動(dòng)學(xué)方程。采用了蟻群算法對經(jīng)典人工勢場(chǎng)算法進(jìn)行優(yōu)化,提升全局尋優(yōu)能力并平衡引力和斥力的相互作用關(guān)系;在倉儲搬運機器人的局部區域避障方面,基于策略梯度算法對人工勢場(chǎng)做二次優(yōu)化,通過(guò)分析下一動(dòng)作指令的發(fā)生概率,改善多機器人同時(shí)作業(yè)時(shí)行進(jìn)路徑選擇的隨機性。經(jīng)測試,提出控制算法的路徑最短,完成單次運輸任務(wù)耗時(shí)僅為12.3s,而且在復雜路徑規劃條件下,機器人之間發(fā)生碰撞的次數也顯著(zhù)少于傳統避障控制算法,經(jīng)實(shí)際應用能夠滿(mǎn)足提升倉儲物流管理效率的需求。

    Abstract:

    Aiming at the problems of path optimization and collision of multiple robots, the obstacle avoidance control algorithm of warehouse handling robots is studied and a control algorithm based on potential ant colony is proposed. The moving trajectory of the robot in the process of transport is studied, and the space kinematics equation is given. The ant colony algorithm is used to optimize the classical artificial potential field algorithm, improve the global optimization ability and balance the relationship between gravity and repulsion. In the aspect of local obstacle avoidance of warehouse handling robots, the artificial potential field is optimized twice based on the strategy gradient algorithm, and the randomness of path selection when multiple robots work at the same time is improved by analyzing the probability of occurrence of the next action instruction. After testing, the proposed control algorithm has the shortest path and only takes 12.3s to complete a single transportation task. Moreover, under the condition of complex path planning, the number of collisions between robots is significantly less than that of the traditional obstacle avoidance control algorithm, which can meet the needs of warehousing and logistics through practical application.

    參考文獻
    相似文獻
    引證文獻
引用本文

陳楠,杜鵬,喬立春.基于勢場(chǎng)蟻群算法的倉儲搬運機器人避障控制方法計算機測量與控制[J].,2024,32(8):168-173.

復制
分享
文章指標
  • 點(diǎn)擊次數:
  • 下載次數:
  • HTML閱讀次數:
  • 引用次數:
歷史
  • 收稿日期:2023-12-11
  • 最后修改日期:2024-01-08
  • 錄用日期:2024-01-10
  • 在線(xiàn)發(fā)布日期: 2024-09-02
  • 出版日期:
文章二維碼
娄底市| 石景山区| 宜兴市| 昌平区| 揭阳市| 内丘县| 辰溪县| 宁波市| 乐平市| 卢氏县| 天峨县| 锡林郭勒盟| 武宁县| 客服| 南康市| 青神县| 苗栗市| 余庆县| 包头市| 友谊县| 宾川县| 如东县| 紫金县| 宜阳县| 泗阳县| 福建省| 芜湖市| 漳浦县| 安阳市| 锦屏县| 武强县| 锡林郭勒盟| 灵山县| 资阳市| 普格县| 伊宁县| 泽普县| 祁连县| 天长市| 珠海市| 华蓥市|