Synchronization and fault detection in autonomous robots

info:eu-repo/semantics/publishe

A generalized laser simulator algorithm for optimal path planning in constraints environment

Path planning plays a vital role in autonomous mobile robot navigation, and it has thus become one of the most studied areas in robotics. Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. This approach allows finding the path for a mobile robot while avoiding obstacles, searching for a goal, considering some constraints and finding an optimal path during the robot movement in both known and unknown environments. The feasible path is determined between the start and goal positions by generating a wave of points in all directions towards the goal point with adhering to constraints. A simulation study employing the proposed approach is applied to the grid map settings to determine a collision-free path from the start to goal positions. First, the grid mapping of the robot's workspace environment is constructed, and then the borders of the workspace environment are detected based on the new proposed function. This function guides the robot to move toward the desired goal. Two concepts have been implemented to find the best candidate point to move next: minimum distance to goal and maximum index distance to the boundary, integrated by negative probability to sort out the most preferred point for the robot trajectory determination. In order to construct an optimal collision-free path, an optimization step was included to find out the minimum distance within the candidate points that have been determined by GLS while adhering to particular constraint's rules and avoiding obstacles. The proposed algorithm will switch its working pattern based on the goal minimum and boundary maximum index distances. For static obstacle avoidance, the boundaries of the obstacle(s) are considered borders of the environment. However, the algorithm detects obstacles as a new border in dynamic obstacles once it occurs in front of the GLS waves. The proposed method has been tested in several test environments with different degrees of complexity. Twenty different arbitrary environments are categorized into four: Simple, complex, narrow, and maze, with five test environments in each. The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. The GLS is 7.8 and 5.5 times faster than A* and LS, respectively, generating a path 1.2 and 1.5 times shorter than A* and LS. The mean value of the path cost achieved by the proposed approach is 4% and 15% lower than PRM and RRT, respectively. The mean path cost generated by the LS algorithm, on the other hand, is 14% higher than that generated by the PRM. Finally, to verify the performance of the developed method for generating a collision-free path, experimental studies were carried out using an existing WMR platform in labs and roads. The experimental work investigates complete autonomous WMR path planning in the lab and road environments using live video streaming. The local maps were built using data from live video streaming s by real-time image processing to detect the segments of the lab and road environments. The image processing includes several operations to apply GLS on the prepared local map. The proposed algorithm generates the path within the prepared local map to find the path between start-to-goal positions to avoid obstacles and adhere to constraints. The experimental test shows that the proposed method can generate the shortest path and best smooth trajectory from start to goal points in comparison with the laser simulator

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