Path Planning and Trajectory Planning Algorithms: A General Overview

Abstract

Path planning and trajectory planning are crucial issues in the field of Robotics and, more generally, in the field of Automation. Indeed, the trend for robots and automatic machines is to operate at increasingly high speed, in order to achieve shorter production times. The high operating speed may hinder the accuracy and repeatability of the robot motion, since extreme performances are required from the actuators and the control system. \ud Therefore, particular care should be put in generating a trajectory that could be executed at high speed, but at the same time harmless for the robot, in terms of avoiding excessive accelerations of the actuators and vibrations of the mechanical structure. Such a trajectory is defined as smooth.\ud For such reasons, path planning and trajectory planning algorithms assume an increasing significance in robotics. Path planning algorithms generate a geometric path, from an initial to a final point, passing through pre-defined via-points, either in the joint space or in the operating space of the robot, while trajectory planning algorithms take a given geometric path and endow it with the time information. Trajectory planning algorithms are crucial in Robotics, because defining the times of passage at the via-points influences not only the kinematic properties of the motion, but also the dynamic ones. Namely, the inertial forces (and torques), to which the robot is subjected, depend on the accelerations along the trajectory, while the vibrations of its mechanical structure are basically determined by the values of the jerk (i.e. the derivative of the acceleration).\ud Path planning algorithms are usually divided according to the methodologies used to generate the geometric path, namely:\ud - roadmap techniques\ud - cell decomposition algorithms\ud - artificial potential methods.The algorithms for trajectory planning are usually named by the function that is optimized, namely:\ud - minimum time\ud - minimum energy\ud - minimum jerk.\ud Examples of hybrid algorithms, which optimize more than a single function, are also found in the scientific literature.\ud In this Chapter, the general problem of path planning and trajectory planning will be addressed, and an extended overview of the algorithms belonging to the categories mentioned above will be carried out, with references to the numerous contributions to this field

A Review on Energy-Saving Optimization Methods for Robotic and Automatic Systems

“…The optimization of movements can be used to reduce terms such as time, vibration content and energy consumption of mechatronic and robotic systems [93]. The path and the motion profiles are modified in order to be more energy efficient.…”

A Probabilistic Steering Parameter Model for Deterministic Motion Planning Algorithms

“…In general, previous work in this area can be divided into approaches using cell decomposition techniques (e.g. [HNR68, NKT10]) and potential fields [GBLV15]. Furthermore, velocity obstacle methods (see [FS98, VDBSGM11]) have recently received significant attention for local motion planning.…”

Liveness-Based RRT Algorithm for Autonomous Underwater Vehicles Motion Planning

“…In most application cases, it mainly involves the structured mobility to drive the robots to the final destination given any initial states [1]. In general, the motion planning algorithms can be generally categorized into two types [2]. The first ones return the positions along the path from start to the goal, which are called path planning algorithms.…”