Adaptive Fuzzy Tracking Control with Global Prescribed-Time Prescribed Performance for Uncertain Strict-Feedback Nonlinear Systems

Adaptive fuzzy control strategies are established to achieve global prescribed performance with prescribed-time convergence for strict-feedback systems with mismatched uncertainties and unknown nonlinearities. Firstly, to quantify the transient and steady performance constraints of the tracking error, a class of prescribed-time prescribed performance functions are designed, and a novel error transformation function is introduced to remove the initial value constraints and solve the singularity problem in existing works. Secondly, based on dynamic surface control methods, controllers with or without approximating structures are established to guarantee that the tracking error achieves prescribed transient performance and converges into a prescribed bounded set within prescribed time. In particular, the settling time and initial value of the prescribed performance function are completely independent of initial conditions of the tracking error and system parameters, which improves existing results. Moreover, with a novel Lyapunov-like energy function, not only the differential explosion problem frequently occurring in backstepping techniques is solved, but the drawback of the semi-global boundedness of tracking error induced by dynamic surface control can be overcome. The validity and effectiveness of the main results are verified by numerical simulations on practical examples

Finite-time and fixed-time sliding mode control for second-order nonlinear multiagent systems with external disturbances

In this paper, the leader-following consensus of second-order nonlinear multiagent systems (SONMASs) with external disturbances is studied. Firstly, based on terminal sliding model control method, a distributed control protocol is proposed over undirected networks, which can not only suppress the external disturbances, but also make the SONMASs achieve consensus in finite time. Secondly, to make the settling time independent of the initial values of systems, we improve the protocol and ensure that the SONMASs can reach the sliding surface and achieve consensus in fixed time if the control parameters satisfy some conditions. Moreover, for general directed networks, we design a new fixed-time control protocol and prove that both the sliding mode surface and consensus for SONMASs can be reached in fixed time. Finally, several numerical simulations are given to show the effectiveness of the proposed protocols

Mobile robot localization under stochastic communication protocol

summary:In this paper, the mobile robot localization problem is investigated under the stochastic communication protocol (SCP). In the mobile robot localization system, the measurement data including the distance and the azimuth are received by multiple sensors equipped on the robot. In order to relieve the network burden caused by network congestion, the SCP is introduced to schedule the transmission of the measurement data received by multiple sensors. The aim of this paper is to find a solution to the robot localization problem by designing a time-varying filter for the mobile robot such that the filtering error dynamics satisfies the $H_{\infty}$ performance requirement over a finite horizon. First, a Markov chain is introduced to model the transmission of measurement data. Then, by utilizing the stochastic analysis technique and completing square approach, the gain matrices of the desired filter are designed in term of a solution to two coupled backward recursive Riccati equations. Finally, the effectiveness of the proposed filter design scheme is shown in an experimental platform

Event-triggered Consensus Frameworks for Multi-agent Systems

Recently, distributed multi-agent systems (MAS) have been widely studied for a variety of engineering applications, including cooperative vehicular systems, sensor networks, and electrical power grids. To solve the allocated tasks in MASs, each agent autonomously determines the appropriate actions using information available locally and received from its neighbours. Many cooperative behaviours in MAS are based on a consensus algorithm. Consensus, by definition, is to distributively agree on a parameter of interest between the agents. Depending on the application, consensus has different configurations such as leader-following, formation, synchronization in robotic arms, and state estimation in sensor networks. Consensus in MASs requires local measurements and information exchanges between the neighbouring agents. Due to the energy restriction, hardware limitation, and bandwidth constraint, strategies that reduce the amount of measurements and information exchanges between the agents are of paramount interest. Event-triggering transmission schemes are among the most recent strategies that efficiently reduce the number of transmissions. This dissertation proposes a number of event-triggered consensus (ETC) implementations which are applicable to MASs. Different performance objectives and physical constraints, such as a desired convergence rate, robustness to uncertainty in control realization, information quantization, sampled-data processing, and resilience to denial of service (DoS) attacks are included in realization of the proposed algorithms. A novel convex optimization is proposed which simultaneously designs the control and event-triggering parameters in a unified framework. The optimization governs the trade-off between the consensus convergence rate and intensity of transmissions. This co-design optimization is extended to an advanced class of event-triggered schemes, known as the dynamic event-triggering (DET), which is able to substantially reduce the amount of transmissions. In the presence of DoS attacks, the co-design optimization simultaneously computes the control and DET parameters so that the number of transmissions is reduced and a desired level of resilience to DoS is guaranteed. In addition to consensus, a formation-containment implementation is proposed, where the amount of transmissions are reduced using the DET schemes. The performance of the proposed implementations are evaluated through simulation over several MASs. The experimental results demonstrate the effectiveness of the proposed implementations and verify their design flexibility

Distributed filtering for switched nonlinear positive systems with missing measurements over sensor networks

In this paper, the distributed filtering problem is investigated for a class of switched nonlinear positive systems over sensor networks. The randomly varying nonlinearities and missing measurements, which are governed by two mutually independent Bernoulli distributed white sequences, are taken into account. Based on the output measurements of the individual sensor and its neighbors, the distributed filter with positivity constraint is designed to ensure the prescribed average l∞ performance index of the estimation error dynamics. Special attention is paid to preserve the positivity of the underlying system as well as the sparseness of the addressed network topology. Sufficient conditions are established on the existence of the desired filters by using the linear programming approach, and the filter gains are subsequently characterized. A simulation example is provided to illustrate the effectiveness of the proposed filtering method.This work was supported in part by the National Natural Science Foundation of China under Grant 61104114, Grant 61201035, Grant 61374070, and Grant 61473055 and in part by the Liaoning Province Science Foundation under Grant 2015020075 and in part by the General Projects for Science Research in the Liaoning Province under Grant L2014026

Distributed filtering of networked dynamic systems with non-gaussian noises over sensor networks: A survey

summary:Sensor networks are regarded as a promising technology in the field of information perception and processing owing to the ease of deployment, cost-effectiveness, flexibility, as well as reliability. The information exchange among sensors inevitably suffers from various network-induced phenomena caused by the limited resource utilization and complex application scenarios, and thus is required to be governed by suitable resource-saving communication mechanisms. It is also noteworthy that noises in system dynamics and sensor measurements are ubiquitous and in general unknown but can be bounded, rather than follow specific Gaussian distributions as assumed in Kalman-type filtering. Particular attention of this paper is paid to a survey of recent advances in distributed filtering of networked dynamic systems with non-Gaussian noises over sensor networks. First, two types of widely employed structures of distributed filters are reviewed, the corresponding analysis is systematically addressed, and some interesting results are provided. The inherent purpose of adding consensus terms into the distributed filters is profoundly disclosed. Then, some representative models characterizing various network-induced phenomena are reviewed and their corresponding analytical strategies are exhibited in detail. Furthermore, recent results on distributed filtering with non-Gaussian noises are sorted out in accordance with different network-induced phenomena and system models. Another emphasis is laid on recent developments of distributed filtering with various communication scheduling, which are summarized based on the inherent characteristics of their dynamic behavior associated with mathematical models. Finally, the state-of-the-art of distributed filtering and challenging issues, ranging from scalability, security to applications, are raised to guide possible future research