Intelligent Robotics Navigation System: Problems, Methods, and Algorithm

This paper set out to supplement new studies with a brief and comprehensible review of the advanced development in the area of the navigation system, starting from a single robot, multi-robot, and swarm robots from a particular perspective by taking insights from these biological systems. The inspiration is taken from nature by observing the human and the social animal that is believed to be very beneficial for this purpose. The intelligent navigation system is developed based on an individual characteristic or a social animal biological structure. The discussion of this paper will focus on how simple agent’s structure utilizes flexible and potential outcomes in order to navigate in a productive and unorganized surrounding. The combination of the navigation system and biologically inspired approach has attracted considerable attention, which makes it an important research area in the intelligent robotic system. Overall, this paper explores the implementation, which is resulted from the simulation performed by the embodiment of robots operating in real environments

A face - off - classical and heuristic - based path planning approaches

Robot path planning is a computational problem to find a valid sequence of configurations to move a robot from an initial to a final destination. Several classical and heuristic-based methods exist that can be used to solve the problem. This paper compares the performance of a classical method based on potential field, Lyapunov-based Control Scheme, with those of the standard and stepping ahead Firefly Algorithms. The performance comparison is based on the optimal path distance and time. The results show that the stepping ahead Firefly algorithm finds a shorter path in lesser duration when compared with the Lyapunov-based method. The LbCS also inherently faces the local minima problem when the start, target, and obstacle’s center coordinates are collinear. This problem is solved using the firefly algorithm where the diversification of the fireflies helps escape local minima

Self-adaptive decision-making mechanisms to balance the execution of multiple tasks for a multi-robots team

This work addresses the coordination problem of multiple robots with the goal of finding specific hazardous targets in an unknown area and dealing with them cooperatively. The desired behaviour for the robotic system entails multiple requirements, which may also be conflicting. The paper presents the problem as a constrained bi-objective optimization problem in which mobile robots must perform two specific tasks of exploration and at same time cooperation and coordination for disarming the hazardous targets. These objectives are opposed goals, in which one may be favored, but only at the expense of the other. Therefore, a good trade-off must be found. For this purpose, a nature-inspired approach and an analytical mathematical model to solve this problem considering a single equivalent weighted objective function are presented. The results of proposed coordination model, simulated in a two dimensional terrain, are showed in order to assess the behaviour of the proposed solution to tackle this problem. We have analyzed the performance of the approach and the influence of the weights of the objective function under different conditions: static and dynamic. In this latter situation, the robots may fail under the stringent limited budget of energy or for hazardous events. The paper concludes with a critical discussion of the experimental results

Intelligent Navigational Strategies For Multiple Wheeled Mobile Robots Using Artificial Hybrid Methodologies

At present time, the application of mobile robot is commonly seen in every fields of science and engineering. The application is not only limited to industries but also in thehousehold, medical, defense, transportation, space and much more. They can perform all kind of tasks which human being cannot do efficiently and accurately such as working in hazardous and highly risk condition, space research etc. Hence, the autonomous navigation of mobile robot is the highly discussed topic of today in an uncertain environment. The present work concentrates on the implementation of the Artificial Intelligence approaches for the mobile robot navigation in an uncertain environment. The obstacle avoidance and optimal path planning is the key issue in autonomous navigation, which is solved in the present work by using artificial intelligent approaches. The methods use for the navigational accuracy and efficiency are Firefly Algorithm (FA), Probability- Fuzzy Logic (PFL), Matrix based Genetic Algorithm (MGA) and Hybrid controller (FAPFL,FA-MGA, FA-PFL-MGA).The proposed work provides an effective navigation of single and multiple mobile robots in both static and dynamic environment. The simulational analysis is carried over the Matlab software and then it is implemented on amobile robot for real-time navigation analysis. During the analysis of the proposed controller, it has been noticed that the Firefly Algorithm performs well as compared to fuzzy and genetic algorithm controller. It also plays an important role inbuilding the successful Hybrid approaches such as FA-PFL, FA-MGA, FA-PFL-MGA. The proposed hybrid methodology perform well over the individual controller especially for pathoptimality and navigational time. The developed controller also proves to be efficient when they are compared with other navigational controller such as Neural Network, Ant Colony Algorithm, Particle Swarm Optimization, Neuro-Fuzzy etc

