• Corpus ID: 761495

# Consensus for switched networks with unknown but bounded disturbances

@article{Bauso2006ConsensusFS,
title={Consensus for switched networks with unknown but bounded disturbances},
author={Dario Bauso and Laura Giarr'e and Raffaele Pesenti},
journal={arXiv: Optimization and Control},
year={2006}
}
• Published 28 December 2006
• Mathematics
• arXiv: Optimization and Control
We consider stationary consensus protocols for networks of dynamic agents with switching topologies. The measure of the neighbors' state is affected by Unknown But Bounded disturbances. Here the main contribution is the formulation and solution of what we call the $\epsilon$-consensus problem, where the states are required to converge in a tube of ray $\epsilon$ asymptotically or in finite time.

## Figures from this paper

Lazy consensus for networks with unknown but bounded disturbances
• Computer Science
2007 46th IEEE Conference on Decision and Control
• 2007
This work considers stationary consensus protocols for networks of dynamic agents and the formulation and solution of the isin-consensus problem, where the states are required to converge in a tube of ray isin asymptotically or in finite time.
Stochastic Consensus Seeking With Noisy and Directed Inter-Agent Communication: Fixed and Randomly Varying Topologies
• Mathematics, Computer Science
IEEE Transactions on Automatic Control
• 2010
This work considers consensus seeking of networked agents on directed graphs where each agent has only noisy measurements of its neighbors' states and uses Stochastic approximation type algorithms to generalize the algorithm to networks with random link failures and prove convergence results.
Dealing with uncertainty in consensus protocols
• Computer Science
• 2009
The Unknown But Bounded (UBB) noise affecting the network is addressed in details and the solution of the e-consensus problem, where the states converge in a tube of ray e asymptotically or in finite time, is described.
Challenging aspects in Consensus protocols for Networks
• Computer Science
2008 3rd International Symposium on Communications, Control and Signal Processing
• 2008
The unknown but bounded (UBB) noise affecting the network is addressed in details and the solution of the epsiv-consensus problem, where the states converge in a tube of ray epsIV asymptotically or in finite time, is described.
Decentralized formation control of mobile agents: A unified framework
• Mathematics
• 2008
This paper studies the formation control problem for systems consisting of multiple mobile agents that are described by first-order differential equations and second-order differential equations
Event-Based Set-Membership Leader-Following Consensus of Networked Multi-Agent Systems Subject to Limited Communication Resources and Unknown-But-Bounded Noise
• Mathematics, Computer Science
IEEE Transactions on Industrial Electronics
• 2017
A delicate convex optimization algorithm in terms of recursive linear matrix inequalities is proposed to design desired consensus protocol and event-based mechanism for networked multi-agent systems subject to limited communication resources and unknown-but-bounded process and measurement noise.
• Engineering, Computer Science
2015 International Conference on Advanced Robotics (ICAR)
• 2015
A new cooperative adaptive cruise control with rear-end collision check employing deadzone switching techniques employing dead zone switching techniques to maintain desired spacing between consequent vehicles in a platoon is presented.
Codesign Strategy based upon Takagi Sugeno Control Design and Real-Time Computing Integration
The use of time delay impact is explored in this paper to pursuit as a two objective strategy the definition of a valid metric that represents the effects in both analysis following the idea that stability analysis is affected according to the schedullability analysis.

## References

SHOWING 1-10 OF 18 REFERENCES
Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Mathematics, Computer Science
IEEE Transactions on Automatic Control
• 2005
It is shown that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.
Consensus problems in networks of agents with switching topology and time-delays
• Mathematics, Computer Science
IEEE Transactions on Automatic Control
• 2004
A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Non-linear protocols for optimal distributed consensus in networks of dynamic agents
• Mathematics, Computer Science
Syst. Control. Lett.
• 2006
It is proved that such objectives can be chosen so that rational agents have a unique optimal protocol, and asymptotical consensus can be reached when the communication links between nearby agents define a time-invariant undirected network.
Leaderless coordination via bidirectional and unidirectional time-dependent communication
• L. Moreau
• Engineering
42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)
• 2003
We study a simple but compelling model of n interacting agents with time-dependent, bidirectional and unidirectional communication. The model finds wide application in a variety of fields including
A survey of consensus problems in multi-agent coordination
• Engineering
Proceedings of the 2005, American Control Conference, 2005.
• 2005
As a distributed solution to multi-agent coordination, consensus or agreement problems have been studied extensively in the literature. This paper provides a survey of consensus problems in
Stabilization Of Continuous-time Switched Systems
• Computer Science, Mathematics
• 2005
Two strategies for stabilization of continuous time linear switched system are addressed and a more conservative version of the Lyapunov-Metzler inequalities, expressed in terms of linear matrix inequalities is given.
Information flow and cooperative control of vehicle formations
• Mathematics, Computer Science
IEEE Transactions on Automatic Control
• 2004
A Nyquist criterion is proved that uses the eigenvalues of the graph Laplacian matrix to determine the effect of the communication topology on formation stability, and a method for decentralized information exchange between vehicles is proposed.
Strict Lyapunov functions for time-varying systems
• F. Mazenc
• Mathematics, Computer Science
Autom.
• 2003
Uniformly asymptotically stable periodic time-varying systems for which is known a Lyapunov function with a derivative along the trajectories non-positive and negative definite in the state variable
Multiple Lyapunov functions and other analysis tools for switched and hybrid systems
• M. Branicky
• Computer Science, Mathematics
IEEE Trans. Autom. Control.
• 1998
Bendixson's theorem is extended to the case of Lipschitz continuous vector fields, allowing limit cycle analysis of a class of "continuous switched" systems.
Switching in Systems and Control
• D. Liberzon
• Mathematics, Computer Science
Systems & Control: Foundations & Applications
• 2003
I. Stability under Arbitrary Switching, Systems not Stabilizable by Continuous Feedback, and Systems with Sensor or Actuator Constraints with Large Modeling Uncertainty.