1
M.Sc. of Control Engineering, Department of Electrical, Biomedical and Mechatronics Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran,
2
Assistant Professor, Department of Electrical, Biomedical and Mechatronics Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran, Corresponding Author
Abstract
This paper presents a parameterization method to optimal trajectory planning and dynamic obstacle avoidance for Omni-directional robots. The aim of trajectory planning is minimizing a quadratic cost function while a maximum limitation on velocity and acceleration of robot is considered. First, we parameterize the trajectory using polynomial functions with unknown coefficients which transforms trajectory planning to an optimization problem. Then we use a novel method to solving the optimization problem and obtaining the unknown parameters. Finally, the efficiency of proposed approach is confirmed by simulation.
Tohfeh,F. and Fakharian,A. (2012). Polynomial Optimal Trajectory Planning and Obstacle Aviodance for Omni-directional Mobile Robots in Dynamic Environments. The Modares Journal of Electrical Engineering, 12(3), 13-19.
MLA
Tohfeh,F. , and Fakharian,A. . "Polynomial Optimal Trajectory Planning and Obstacle Aviodance for Omni-directional Mobile Robots in Dynamic Environments", The Modares Journal of Electrical Engineering, 12, 3, 2012, 13-19.
HARVARD
Tohfeh,F.,Fakharian,A. (2012). 'Polynomial Optimal Trajectory Planning and Obstacle Aviodance for Omni-directional Mobile Robots in Dynamic Environments', The Modares Journal of Electrical Engineering, 12(3), pp. 13-19.
CHICAGO
F. Tohfeh and A. Fakharian, "Polynomial Optimal Trajectory Planning and Obstacle Aviodance for Omni-directional Mobile Robots in Dynamic Environments," The Modares Journal of Electrical Engineering, 12 3 (2012): 13-19,
VANCOUVER
Tohfeh,F.,Fakharian,A. Polynomial Optimal Trajectory Planning and Obstacle Aviodance for Omni-directional Mobile Robots in Dynamic Environments. The Modares Journal of Electrical Engineering, 2012; 12(3): 13-19.