Comparison of bio-inspired algorithms applied to the coordination of mobile robots considering the energy consumption

Many applications, related to autonomous mobile robots, require to explore in an unknown environment searching for static targets, without any a priori information about the environment topology and target locations. Targets in such rescue missions can be fire, mines, human victims, or dangerous material that the robots have to handle. In these scenarios, some cooperation among the robots is required for accomplishing the mission. This paper focuses on the application of different bio-inspired metaheuristics for the coordination of a swarm of mobile robots that have to explore an unknown area in order to rescue and handle cooperatively some distributed targets. This problem is formulated by first defining an optimization model and then considering two sub-problems: exploration and recruiting. Firstly, the environment is incrementally explored by robots using a modified version of ant colony optimization. Then, when a robot detects a target, a recruiting mechanism is carried out to recruit a certain number of robots to deal with the found target together. For this latter purpose, we have proposed and compared three approaches based on three different bio-inspired algorithms (Firefly Algorithm, Particle Swarm Optimization, and Artificial Bee Algorithm). A computational study and extensive simulations have been carried out to assess the behavior of the proposed approaches and to analyze their performance in terms of total energy consumed by the robots to complete the mission. Simulation results indicate that the firefly-based strategy usually provides superior performance and can reduce the wastage of energy, especially in complex scenarios

A novel improved elephant herding optimization for path planning of a mobile robot

Swarm intelligence algorithms have been in recent years one of the most used tools for planning the trajectory of a mobile robot. Researchers are applying those algorithms to find the optimal path, which reduces the time required to perform a task by the mobile robot. In this paper, we propose a new method based on the grey wolf optimizer algorithm (GWO) and the improved elephant herding optimization algorithm (IEHO) for planning the optimal trajectory of a mobile robot. The proposed solution consists of developing an IEHO algorithm by improving the basic EHO algorithm and then hybridizing it with the GWO algorithm to take advantage of the exploration and exploitation capabilities of both algorithms. The comparison of the IEHO-GWO hybrid proposed in this work with the GWO, EHO, and cuckoo-search (CS) algorithms via simulation shows its effectiveness in finding an optimal trajectory by avoiding obstacles around the mobile robot

Comparison of bio-inspired algorithms applied to the coordination of mobile robots considering the energy consumption

Many applications, related to autonomous mobile robots, require to explore in an unknown environment searching for static targets, without any a priori information about the environment topology and target locations. Targets in such rescue missions can be fire, mines, human victims, or dangerous material that the robots have to handle. In these scenarios, some cooperation among the robots is required for accomplishing the mission. This paper focuses on the application of different bio-inspired metaheuristics for the coordination of a swarm of mobile robots that have to explore an unknown area in order to rescue and handle cooperatively some distributed targets. This problem is formulated by first defining an optimization model and then considering two sub-problems: exploration and recruiting. Firstly, the environment is incrementally explored by robots using a modified version of ant colony optimization. Then, when a robot detects a target, a recruiting mechanism is carried out to recruit a certain number of robots to deal with the found target together. For this latter purpose, we have proposed and compared three approaches based on three different bio-inspired algorithms (Firefly Algorithm, Particle Swarm Optimization, and Artificial Bee Algorithm). A computational study and extensive simulations have been carried out to assess the behavior of the proposed approaches and to analyze their performance in terms of total energy consumed by the robots to complete the mission. Simulation results indicate that the firefly-based strategy usually provides superior performance and can reduce the wastage of energy, especially in complex scenarios