Real-time path planning optimisation algorithm for obstacle avoidance

This paper presents a new real-time path planning algorithm suitable for implementation on small mobile robots to aid navigation in unknown environments. The Random Obstacle Avoidance (R.O.A) algorithm was developed for small robots and it can be used as the basis for mapping the environment. The algorithm has been tested through a specially developed simulation environment using MATLAB. The main characteristics of the algorithm are simplicity, ease of implementation, speed, and efficiency

Intelligent Control and Path Planning of Multiple Mobile Robots Using Hybrid Ai Techniques

This work reports the problem of intelligent control and path planning of multiple mobile robots. Soft computing methods, based on three main approaches i.e. 1) Bacterial Foraging Optimization Algorithm, 2) Radial Basis Function Network and 3) Bees Algorithm are presented. Initially, Bacterial foraging Optimization Algorithm (BFOA) with constant step size is analyzed for the navigation of mobile robots. Then the step size has been made adaptive to develop an Adaptive Bacterial Foraging Optimization (ABFO) controller. Further, another controller using radial basis function neural network has been developed for the mobile robot navigation. Number of training patterns are intended to train the RBFN controller for different conditions arises during the navigation. Moreover, Bees Algorithm has been used for the path planning of the mobile robots in unknown environments. A new fitness function has been used to perform the essential navigational tasks effectively and efficiently. In addition to the selected standalone approaches, hybrid models are also proposed to improve the ability of independent navigation. Five hybrid models have been presented and analyzed for navigation of one, two and four mobile robots in various scenarios. Comparisons have been made for the distance travelled and time taken by the robots in simulation and real time. Further, all the proposed approaches are found capable of solving the basic issues of path planning for mobile robots while doing navigation. The controllers have been designed, developed and analyzed for various situations analogous to possible applications of the robots in indoor environments. Computer simulations are presented for all cases with single and multiple mobile robots in different environments to show the effectiveness of the proposed controllers. Furthermore, various exercises have been performed, analyzed and compared in physical environments to exhibit the effectiveness of the developed controllers

Analysis and Development of Computational Intelligence based Navigational Controllers for Multiple Mobile Robots

Navigational path planning problems of the mobile robots have received considerable attention over the past few decades. The navigation problem of mobile robots are consisting of following three aspects i.e. locomotion, path planning and map building. Based on these three aspects path planning algorithm for a mobile robot is formulated, which is capable of finding an optimal collision free path from the start point to the target point in a given environment. The main objective of the dissertation is to investigate the advanced methodologies for both single and multiple mobile robots navigation in highly cluttered environments using computational intelligence approach. Firstly, three different standalone computational intelligence approaches based on the Adaptive Neuro-Fuzzy Inference System (ANFIS), Cuckoo Search (CS) algorithm and Invasive Weed Optimization (IWO) are presented to address the problem of path planning in unknown environments. Next two different hybrid approaches are developed using CS-ANFIS and IWO-ANFIS to solve the mobile robot navigation problems. The performance of each intelligent navigational controller is demonstrated through simulation results using MATLAB. Experimental results are conducted in the laboratory, using real mobile robots to validate the versatility and effectiveness of the proposed navigation techniques. Comparison studies show, that there are good agreement between them. During the analysis of results, it is noticed that CS-ANFIS and IWO-ANFIS hybrid navigational controllers perform better compared to other discussed navigational controllers. The results obtained from the proposed navigation techniques are validated by comparison with the results from other intelligent techniques such as Fuzzy logic, Neural Network, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and other hybrid algorithms. By investigating the results, finally it is concluded that the proposed navigational methodologies are efficient and robust in the sense, that they can be effectively implemented to solve the path optimization problems of mobile robot in any complex environment

A novel optimistic local path planner : agoraphilic navigation algorithm in dynamic environment

This paper presents a novel local path planning algorithm developed based on the new free space attraction (Agoraphilic) concept. The proposed algorithm is capable of navigating robots in unknown static, as well as dynamically cluttered environments. Unlike the other navigation algorithms, the proposed algorithm takes the optimistic approach of the navigation problem. It does not look for problems to avoid, but rather for solutions to follow. This human-like decision-making behaviour distinguishes the new algorithm from all the other navigation algorithms. Furthermore, the new algorithm utilises newly developed tracking and prediction algorithms, to safely navigate mobile robots. This is further supported by a fuzzy logic controller designed to efficiently account for the inherent high uncertainties in the robot’s operational environment at a reduced computational cost. This paper also includes physical experimental results combined with bench-marking against other recent methods. The reported results verify the algorithm’s successful advantages in navigating robots in both static and dynamic environments. © 2022 by the authors

Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site

Simultaneous Localization and Mapping (SLAM) is often associated with the problems of building a map of an unknown environment using a mobile robot while having the ability to keep track of the mobile robot within the map. Path planning is described as the ability of the mobile robot to navigate without collision within the generated map from the starting point to the goal point using the shortest path and this enables autonomous navigation robots to perform many useful tasks. However, a lot of studies have been conducted to investigate effective and efficient algorithms to be used for generating accurate map from an environment and navigate in the environment effectively. This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation)

Symbiotic Navigation in Multi-Robot Systems with Remote Obstacle Knowledge Sharing

Large scale operational areas often require multiple service robots for coverage and task parallelism. In such scenarios, each robot keeps its individual map of the environment and serves specific areas of the map at different times. We propose a knowledge sharing mechanism for multiple robots in which one robot can inform other robots about the changes in map, like path blockage, or new static obstacles, encountered at specific areas of the map. This symbiotic information sharing allows the robots to update remote areas of the map without having to explicitly navigate those areas, and plan efficient paths. A node representation of paths is presented for seamless sharing of blocked path information. The transience of obstacles is modeled to track obstacles which might have been removed. A lazy information update scheme is presented in which only relevant information affecting the current task is updated for efficiency. The advantages of the proposed method for path planning are discussed against traditional method with experimental results in both simulation and real environments