InPTC: Integrated Planning and Tube-Following Control for Prescribed-Time Collision-Free Navigation of Wheeled Mobile Robots
In this article, we propose a novel approach, called integrated planning and tube-following Control (InPTC), for prescribed-time collision-free navigation of wheeled mobile robots in a compact convex workspace cluttered with static, sufficiently separated, and convex obstacles. A path planner with prescribed-time convergence is presented based upon Bouligand's tangent cones and time scale transformation (TST) techniques, yielding a continuous vector field that can guide the robot from almost all initial positions in the free space to the designated goal at a prescribed time, while avoiding entering the obstacle regions augmented with a safety margin. By leveraging barrier functions and TST, we further derive a tube-following controller to achieve robot trajectory tracking within a prescribed time less than the planner's settling time. This controller ensures the robot moves inside a predefined “safe tube” around the reference trajectory, where the tube radius is set to be less than the safety margin. Consequently, the robot will reach the goal location within a prescribed time while avoiding collision with any obstacles along the way. The proposed InPTC is implemented on a Mona robot operating in an arena cluttered with obstacles of various shapes. Experimental results demonstrate that InPTC not only generates smooth collision-free reference trajectories that converge to the goal location at the preassigned time of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$250\, \text{ s}$</tex-math></inline-formula> (i.e., the required task completion time), but also achieves tube-following trajectory tracking with tracking accuracy higher than <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$0.01 \text{ m}$</tex-math></inline-formula> after the preassigned time of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$150\, \text{ s}$</tex-math></inline-formula>. This enables the robot to accomplish the navigation task within the required time of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$250\, \text{ s}$</tex-math></inline-formula>.
Authors
- Bin Zhang (ORCID: https://orcid.org/0000-0001-6860-1951)
- Qinglei Hu (ORCID: https://orcid.org/0000-0002-5563-310X)
- David Navarro-Alarcón (ORCID: https://orcid.org/0000-0002-3426-6638)
- Hui Zhi (ORCID: https://orcid.org/0000-0002-0740-3270)
- Xiaodong Shao (ORCID: https://orcid.org/0000-0003-2640-5594)
- Bowen Fan
- Jose Guadalupe Romero (ORCID: https://orcid.org/0000-0001-7505-0182)
Institutions
- Hong Kong Polytechnic University (HK)
- Instituto Tecnológico Autónomo de México (MX)
- Beihang University (CN)
Publication Details
- Journal
- IEEE/ASME Transactions on Mechatronics
- Published
- 2024-11-13
- DOI
- https://doi.org/10.1109/tmech.2024.3486727
- Citations
- 1
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.25