IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v195y2022icp197-226.html
   My bibliography  Save this article

Multi-robot co-operation for stick carrying application using hybridization of meta-heuristic algorithm

Author

Listed:
  • Sahu, Bandita
  • Das, Pradipta Kumar
  • Kabat, Manas Ranjan

Abstract

The paper offers a novel technique for resolving the multi-robot cooperation for stick carrying applications. The problem addresses the computation of a collision-free optimal path from a predefined initial position to target position during transportation of stick or object cooperatively by robot pair in the multi-robot environment. The stick carrying application has been resolved by embedding the modified Q-learning into the hybrid process of an improved version of particle swarm optimization and intelligent water drop algorithm. In the present context, modified Q-learning generates the best solution for particle swarm optimization and particle swarm optimization is upgraded through the perception of cubic spline and generate the optimal position in the successive iteration using intelligent water drop algorithm and also enhances the intensification and diversification capability of particle swarm optimization. The proposed hybrid algorithm computes the collision-free subsequent position for each robot pair by avoiding the obstacles in its path, avoiding the trapping at the local optima, improving the convergence speed, optimizing the path distance for every pair of robots, energy usage and path smoothness both in the static and dynamic environment’s. The validation of the proposed hybrid algorithm has been verified and checked the robustness of the algorithm through computer simulation and real robots through Webots simulator. Further, the efficiency of the proposed algorithm has been verified by comparing the result obtained proposed algorithm and its competitor algorithms and comparing the result of the proposed algorithm with the existing state-of arts. The comparison result shows that the proposed algorithm is superior to its competitor algorithms and state of arts for different matrices.

Suggested Citation

  • Sahu, Bandita & Das, Pradipta Kumar & Kabat, Manas Ranjan, 2022. "Multi-robot co-operation for stick carrying application using hybridization of meta-heuristic algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 195(C), pages 197-226.
  • Handle: RePEc:eee:matcom:v:195:y:2022:i:c:p:197-226
    DOI: 10.1016/j.matcom.2022.01.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475422000106
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2022.01.010?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sung, Inkyung & Choi, Bongjun & Nielsen, Peter, 2021. "On the training of a neural network for online path planning with offline path planning algorithms," International Journal of Information Management, Elsevier, vol. 57(C).
    2. Jianfang Lian & Wentao Yu & Kui Xiao & Weirong Liu, 2020. "Cubic Spline Interpolation-Based Robot Path Planning Using a Chaotic Adaptive Particle Swarm Optimization Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-20, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lili Wu & Dongyun Wang & Chunwei Zhang & Ardashir Mohammadzadeh, 2022. "Chaotic Synchronization in Mobile Robots," Mathematics, MDPI, vol. 10(23), pages 1-15, December.
    2. Dmitriy Kvitko & Vyacheslav Rybin & Oleg Bayazitov & Artur Karimov & Timur Karimov & Denis Butusov, 2024. "Chaotic Path-Planning Algorithm Based on Courbage–Nekorkin Artificial Neuron Model," Mathematics, MDPI, vol. 12(6), pages 1-20, March.
    3. Jose-Cruz Nuñez-Perez & Vincent-Ademola Adeyemi & Yuma Sandoval-Ibarra & Francisco-Javier Perez-Pinal & Esteban Tlelo-Cuautle, 2021. "Maximizing the Chaotic Behavior of Fractional Order Chen System by Evolutionary Algorithms," Mathematics, MDPI, vol. 9(11), pages 1-22, May.

    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:eee:matcom:v:195:y:2022:i:c:p:197-226. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.