Search

In this article, we address the distributed event-triggered leader–follower formation tracking control problem of general linear multiagent systems with a dynamic leader in sampled-data settings. A novel locally computable state-estimate-based event generator is established for each follower agent to regulate the interagent communication at each sampling instant. Then, we propose a distributed formation tracking protocol based on the triggered sampled information such that the formation tracking control problem can be formulated as a stability-analysis problem of the closed-loop formation error dynamics. The event generator and formation tracking controller gains can then be co-designed using the feasible linear matrix inequality conditions that are derived from Lyapunov-based stability-analysis methods that guarantee the ultimate boundedness of the closed-loop formation error dynamics. Finally, numerical simulations along with experiment implementations were conducted for a group of linearized unicycle-type mobile robots to demonstrate the effectiveness and advantages of the proposed method. [ABSTRACT FROM AUTHOR]

This paper studies the event-triggered containment control (CC) problem of multiagent systems with a directed graph, where the followers’ communication graph is an undirected graph. A novel event-triggered CC protocol is presented to schedule communications between agents, which depends on both local states and control inputs. Different from traditional approaches using broadcasts, a unique property of the proposed protocol is that it enables agent-to-agent data transmission. To do so, each communication link is associated with a specific local event. The estimated relative interagent states are transmitted over a specific link only when the related input-based event is detected. We develop sufficient conditions to solve CC problem under this protocol and extend it to the adaptive event-triggered protocol that does not require the global knowledge on the smallest positive eigenvalue of the Laplacian. For both protocols, we derive positive low bounds on the interevent time intervals generated by individual events, which eliminate the “Zeno phenomenon.” Feasibility of the proposed algorithm is verified by an example. [ABSTRACT FROM AUTHOR]

This paper considers the consensus problem of multiagent systems with the input-based triggering condition. A model-based approach is first given to estimate the relative interagent states between intermittent communications instead of absolute states. A novel consensus protocol consisting of the relative interagent states is proposed for the consensus problem. Besides, compared with some results on the triggering condition consisting of state measurement error, a new triggering condition is constructed based on the control input. Then, the consensus protocol is executed by every agent in a fully distributed way, which has the advantage that the controller design is related to the number of agents instead of using global information. Moreover, the bounds of parameters of the controller and the triggering condition can be obtained by the proposed algorithm simultaneously, which depends on the total number of agents in multiagent networks. The proposed control scheme can ensure that states of all agents can achieve consensus. It is shown that “Zeno behavior” does not appear under the proposed algorithm. Finally, an illustrative example is given to verify the proposed method. [ABSTRACT FROM AUTHOR]