Path-planning is a crucial part of robotics, helping robots move through challenging places all by themselves. In this paper, we introduce an innovative approach to robot path-planning, a crucial aspect of robotics. This technique combines the power of Genetic Algorithm (GA) and Probabilistic Roadmap (PRM) to enhance efficiency and reliability. Our method takes into account challenges caused by moving obstacles, making it skilled at navigating complex environments. Through merging GA’s exploration abilities with PRM’s global planning strengths, our GA-PRM algorithm improves computational efficiency and finds optimal paths. To validate our approach, we conducted rigorous evaluations against well-known algorithms including A*, RRT, Genetic Algorithm, and PRM in simulated environments. The results were remarkable, with our GA-PRM algorithm outperforming existing methods, achieving an average path length of 25.6235 units and an average computational time of 0.6881 seconds, demonstrating its speed and effectiveness. Additionally, the paths generated were notably smoother, with an average value of 0.3133. These findings highlight the potential of the GA-PRM algorithm in real-world applications, especially in crucial sectors like healthcare, where efficient path-planning is essential. This research contributes significantly to the field of path-planning and offers valuable insights for the future design of autonomous robotic systems.
Path planning is an essential concern in robotic systems, and it refers to the process of determining a safe and optimal path starting from the source state to the goal one within dynamic environments. We proposed an improved path planning method in this article, which merges the Dijkstra algorithm for path planning with Potential Field (PF) collision avoidance. In real-time, the method attempts to produce multiple paths as well as determine the suitable path that’s both short and reliable (safe). The Dijkstra method is employed to produce multiple paths, whereas the Potential Field is utilized to assess the safety of each route and choose the best one. The proposed method creates links between the routes, enabling the robot to swap between them if it discovers a dynamic obstacle on its current route. Relating to path length and safety, the simulation results illustrate that Dynamic Dijkstra-Potential Field (Dynamic D-PF) achieves better performance than the Dijkstra and Potential Field each separately, and going to make it a promising solution for the application of robotic automation within dynamic environments.
This paper presents the designing of path planning system in an environment contains a set of static polygon obstacles localized and distributed randomly by using differential drive mobile robot. In this paper the designed algorithm (two dimensional path planning algorithm) is proposed in order of investigate the path planning of mobile robot with free collision using the visibility binary tree algorithm. The suggested algorithm is compared with the virtual circles tangents algorithm in the time of arrival and the longest of the path to the target. The aim of this paper is to get an algorithm has better performance than the other algorithms and get less time of arrival and shortest path with free collision.
Obstacle avoidance in mobile robot path planning represents an exciting field of robotics systems. There are numerous algorithms available, each with its own set of features. In this paper a Witch of Agnesi curve algorithm is proposed to prevent a collision by the mobile robot’s orientation beyond the obstacles which represents an important problem in path planning, further, to achieve a minimum arrival time by following the shortest path which leads to minimizing power loss. The proposed approach considers the mobile robot’s platform equipped with the LIDAR 360o sensor to detect obstacle positions in any environment of the mobile robot. Obstacles detected in the sensing range of the mobile robot are dealt with by using the Witch of Agnesi curve algorithm, this establishes the obstacle’s apparent vertices’ virtual minimum bounding circle with minimum error. Several Scenarios are implemented and considered based on the identification of obstacles in the mobile robot environment. The proposed system has been simulated by the V-REP platform by designing several scenarios that emulate the behavior of the robot during the path planning model. The simulation and experimental results show the optimal performance of the mobile robot during navigation is obtained as compared to the other methods with minimum power loss and also with minimum error. It’s given 96.3 percent in terms of the average of the total path while the Bezier algorithm gave 94.67 percent. While in experimental results the proposed algorithm gave 93.45 and the Bezier algorithm gave 92.19 percent.
A robot is a smart machine that can help people in their daily lives and keep everyone safe. the three general sequences to accomplish any robot task is mapping the environment, the localization, and the navigation (path planning with obstacle avoidance). Since the goal of the robot is to reach its target without colliding, the most important and challenging task of the mobile robot is the navigation. In this paper, the robot navigation problem is solved by proposed two algorithms using low-cost IR receiver sensors arranged as an array, and a robot has been equipped with one IR transmitter. Firstly, the shortest orientation algorithm is proposed, the robot direction is corrected at each step of movement depending on the angle calculation. secondly, an Active orientation algorithm is presented to solve the weakness in the preceding algorithm. A chain of the active sensors in the environment within the sensing range of the virtual path is activated to be scan through the robot movement. In each algorithm, the initial position of the robot is detected using the modified binary search algorithm, various stages are used to avoid obstacles through suitable equations focusing on finding the shortest and the safer path of the robot. Simulation results with multi-resolution environment explained the efficiency of the algorithms, they are compatible with the designed environment, it provides safe movements (without hitting obstacles) and a good system control performance. A Comparison table is also provided.
This paper presents the design of a path planning system in an environment that contains a set of static and dynamic polygon obstacles localized randomly. In this paper, an algorithm so-called (Polygon shape tangents algorithm) is proposed to move a mobile robot from a source point to a destination point with no collision with surrounding obstacles using the visibility binary tree algorithm. The methodology of this algorithm is based on predicting the steps of a robot trajectory from the source to the destination point. The polygon shapes tangent algorithm is compared with the virtual circles' tangents algorithm for different numbers of static and dynamic polygon obstacles for the time of arrival and the length of the path to the target. The obtained result shows that the used algorithm has better performance than the other algorithms and gets less time of arrival and shortest path with free collision.
Although the Basic RRT algorithm is considered a traditional search method, it has been widely used in the field of robot path planning (manipulator and mobile robot), especially in the past decade. This algorithm has many features that give it superiority over other methods. On the other hand, the Basic RRT suffers from a bad convergence rate (it takes a long time until finding the goal point), especially in environments with cluttered obstacles, or whose targets are located in narrow passages. Many studies have discussed this problem in recent years. This paper introduces an improved method called (Hybrid RRT-A*) to overcome the shortcomings of the original RRT, specifically slow convergence and cost rate. The heuristic function of A-star algorithm is combined with RRT to decrease tree expansion and guide it towards the goal with less nodes and time. Various experiments have been conducted with different environment scenarios to compare the proposed method with the Basic RRT and A-star under the same conditions, which have shown remarkable performance. The time consumed to find the path of the worst one of these scenarios is about 4.9 seconds, whereas it is 18.3 and 34 for A-star and RRT, respectively.
Many assistive devices have been developed for visually impaired (VI) person in recent years which solve the problems that face VI person in his/her daily moving. Most of researches try to solve the obstacle avoidance or navigation problem, and others focus on assisting VI person to recognize the objects in his/her surrounding environment. However, a few of them integrate both navigation and recognition capabilities in their system. According to above needs, an assistive device is presented in this paper that achieves both capabilities to aid the VI person to (1) navigate safely from his/her current location (pose) to a desired destination in unknown environment, and (2) recognize his/her surrounding objects. The proposed system consists of the low cost sensors Neato XV-11 LiDAR, ultrasonic sensor, Raspberry pi camera (CameraPi), which are hold on a white cane. Hector SLAM based on 2D LiDAR is used to construct a 2D-map of unfamiliar environment. While A* path planning algorithm generates an optimal path on the given 2D hector map. Moreover, the temporary obstacles in front of VI person are detected by an ultrasonic sensor. The recognition system based on Convolution Neural Networks (CNN) technique is implemented in this work to predict object class besides enhance the navigation system. The interaction between the VI person and an assistive system is done by audio module (speech recognition and speech synthesis). The proposed system performance has been evaluated on various real-time experiments conducted in indoor scenarios, showing the efficiency of the proposed system.
In this paper, a new algorithm called the virtual circle tangents is introduced for mobile robot navigation in an environment with polygonal shape obstacles. The algorithm relies on representing the polygonal shape obstacles by virtual circles, and then all the possible trajectories from source to target is constructed by computing the visible tangents between the robot and the virtual circle obstacles. A new method for searching the shortest path from source to target is suggested. Two states of the simulation are suggested, the first one is the off-line state and the other is the on-line state. The introduced method is compared with two other algorithms to study its performance.
This paper deals with the navigation of a mobile robot in unknown environment using artificial potential field method. The aim of this paper is to develop a complete method that allows the mobile robot to reach its goal while avoiding unknown obstacles on its path. An approach proposed is introduced in this paper based on combing the artificial potential field method with fuzzy logic controller to solve drawbacks of artificial potential field method such as local minima problems, make an effective motion planner and improve the quality of the trajectory of mobile robot.
In coordination of a group of mobile robots in a real environment, the formation is an important task. Multi- mobile robot formations in global knowledge environments are achieved using small robots with small hardware capabilities. To perform formation, localization, orientation, path planning and obstacle and collision avoidance should be accomplished. Finally, several static and dynamic strategies for polygon shape formation are implemented. For these formations minimizing the energy spent by the robots or the time for achieving the task, have been investigated. These strategies have better efficiency in completing the formation, since they use the cluster matching algorithm instead of the triangulation algorithm.