Adaptive fuzzy prescribed-time connectivity-preserving consensus of stochastic nonstrict-feedback switched multiagent systems

An adaptive fuzzy prescribed-time connectivity-preserving consensus protocol is designed for a class of stochastic nonstrict-feedback multiagent systems, in which periodic disturbances, switched nonlinearities, input saturation, and limited communication ranges are taken into consideration simultaneously. The connectivity, determined by the limited communication ranges and initial positions of agents, is preserved by incorporating an error transformation. Further, a common Lyapunov function is considered to deal with the switching modes. By combining a reduced fuzzy logic system with Fourier series expansion, a novel approximator is constructed to deal with periodically disturbed nonlinearities and to surmount the difficulty brought by the nonstrict-feedback structure. More importantly, distinctly from the existing finite/fixed-time control strategies where the settling time is heavily dependent on the accurate value of the initial states and control parameters, the settling time of the proposed prescribed-time consensus is completely independent of the initialization and control parameters and can be given a priori only according to actual demands. Based on the Lyapunov stability theory, the designed controller ensures that the connectivity-preserving consensus is achieved in prescribed time and all the signals remain bounded in probability. To the end, the feasibility of the proposed consensus protocol is demonstrated by simulation

Cooperative Control of Nonlinear Multi-Agent Systems

Multi-agent systems have attracted great interest due to their potential applications in a variety of areas. In this dissertation, a nonlinear consensus algorithm is developed for networked Euler-Lagrange multi-agent systems. The proposed consensus algorithm guarantees that all agents can reach a common state in the workspace. Meanwhile, the external disturbances and structural uncertainties are fundamentally considered in the controller design. The robustness of the proposed consensus algorithm is then demonstrated in the stability analysis. Furthermore, experiments are conducted to validate the effectiveness of the proposed consensus algorithm. Next, a distributed leader-follower formation tracking controller is developed for networked nonlinear multi-agent systems. The dynamics of each agent are modeled by Euler-Lagrange equations, and all agents are guaranteed to track a desired time-varying trajectory in the presence of noise. The fault diagnosis strategy of the nonlinear multi-agent system is also investigated with the help of differential geometry tools. The effectiveness of the proposed controller is verified through simulations. To further extend the application area of the multi-agent technique, a distributed robust controller is then developed for networked Lipschitz nonlinear multi-agent systems. With the appearance of system uncertainties and external disturbances, a sampled-data feedback control protocol is carried out through the Lyapunov functional approach. The effectiveness of the proposed controller is verified by numerical simulations. Other than the robustness and sampled-data information exchange, this dissertation is also concerned with the event-triggered consensus problem for the Lipschitz nonlinear multi-agent systems. Furthermore, the sufficient condition for the stochastic stabilization of the networked control system is proposed based on the Lyapunov functional method. Finally, simulation is conducted to demonstrate the effectiveness of the proposed control algorithm. In this dissertation, the cooperative control of networked Euler-Lagrange systems and networked Lipschitz systems is investigated essentially with the assistance of nonlinear control theory and diverse controller design techniques. The main objective of this work is to propose realizable control algorithms for nonlinear multi-agent systems

Journal of Telecommunications and Information Technology, 2006, nr 4

kwartalni

Generalized averaged Gaussian quadrature and applications

A simple numerical method for constructing the optimal generalized averaged Gaussian quadrature formulas will be presented. These formulas exist in many cases in which real positive GaussKronrod formulas do not exist, and can be used as an adequate alternative in order to estimate the error of a Gaussian rule. We also investigate the conditions under which the optimal averaged Gaussian quadrature formulas and their truncated variants are internal