FAULT-DETECTION ON MULTI-ROBOT PATH PLANNING
Main Article Content
Abstract
This One of the essential issues in coordinated multi-robot path planning and area exploration is how to allocate target location to the individual robot and how to superior share out the robots in the environment. In this process, they must have an optimal motion planning algorithm to find out the minimum path with the lesser amount of time and minimum amount of energy. Given environment is divided into subarea equal to the available number of robots using circle partitioning method. Every robot finds the shortest path for the given subarea assigned to them. It may be possible that in any sector there is a high density of obstacles or path planning capability of any robot is not good as compared to others. So path planning in that sector or by that robot will be done easily. Our involvement is in three fold: (1) EA* algorithm for path planning; (2) assignment technique is to better share out the robots in the environment; (3) fault-detection algorithm, if one or more robot may fail during the path planning. Our proposed algorithm has been tested for the different environments with the different level of complexity depending on the number of obstacles. Here, the fault-detection concept is added that means if any robot may fail during the path planning then it can be handled easily.
Downloads
Download data is not yet available.
Article Details
Section
Articles
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.