Swarm robotics and rapidly exploring random graph algorithms applied to environment exploration and path planning

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We propose an efficient scheme based on a swarm robotics approach for exploring unknown environments. The initial goal is to trace a map which is later used to find optimal paths. The algorithm minimizes distance and danger. The proposed scheme consists in three phases: exploration, mapping and path optimization. A cellular automata approach is used for the simulation of the fist two phases. For the exploration phase, a stigmergy approach is applied in order to allow for swarm communication in a implicit way. For the path planning phase a hybrid method is proposed. First an adapted Rapidlyexploring Random Graph algorithm is used and then a scalarized multiobjective technique is applied to find the shortest path.

Cite

CITATION STYLE

APA

Calderón-Arce, C., & Solis-Ortega, R. (2019). Swarm robotics and rapidly exploring random graph algorithms applied to environment exploration and path planning. International Journal of Advanced Computer Science and Applications, 10(5), 692–702. https://doi.org/10.14569/ijacsa.2019.0100586

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free