Swarm Robotics and Rapidly Exploring Random Graph Algorithms Applied to Environment Exploration and Path Planning
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 5
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 Rapidly-exploring Random Graph algorithm is used and then a scalarized multiobjective technique is applied to find the shortest path.
Authors and Affiliations
Cindy Calder´on-Arce, Rebeca Solis-Ortega
Keywords
Related Articles
- EP ID EP579376
- DOI 10.14569/IJACSA.2019.0100586
- Views 102
- Downloads 0
Efficient Relay Selection Scheme based on Fuzzy Logic for Cooperative Communication
The performance of cooperative network can be increased by using relay selection technique. Therefore, interest in relay selection is sloping upward. We proposed two new relay selection schemes based on fuzzy logic for d...
Map Reduce: A Survey Paper on Recent Expansion
A rapid growth of data in recent time, Industries and academia required an intelligent data analysis tool that would be helpful to satisfy the need to analysis a huge amount of data. MapReduce framework is basically desi...
Performance Evaluation of Routing Protocol (RPL) for Internet of Things
Recently, Internet Engineering Task Force (IETF) standardized a powerful and flexible routing protocol for Low Power and Lossy Networks (RPL). RPL is a routing protocol for low power and lossy networks in the Internet of...
Clustering Analysis of Wireless Sensor Network Based on Network Coding with Low-Density Parity Check
The number of nodes in wireless sensor networks (WSNs) is one of the fundamental parameters when it comes to developing an algorithm based on Network Coding (NC) with LDPC (Low Density Parity Check) code because it direc...
TGRP: A New Hybrid Grid-based Routing Approach for Manets
Most existing grid-based routing protocols use reactive mechanisms to build routing paths. In this paper, we propose a new hybrid approach for grid-based routing in MANETs which uses a combination of reactive and proacti...