Table of Contents
Fetching ...

Time-Varying Formation Tracking Control of Wheeled Mobile Robots With Region Constraint: A Generalized Udwadia-Kalaba Framework

Kang Yijie, Hao Yuqing, Wang Qingyun, Chen Guanrong

TL;DR

This work develops a generalized Udwadia-Kalaba framework to achieve time-varying formation tracking for networks of wheeled mobile robots with region constraints under directed, weighted connectivity having a leader-root spanning tree. By reformulating the tracking objective as an equality constraint and employing a diffeomorphism to handle region bounds, the authors derive both equality and inequality constraint forces, enabling safe, coordinated motion. Key contributions include extending formation tracking to dynamic, underactuated wheel models, integrating region safety via GUK, and providing stability conditions tied to graph eigenstructure. Numerical simulations demonstrate effective tracking and region safety, illustrating practical applicability in constrained environments. The approach offers a principled method to guarantee safety while maintaining cooperative formation in realistic multi-robot scenarios.

Abstract

In this paper, the time-varying formation tracking control of wheeled mobile robots with region constraint is investigated from a generalized Udwadia-Kalaba framework. The communication topology is directed, weighted and has a spanning tree with the leader being the root. By reformulating the time-varying formation tracking control objective as a constrained equation and transforming the region constraint by a diffeomorphism, the time-varying formation tracking controller with the region constraint is designed under the generalized Udwadia-Kalaba framework. Compared with the existing works on time-varying formation tracking control, the region constraint is takeninto account in this paper, which ensures the safety of the robots.Finally, some numerical simulations are presented to illustrate the effectiveness of the proposed control strategy.

Time-Varying Formation Tracking Control of Wheeled Mobile Robots With Region Constraint: A Generalized Udwadia-Kalaba Framework

TL;DR

This work develops a generalized Udwadia-Kalaba framework to achieve time-varying formation tracking for networks of wheeled mobile robots with region constraints under directed, weighted connectivity having a leader-root spanning tree. By reformulating the tracking objective as an equality constraint and employing a diffeomorphism to handle region bounds, the authors derive both equality and inequality constraint forces, enabling safe, coordinated motion. Key contributions include extending formation tracking to dynamic, underactuated wheel models, integrating region safety via GUK, and providing stability conditions tied to graph eigenstructure. Numerical simulations demonstrate effective tracking and region safety, illustrating practical applicability in constrained environments. The approach offers a principled method to guarantee safety while maintaining cooperative formation in realistic multi-robot scenarios.

Abstract

In this paper, the time-varying formation tracking control of wheeled mobile robots with region constraint is investigated from a generalized Udwadia-Kalaba framework. The communication topology is directed, weighted and has a spanning tree with the leader being the root. By reformulating the time-varying formation tracking control objective as a constrained equation and transforming the region constraint by a diffeomorphism, the time-varying formation tracking controller with the region constraint is designed under the generalized Udwadia-Kalaba framework. Compared with the existing works on time-varying formation tracking control, the region constraint is takeninto account in this paper, which ensures the safety of the robots.Finally, some numerical simulations are presented to illustrate the effectiveness of the proposed control strategy.

Paper Structure

This paper contains 15 sections, 4 theorems, 56 equations, 9 figures, 2 tables.

Key Result

Lemma 1

ren2008distributed$Rank(\mathcal{L})=n-1$ if and only if graph $\mathcal{G}$ has a spanning tree.

Figures (9)

  • Figure 1: Model of four-wheeled mobile robot.
  • Figure 2: Network topology $\bar{\mathcal{G}}$.
  • Figure 3: Trajectories of the wheeled mobile robots.
  • Figure 4: Formation control errors of the wheeled mobile robots.
  • Figure 5: Input driving torques $U_i^{c,e}$.
  • ...and 4 more figures

Theorems & Definitions (13)

  • Lemma 1
  • Remark 1
  • Remark 2
  • Remark 3
  • Remark 4
  • Theorem 1
  • proof
  • Remark 5
  • Theorem 2
  • proof
  • ...and 3 more