Output Multiformation Tracking of Networked Heterogeneous Robotic Systems via Finite-Time Hierarchical Control

This article investigates the finite-time output multiformation tracking (OMFT) problem of networked heterogeneous robotic systems (NHRSs), where each robot model involves external disturbances, parametric uncertainties, and possible kinematic redundancy. Besides, the interactions among robotic systems are described as a directed graph with an acyclic partition. Then, several novel practical finite-time hierarchical control (FTHC) algorithms are designed. The convergence analysis of the closed-loop dynamics is extremely difficult due to the lack of effective analysis methods. Based on the mathematics induction and reductio ad absurdum, a new nonsmooth Lyapunov function is proposed to derive the sufficient conditions and settling time functions. Finally, numerical simulations are performed on the NHRS to verify the main results.

Model-Independent Formation Tracking of Multiple Euler-Lagrange Systems via Bounded Inputs

This article addresses two kinds of formation tracking problems, namely: 1) the practical formation tracking (PFT) problem and 2) the zero-error formation tracking (ZEFT) problem for multiple Euler-Lagrange systems with input disturbances and unknown models. In these problems, the bounded input constraint, which can be possibly caused by actuator saturation and power limitations, is taken into consideration. Then, the two classes of model-independent distributed control approaches, in which the prior information (i.e., the structures and features) of the system model is not used, are proposed correspondingly. Based on the nonsmooth analysis and Lyapunov stability theory, several novel criteria for achieving PFT and ZEFT of multiple Euler-Lagrange systems are derived. Finally, numerical simulations and comparisons are presented to verify the validity and effectiveness of the proposed control approaches.

Hierarchical Controller-Estimator for Coordination of Networked Euler-Lagrange Systems

This paper proposes several hierarchical controller-estimator algorithms (HCEAs) to solve the coordination problem of networked Euler-Lagrange systems (NELSs) with sampled-data interactions and switching interaction topologies, where the cases with both discontinuous and continuous signals are successfully addressed in a unified framework. The HCEAs comprise two main layers (i.e., a control layer and an estimator layer) and one optional layer (i.e., a filter layer), in which the coordination problem is tackled in the main layers and the transient response can be optionally smoothed in the filter layer. For stabilizing the corresponding cascade closed-loop systems, several sufficient conditions on the upper bound of the aperiodic sampling intervals and the lower bound of the control parameters are established. In addition, the HCEAs are extended to address the task-space coordination problem of networked heterogeneous robotic systems, which shows the versatility of the HCEAs. Finally, comparison studies and simulation results are provided to demonstrate the effectiveness, significance, and advantages of the presented algorithms.

Lower Bounds on the Proportion of Leaders Needed for Expected Consensus of 3-D Flocks

This paper considers the consensus behavior of a spatially distributed 3-D dynamical network composed of heterogeneous agents: leaders and followers, in which the leaders have the preferred information about the destination, while the followers do not have. All followers move in a 3-D Euclidean space with a given speed and with their headings updated according to the average velocity of the corresponding neighbors. Compared with the 2-D model, a key point lies in how to analyze the dynamical behavior of a "linear" nonhomogeneous equation where the nonhomogeneous term strongly nonlinearly depends on the states of all agents. Using the network structure and the estimation of some characteristics for the initial states, we present a proper decaying rate for the nonhomogeneous term and then establish lower bounds on the ratio of the number of leaders to the number of followers that is needed for the expected consensus by considering two cases: 1) fixed speed and neighborhood radius and 2) variable speed and neighborhood radius with respect to the population size. Some simulation examples are given to justify the theoretical results.This paper considers the consensus behavior of a spatially distributed 3-D dynamical network composed of heterogeneous agents: leaders and followers, in which the leaders have the preferred information about the destination, while the followers do not have. All followers move in a 3-D Euclidean space with a given speed and with their headings updated according to the average velocity of the corresponding neighbors. Compared with the 2-D model, a key point lies in how to analyze the dynamical behavior of a "linear" nonhomogeneous equation where the nonhomogeneous term strongly nonlinearly depends on the states of all agents. Using the network structure and the estimation of some characteristics for the initial states, we present a proper decaying rate for the nonhomogeneous term and then establish lower bounds on the ratio of the number of leaders to the number of followers that is needed for the expected consensus by considering two cases: 1) fixed speed and neighborhood radius and 2) variable speed and neighborhood radius with respect to the population size. Some simulation examples are given to justify the theoretical results.