629 research outputs found
Event-triggered consensus of multi-agent systems under directed topology based on periodic sampled-data
The event-triggered consensus problem of first-order multi-agent systems
under directed topology is investigated. The event judgements are only
implemented at periodic time instants. Under the designed consensus algorithm,
the sampling period is permitted to be arbitrarily large. Another advantage of
the designed consensus algorithm is that, for systems with time delay,
consensus can be achieved for any finite delay only if it is bounded by the
sampling period. The case of strongly connected topology is first investigated.
Then, the result is extended to the most general topology which only needs to
contain a spanning tree. A novel method based on positive series is introduced
to analyze the convergence of the closed-loop systems. A numerical example is
provided to illustrate the effectiveness of the obtained theoretical results
Periodic event-triggered output regulation for linear multi-agent systems
This study considers the problem of periodic event-triggered (PET)
cooperative output regulation for a class of linear multi-agent systems. The
advantage of the PET output regulation is that the data transmission and
triggered condition are only needed to be monitored at discrete sampling
instants. It is assumed that only a small number of agents can have access to
the system matrix and states of the leader. Meanwhile, the PET mechanism is
considered not only in the communication between various agents, but also in
the sensor-to-controller and controller-to-actuator transmission channels for
each agent. The above problem set-up will bring some challenges to the
controller design and stability analysis. Based on a novel PET distributed
observer, a PET dynamic output feedback control method is developed for each
follower. Compared with the existing works, our method can naturally exclude
the Zeno behavior, and the inter-event time becomes multiples of the sampling
period. Furthermore, for every follower, the minimum inter-event time can be
determined \textit{a prior}, and computed directly without the knowledge of the
leader information. An example is given to verify and illustrate the
effectiveness of the new design scheme.Comment: 17 pages, 13 figures, submitted to Automatica. accepte
Fully distributed consensus for high-order strict-feedback nonlinear multiagent systems with switched topologies
summary:This paper studies the distributed consensus problem of high-order strict-feedback nonlinear multiagent systems. By employing the adaptive backstepping technique and switched system theory, a novel protocol is proposed for MASs with switched topologies. Global information such as the number of agents and communication topology is not used. In addition, the communication topology between agents can be switched between possible topologies at any time. Based on the Lyapunov function method, the proposed adaptive protocol guarantees the complete consensus of multiagent systems without restricting the dwell time of the switched signal. Finally, two numerical examples are provided to illustrate the effectiveness and advantages of the given protocol
Estimation and stability of nonlinear control systems under intermittent information with applications to multi-agent robotics
This dissertation investigates the role of intermittent information in estimation and control problems and applies the obtained results to multi-agent tasks in robotics. First, we develop a stochastic hybrid model of mobile networks able to capture a large variety of heterogeneous multi-agent problems and phenomena. This model is applied to a case study where a heterogeneous mobile sensor network cooperatively detects and tracks mobile targets based on intermittent observations. When these observations form a satisfactory target trajectory, a mobile sensor is switched to the pursuit mode and deployed to capture the target. The cost of operating the sensors is determined from the geometric properties of the network, environment and probability of target detection. The above case study is motivated by the Marco Polo game played by children in swimming pools. Second, we develop adaptive sampling of targets positions in order to minimize energy consumption, while satisfying performance guarantees such as increased probability of detection over time, and no-escape conditions. A parsimonious predictor-corrector tracking filter, that uses geometrical properties of targets\u27 tracks to estimate their positions using imperfect and intermittent measurements, is presented. It is shown that this filter requires substantially less information and processing power than the Unscented Kalman Filter and Sampling Importance Resampling Particle Filter, while providing comparable estimation performance in the presence of intermittent information. Third, we investigate stability of nonlinear control systems under intermittent information. We replace the traditional periodic paradigm, where the up-to-date information is transmitted and control laws are executed in a periodic fashion, with the event-triggered paradigm. Building on the small gain theorem, we develop input-output triggered control algorithms yielding stable closed-loop systems. In other words, based on the currently available (but outdated) measurements of the outputs and external inputs of a plant, a mechanism triggering when to obtain new measurements and update the control inputs is provided. Depending on the noise environment, the developed algorithm yields stable, asymptotically stable, and Lp-stable (with bias) closed-loop systems. Control loops are modeled as interconnections of hybrid systems for which novel results on Lp-stability are presented. Prediction of a triggering event is achieved by employing Lp-gains over a finite horizon in the small gain theorem. By resorting to convex programming, a method to compute Lp-gains over a finite horizon is devised. Next, we investigate optimal intermittent feedback for nonlinear control systems. Using the currently available measurements from a plant, we develop a methodology that outputs when to update the control law with new measurements such that a given cost function is minimized. Our cost function captures trade-offs between the performance and energy consumption of the control system. The optimization problem is formulated as a Dynamic Programming problem, and Approximate Dynamic Programming is employed to solve it. Instead of advocating a particular approximation architecture for Approximate Dynamic Programming, we formulate properties that successful approximation architectures satisfy. In addition, we consider problems with partially observable states, and propose Particle Filtering to deal with partially observable states and intermittent feedback. Finally, we investigate a decentralized output synchronization problem of heterogeneous linear systems. We develop a self-triggered output broadcasting policy for the interconnected systems. Broadcasting time instants adapt to the current communication topology. For a fixed topology, our broadcasting policy yields global exponential output synchronization, and Lp-stable output synchronization in the presence of disturbances. Employing a converse Lyapunov theorem for impulsive systems, we provide an average dwell time condition that yields disturbance-to-state stable output synchronization in case of switching topology. Our approach is applicable to directed and unbalanced communication topologies.\u2
Secure rendezvous and static containment in multi-agent systems with adversarial intruders
In this paper we propose a novel distributed local interaction protocol for networks of multi-agent systems (MASs) in a multi-dimensional space under directed time-varying graph with the objective to achieve secure rendezvous or static containment within the convex hull of a set of leader agents. We consider the scenario where a set of anonymous adversarial agents may intrude the network (or may be hijacked by a cyber-attack) and show that the proposed strategy guarantees the achievement of the global objective despite the continued influence of the adversaries which cannot be detected nor identified by the collaborative agents. We characterize the convergence properties of the proposed protocol in terms of the characteristics of the underlying network topology of the multi-agent system. Numerical simulations and examples corroborate the theoretical results
- …