Minimum-Time Trajectory Planning for a Differential Drive Mobile Robot Considering Non-slipping Constraints

被引:0
作者
I. F. Okuyama
Marcos R. O. A. Maximo
Rubens J. M. Afonso
机构
[1] Aeronautics Institute of Technology,Autonomous Computational Systems Lab (LAB
[2] Technical University of Munich,SCA), Computer Science Division
[3] Aeronautics Institute of Technology,Department of Aerospace and Geodesy, Institute of Flight System Dynamics
来源
Journal of Control, Automation and Electrical Systems | 2021年 / 32卷
关键词
Trajectory planning; Optimization; Differential-drive mobile robot; Robotics;
D O I
暂无
中图分类号
学科分类号
摘要
We propose a real-time minimum-time trajectory planning strategy with obstacle avoidance for a differential-drive mobile robot in the context of robot soccer. The method considers constraints important to maximize the system’s performance, such as the actuator limits and non-slipping conditions. We also present a novel friction model that regards the imbalance of normal forces on the wheels due to the acceleration of the robot. Theoretical guarantees on how to obtain a minimum-time velocity profile on a predetermined parametrized curve considering the modeled constraints are also presented. Then, we introduce a nonlinear, non-convex, local optimization using a version of the Resilient Propagation algorithm that minimizes the time of the curve while avoiding obstacles and respecting system constraints. Finally, employing a new proposed benchmark, we verified that the presented strategy allows the robot to traverse a cluttered field (with dimensions of 1.5 m ×\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times $$\end{document} 1.3 m) in 2.8 s in 95% of the cases, while the optimization success rate was 85%. We also demonstrated the possibility of running the optimization in real-time, since it takes less than 13.8 ms in 95% of the cases.
引用
收藏
页码:120 / 131
页数:11
相关论文
共 39 条
[1]  
Byrd RH(2010)Infeasibility detection and SQP methods for nonlinear optimization SIAM Journal on Optimization 20 2281-2299
[2]  
Curtis FE(1957)On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents American Journal of Mathematics 79 497-516
[3]  
Nocedal J(2007)A random-profile approach for trajectory planning of wheeled mobile robots European Journal of Mechanics-A/Solids 26 519-540
[4]  
Dubins LE(1968)A formal basis for the heuristic determination of minimum cost paths IEEE Transactions on Systems Science and Cybernetics 4 100-107
[5]  
Haddad M(2001)Evolutionary programming-based univector field navigation method for past mobile robots IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 31 450-458
[6]  
Chettibi T(2001)Randomized kinodynamic planning The International Journal of Robotics Research 20 378-400
[7]  
Hanchi S(2003)Time optimal path planning considering acceleration limits Robotics and Autonomous Systems 45 199-210
[8]  
Lehtihet H(2008)Evolutionary univector field-based navigation with collision avoidance for mobile robot IFAC Proceedings Volumes 41 12787-12792
[9]  
Hart PE(1979)An algorithm for planning collision-free paths among polyhedral obstacles Communications of the ACM 22 560-570
[10]  
Nilsson NJ(2018)Time optimal trajectories for a mobile robot under explicit acceleration constraints IEEE Transactions on Aerospace and Electronic Systems 54 2220-2232