Practical Bipartite Tracking for Networked Robotic Systems via Fixed-Time Estimator-Based Control

Complexity 2021:1-15 (2021)
  Copy   BIBTEX

Abstract

In this paper, the fixed-time practical bipartite tracking problem for the networked robotic systems with parametric uncertainties, input disturbances, and directed signed graphs is investigated. A new fixed-time estimator-based control algorithm for the NRSs is presented to address the abovementioned problem. By applying a sliding surface and the time base generator approach, a new stability analysis method is proposed to achieve the fixed-time practical bipartite tracking for the NRSs. We also derive the upper bound of the convergence time for employing the presented control algorithm to solve the practical bipartite tracking problem and further demonstrate that the convergence time is independent of the initial value. Finally, the simulation examples are given to verify the effectiveness of the presented algorithms.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2021-05-28

Downloads
11 (#1,113,583)

6 months
6 (#512,819)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Ge Ming
Freie Universität Berlin

Citations of this work

No citations found.

Add more citations