2,933 research outputs found
Motion Planning for Autonomous Ground Vehicles Using Artificial Potential Fields: A Review
Autonomous ground vehicle systems have found extensive potential and
practical applications in the modern world. The development of an autonomous
ground vehicle poses a significant challenge, particularly in identifying the
best path plan, based on defined performance metrics such as safety margin,
shortest time, and energy consumption. Various techniques for motion planning
have been proposed by researchers, one of which is the use of artificial
potential fields. Several authors in the past two decades have proposed various
modified versions of the artificial potential field algorithms. The variations
of the traditional APF approach have given an answer to prior shortcomings.
This gives potential rise to a strategic survey on the improved versions of
this algorithm. This study presents a review of motion planning for autonomous
ground vehicles using artificial potential fields. Each article is evaluated
based on criteria that involve the environment type, which may be either static
or dynamic, the evaluation scenario, which may be real-time or simulated, and
the method used for improving the search performance of the algorithm. All the
customized designs of planning models are analyzed and evaluated. At the end,
the results of the review are discussed, and future works are proposed
Optimization of an Autonomous Mobile Robot Path Planning Based on Improved Genetic Algorithms
Mobile robots are intended to operate in a variety of environments, and they need to be able to navigate and travel around obstacles, such as objects and barriers. In order to guarantee that the robot will not come into contact with any obstacles or other objects during its movement, algorithms for path planning have been demonstrated. The basic goal while constructing a route is to find the fastest and smoothest route between the starting point and the destination. This article describes route planning using the improvised genetic algorithm with the Bezier Curve (GA-BZ). This study carried out two main experiments, each using a 20x20 random grid map model with varying percentages of obstacles (5%, 15%, and 30% in the first experiment, and 25% and 50% in the second). In the initial experiments, the population (PN), generation (GN), and mutation rate (MR) of genetic algorithms (GA) will be altered to the following values: (PN = 100, 125, 150, or 200; GN = 100, 125, 150; and MR = 0.1, 0.3, 0.5, 0.7) respectively. The goal is to evaluate the effectiveness of AMR in terms of travel distance (m), total time (s), and total cost (RM) in comparison to traditional GA and GA-BZ. The second experiment examined robot performance utilising GA, GA-BZ, Simulated Annealing (SA), A-Star (A*), and Dijkstra's Algorithms (DA) for path distance (m), time travel (s), and fare trip (RM). The simulation results are analysed, compared, and explained. In conclusion, the project is summarised
Collision-free path planning for robots using B-splines and simulated annealing
This thesis describes a technique to obtain an optimal collision-free path for an automated guided vehicle (AGV) and/or robot in two and three dimensions by synthesizing a B-spline curve under geometric and intrinsic constraints. The problem is formulated as a combinatorial optimization problem and solved by using simulated annealing. A two-link planar manipulator is included to show that the B-spline curve can also be synthesized by adding kinematic characteristics of the robot. A cost function, which includes obstacle proximity, excessive arc length, uneven parametric distribution and, possibly, link proximity costs, is developed for the simulated annealing algorithm. Three possible cases for the orientation of the moving object are explored: (a) fixed orientation, (b) orientation as another independent variable, and (c) orientation given by the slope of the curve. To demonstrate the robustness of the technique, several examples are presented. Objects are modeled as ellipsoid type shapes. The procedure to obtain the describing parameters of the ellipsoid is also presented
A Real-time Global Optimal Path Planning for mobile robot in Dynamic Environment Based on Artificial Immune Approach
This paper illustrates a method to finding a globaloptimal path in a dynamic environment of known obstacles foran Mobile Robot (MR) to following a moving target. Firstly, theenvironment is defined by using a practical and standard graphtheory. Then, a suboptimal path is obtained by using DijkstraAlgorithm (DA) that is a standard graph searching method. Theadvantages of using DA are; elimination the uncertainness ofheuristic algorithms and increasing the speed, precision andperformance of them. Finally, Continuous Clonal SelectionAlgorithm (CCSA) that is combined with Negative SelectionAlgorithm (NSA) is used to improve the suboptimal path andderive global optimal path. To show the effectiveness of themethod it is compared with some other methods in this area
A review on robot motion planning approaches
The ability of a robot to plan its own motion seems pivotal to its autonomy, and that is why the motion planning has become part and parcel of modern intelligent robotics. In this paper, about 100 research are reviewed and briefly described to identify and classify the amount of the existing work for each motion planning approach. Meanwhile, around 200 research were used to determine the percentage of the application of each approach. The paper includes comparative tables and charts showing the application frequency of each approach in the last 30 years. Finally, some open areas and challenging topics are presented based on the reviewed papers
- …