5,951 research outputs found
A Systematic Literature Review of Path-Planning Strategies for Robot Navigation in Unknown Environment
The Many industries, including ports, space, surveillance, military, medicine and agriculture have benefited greatly from mobile robot technology. An autonomous mobile robot navigates in situations that are both static and dynamic. As a result, robotics experts have proposed a range of strategies. Perception, localization, path planning, and motion control are all required for mobile robot navigation. However, Path planning is a critical component of a quick and secure navigation. Over the previous few decades, many path-planning algorithms have been developed. Despite the fact that the majority of mobile robot applications take place in static environments, there is a scarcity of algorithms capable of guiding robots in dynamic contexts. This review compares qualitatively mobile robot path-planning systems capable of navigating robots in static and dynamic situations. Artificial potential fields, fuzzy logic, genetic algorithms, neural networks, particle swarm optimization, artificial bee colonies, bacterial foraging optimization, and ant-colony are all discussed in the paper. Each method's application domain, navigation technique and validation context are discussed and commonly utilized cutting-edge methods are analyzed. This research will help researchers choose appropriate path-planning approaches for various applications including robotic cranes at the sea ports as well as discover gaps for optimization
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
An enhanced classifier system for autonomous robot navigation in dynamic environments
In many cases, a real robot application requires the navigation in dynamic environments. The navigation problem involves two main tasks: to avoid obstacles and to reach a goal. Generally, this problem could be faced considering reactions and sequences of actions. For solving the navigation problem a complete controller, including actions and reactions, is needed. Machine learning techniques has been applied to learn these controllers. Classifier Systems (CS) have proven their ability of continuos learning in these domains. However, CS have some problems in reactive systems. In this paper, a modified CS is proposed to overcome these problems. Two special mechanisms are included in the developed CS to allow the learning of both reactions and sequences of actions. The learning process has been divided in two main tasks: first, the discrimination between a predefined set of rules and second, the discovery of new rules to obtain a successful operation in dynamic environments. Different experiments have been carried out using a mini-robot Khepera to find a generalised solution. The results show the ability of the system to continuous learning and adaptation to new situations.Publicad
Quadrotor Path Planning Based on Modified Fuzzy Cell Decomposition Algorithm
The purpose of this paper is to present an algorithm to determine the shortest path for quadrotor to be able to navigate in an unknown area. The problem in robot navigation is that a robot has incapability of finding the shortest path while moving to the goal position and avoiding obstacles. Hence, a modification of several algorithms are proposed to enable the robot to reach the goal position through the shortest path. The algorithms used are fuzzy logic and cell decomposition algorithms, in which the fuzzy algorithm which is an artificial intelligence algorithm is used for robot path planning and cell decomposition algorithm is used to create a map for the robot path, but the merger of these two algorithms is still incapable of finding the shortest distance. Therefore, this paper describes a modification of the both algorithms by adding potential field algorithm that is used to provide weight values on the map in order for the quadrotor to move to its goal position and find the shortest path. The modification of the algorithms have shown that quadrotor is able to avoid various obstacles and find the shortest path so that the time required to get to the goal position is more rapid
Online supervised global path planning for AMRs with human-obstacle avoidance
In smart factories, the performance of the production lines is improved thanks to the wide application of mobile robots. In workspaces where human operators and mobile robots coexist, safety is a fundamental factor to be considered. In this context, the motion planning of Autonomous Mobile Robots is a challenging task, since it must take into account the human factor. In this paper, an implementation of a three-level online path planning is proposed, in which a set of waypoints belonging to a safe path is computed by a supervisory planner. Depending on the nature of the detected obstacles during the robot motion, the re-computation of the safe path may be enabled, after the collision avoidance action provided by the local planner is initiated. Particular attention is devoted to the detection and avoidance of human operators. The supervisory planner is triggered as the detected human gets sufficiently close to the mobile robot, allowing it to follow a new safe virtual path while conservatively circumnavigating the operator. The proposed algorithm has been experimentally validated in a laboratory environment emulating industrial scenarios
Hybrid approaches for mobile robot navigation
The work described in this thesis contributes to the efficient solution of mobile robot navigation problems. A series of new evolutionary approaches is presented.
Two novel evolutionary planners have been developed that reduce the computational
overhead in generating plans of mobile robot movements. In comparison with the
best-performing evolutionary scheme reported in the literature, the first of the
planners significantly reduces the plan calculation time in static environments. The
second planner was able to generate avoidance strategies in response to unexpected events arising from the presence of moving obstacles. To overcome limitations in responsiveness and the unrealistic assumptions regarding a priori knowledge that are inherent in planner-based and a vigation systems, subsequent work concentrated on hybrid approaches. These included a reactive component to identify rapidly and autonomously environmental features that were represented by a small number of critical waypoints. Not only is memory usage dramatically reduced by such a simplified representation, but also the calculation time to determine new plans is significantly reduced. Further significant enhancements of this work were firstly, dynamic avoidance to limit the likelihood of potential collisions with moving obstacles and secondly, exploration to identify statistically the dynamic
characteristics of the environment. Finally, by retaining more extensive environmental knowledge gained during previous navigation activities, the capability of the hybrid navigation system was enhanced to allow planning to be performed for any start point and goal point
An Approach to Improve Multi objective Path Planning for Mobile Robot Navigation using the Novel Quadrant Selection Method
Currently, automated and semi-automated industries need multiple objective path planning algorithms for mobile robot applications. The multi-objective optimisation algorithm takes more computational effort to provide optimal solutions. The proposed grid-based multi-objective global path planning algorithm [Quadrant selection algorithm (QSA)] plans the path by considering the direction of movements from starting position to the target position with minimum computational effort. Primarily, in this algorithm, the direction of movements is classified into quadrants. Based on the selection of the quadrant, the optimal paths are identified. In obstacle avoidance, the generated feasible paths are evaluated by the cumulative path distance travelled, and the cumulative angle turned to attain an optimal path. Finally, to ease the robot’s navigation, the obtained optimal path is further smoothed to avoid sharp turns and reduce the distance. The proposed QSA in total reduces the unnecessary search for paths in other quadrants. The developed algorithm is tested in different environments and compared with the existing algorithms based on the number of cells examined to obtain the optimal path. Unlike other algorithms, the proposed QSA provides an optimal path by dramatically reducing the number of cells examined. The experimental verification of the proposed QSA shows that the solution is practically implementable
- …