IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i6p902-d1359727.html
   My bibliography  Save this article

Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem

Author

Listed:
  • Ash Wan Yaw Sang

    (ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore)

  • Zhenyuan Yang

    (ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore)

  • Lim Yi

    (ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore)

  • Chee Gen Moo

    (ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore)

  • Rajesh Elara Mohan

    (ROAR Lab, Engineering Product Development, Singapore University of Technology and Design, Singapore 487372, Singapore)

  • Anh Vu Le

    (Communication and Signal Processing Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam)

Abstract

Recent advancements in autonomous mobile robots have led to significant progress in area coverage tasks. However, challenges persist in optimizing the efficiency and computational complexity of complete coverage path planner (CCPP) algorithms for multi-robot systems, particularly in scenarios requiring revisiting or a double pass in specific locations, such as cleaning robots addressing spilled consumables. This paper presents an innovative approach to tackling the double-pass complete coverage problem using an autonomous inter-reconfigurable robot path planner. Our solution leverages a modified Glasius bio-inspired neural network (GBNN) to facilitate double-pass coverage through inter-reconfiguration between two robots. We compare our proposed algorithm with traditional multi-robot path planning in a centralized system, demonstrating a reduction in algorithm iterations and computation time. Our experimental results underscore the efficacy of the proposed solution in enhancing the efficiency of area coverage tasks. Furthermore, we discuss the implementation details and limitations of our study, providing insights for future research directions in autonomous robotics.

Suggested Citation

  • Ash Wan Yaw Sang & Zhenyuan Yang & Lim Yi & Chee Gen Moo & Rajesh Elara Mohan & Anh Vu Le, 2024. "Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem," Mathematics, MDPI, vol. 12(6), pages 1-13, March.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:6:p:902-:d:1359727
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/6/902/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/6/902/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:6:p:902-:d:1359727. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.