Time-Distance Optimal Trajectory Planning For Mobile Robots On Straight And Circular Paths
محورهای موضوعی : B. Computer Systems OrganizationHossein Barghi Jond 1 , Adel Akbarimajd 2 , Nurhan Gursel Ozmen 3
1 - Young Researchers and Elite Club, Ahar Branch, Islamic Azad University, Ahar, Iran
2 - Department of Electrical and Computer Engineering, University of Mohaghegh Ardabili, Ardabil, Iran
3 - Department of Mechanical Engineering, Karadeniz Technical University, Trabzon, Turkey
کلید واژه: Mobile Robots, Trajectory Planning, constrained optimization, Acceleration limits,
چکیده مقاله :
Trajectories generally used to describe the space and time required to perform a desired motion task for a mobile robot or manipulator system. In this paper, we considered a cubic polynomial trajectory for the problem of moving a mobile robot from its initial position to a goal position in over a continuous set of time. Along the path, the robot requires to observe a certain acceleration profile. Then, we formulated an optimization approach to generate optimal trajectory profiles for the mobile robot in the cases of maximum-distance and minimum-time problems. The optimization problem presented to find the trajectory strategy that would give the robot time-distance optimality to move from a start point to an end point where the robot should stay inside its acceleration limits all the time. The problem solved analytically because as it is well known, numerical solutions and iterative methods are time-consuming, therefore, our closed-form solutions demand low computation time. Finally, the results are verified by simulations.
