Polynomial Optimal Trajectory Planning and Obstacle Aviodance for Omni-directional Mobile Robots in Dynamic Environments

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.

کلیدواژه ها:

obstacle avoidance ، Omni-directional robot ، optimization problem ، polynomial trajectory ، Trajectory Planning ، دوری از موانع ، ربات چند جهته ، مسئله بهینه سازی ، مسیر زمان دار چند جمله ای ، برنامه ریزی مسیر زمان دار