IDEAS home Printed from https://ideas.repec.org/a/hin/complx/8128847.html
   My bibliography  Save this article

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

Author

Listed:
  • Jingye He
  • Junpeng Shao
  • Guitao Sun
  • Siew Ann Cheong

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.

Suggested Citation

  • Jingye He & Junpeng Shao & Guitao Sun & Siew Ann Cheong, 2023. "The Quadruped Robot Uses the Trajectory Planned by DIACO to Complete the Obstacle Avoidance Task," Complexity, Hindawi, vol. 2023, pages 1-14, July.
  • Handle: RePEc:hin:complx:8128847
    DOI: 10.1155/2023/8128847
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2023/8128847.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2023/8128847.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2023/8128847?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:8128847. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.