Robot Path-Planning Research Applications in Static and Dynamic Environments

Abstract

The purpose of path planning is primarily to find a set of continuous motions for moving robots from an initial point and ending at the goal point in Cartesian or configuration space. Solving the robot arm path-planning problem can be considered as one of the most significant aspects of robot navigation to guarantee the best path free of obstacle collisions before tracking. The complexity of the robot environment is one of the most important characteristics of robots, especially in environments that contain static and/or dynamic obstacles such as robots, human operators, and other moving objects. The problem of path planning is subjected to the constraints of finding the possible path. The constructed path satisfies specific optimization criteria if the environment is known or has a property of intelligence if the environment is unknown. Many recent path-planning approaches have optimization and intelligent properties when the robot environment is partially unknown. In addition to intelligent methods that are used for planning a successful path, recent advances in path-planning methodologies involve using both heuristic and metaheuristic with artificial intelligence concepts with relevance across various field types with great application in calculated optimization of sustainability and resource use.