This paper proposes the distance- and velocity-based simultaneous obstacle avoidance and target tracking (DV-SOATT) method for the trajectory tracking problem of multiple wheeled mobile robots (MWMRs) operating in a shared workspace based on the relative positions and velocities of the wheeled mobile robots (WMRs) and their encountered obstacles. Compared to the previous arts considered only their relative positions, the DV-SOATT method that adds an auxiliary velocity vector lessens needless activation of the collision avoidance maneuvers, where the DV-SOATT introduces radial bounds for forecasting a collision. We provide two decision criteria for the addition of the auxiliary velocity term and compare the DV-SOATT method with the original method proposed by Li et al. (2021). The problem of the WMRs pause from the path conflict is addressed. Bound constraints on MWMRs’ velocities are considered to restrict the movement speed of the robot so as to ensure smoothness. The control law is built on Lagrange multipliers on basis of constructing a quadratic programming problem. Slack variables are discarded. Bound constraints on optimization variables are included in the piecewise-linear projection function. The stability of the control law, together with the efficiency of the DV-SOATT method, is discussed based on the Lyapunov function. The efficiency is tested on multiple omnidirectional Mecanum-wheeled mobile robots and validated through physical experiments and simulation.
Distance- and Velocity-Based Simultaneous Obstacle Avoidance and Target Tracking for Multiple Wheeled Mobile Robots
IEEE Transactions on Intelligent Transportation Systems ; 25 , 2 ; 1736-1748
2024-02-01
6449075 byte
Article (Journal)
Electronic Resource
English
Vision-Based Obstacle Avoidance of Wheeled Robots Using Fast Estimation
British Library Conference Proceedings | 2008
|ENGINEERING NOTES - Vision-Based Obstacle Avoidance of Wheeled Robots Using Fast Estimation
Online Contents | 2009
|Mobile Robots with Dynamic Obstacle Avoidance
IEEE | 2023
|