A class of uncertain nonlinear systems that are additionally driven by unknown covariance noise is considered. Based on the backstepping technique, adaptive neural control schemes are developed to solve the output tracking control problem of such systems. As it is proven by stability analysis, the proposed controller guarantees that all the error variables are bounded with desired probability in a compact set while the tracking error is mean-square semiglobally uniformly ultimately bounded (M-SGUUB). The tracking performance and the effectiveness of the proposed design are evaluated by simulation results.
11 October 2016 in IEEE Transactions on Automatic Control
The agreement control problem of single and double-integrator agents with unknown and nonidentical control directions is addressed in this note under switching network topology. Distributed nonlinear PI control laws are proposed which ensure asymptotic consensus among the agents based on a new boundedness lemma and a generalized version of Barbalát's lemma for uniformly piecewise right continuous functions. Theoretical results are verified by simulation studies.
24 August 2018 in IEEE Transactions on Automatic Control
Existing results on cooperative control of multi-agent systems with unknown control directions require that the underlying topology is either fixed with a strongly connected graph or switching between different strongly connected graphs. Furthermore, in most cases the graph is assumed to be balanced. This paper proposes a new class of nonlinear PI based algorithms to relax these requirements and allow for unbalanced and switching topologies having a jointly strongly connected basis. This is made possible for single-integrator (SI) and double-integrator (DI) agents with non-identical unknown control directions by a suitable selection of the distributed nonlinear PI functions. Moreover, as a special case, the proposed algorithms are applied to strongly connected and fixed graphs. Finally, simulation examples are given to show the validity of our theoretical results.
30 September 2010 in IEEE Transactions on Automatic Control
In this note, the use of Nussbaum gains for adaptive neural network (NN) control is examined. Extending previous approaches that have been successfully applied to prove the forward completeness property (boundedness up to finite time), we address the boundedness for all time (up to infinity) problem. An example is constructed showing that this is not possible in general with the existing theoretical tools. To achieve boundedness for all time, a novel hysteresis-based deadzone scheme with resetting is introduced for the associated update laws. In this way, a unique, piecewise continuously differentiable solution is obtained while the error converges in finite time within some arbitrarily small region of the origin. Using the proposed modification, an adaptive NN tracking controller is designed for a class of multiple-input multiple-output nonlinear systems.
In this paper, we investigate the adaptive cooperative control problem with guaranteed convergence for a class of nonlinear multiagent systems with unknown control directions and time-varying topologies. A key lemma is first derived which involves dynamically changing interaction topologies, and then a new kind of distributed control algorithms with Nussbaum-type functions are proposed based on this lemma. It is proven that if the topologies are time varying with integral weight uniform upper bound and reciprocity, then convergence is guaranteed with the proposed algorithms for nonlinear multiagent systems with nonidentical unknown control directions. An important feature of this paper is that, under time-varying topologies, the designed algorithms can deal with nonidentical unknown control directions by using classical Nussbaum-type functions. Moreover, with the proposed algorithms, we extend the adaptive cooperative control results to the case of δ-connected graphs. In particular, the adaptive leaderless consensus of high-order nonlinear agents with nonidentical unknown control directions and a directed graph having a spanning tree is also tackled as a special case. Finally, theoretical results are illustrated by a group of Genesio-Tesi systems with distributed control algorithms under time-varying topologies and some special network topologies.
12 November 2019 in IEEE Transactions on Systems, Man, and Cybernetics: Systems