Path Tracking with Obstacle Avoidance for Pseudo-Omnidirectional Mobile Robots Using Convex Optimization
We consider the problem of trajectory generation for time-optimal path tracking for the class of pseudo-omnidirectional mobile robots. An Euler-Lagrange model of the robot dynamics is derived, and by writing it on special form a convex reformulation of the path-tracking problem can be utilized. This enables the use and regeneration of time-optimal trajectories during runtime. The proposed approach
