scholarly journals Impulsive Consensus for Leader-Following Multiagent Systems with Fixed and Switching Topology

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi-Wei Liu ◽  
Zhi-Hong Guan ◽  
Hong Zhou
Keyword(s):  
Multiagent System ◽  
Impulsive Control ◽  
Sampling Period ◽  
Switching Topology ◽  
Sufficient Condition ◽  
Leader Following ◽  
Fixed Topology ◽  
The Stability ◽  
Sampling Instant ◽  
Necessary And Sufficient

This paper studied the consensus problem of the leader-following multiagent system. It is assumed that the state information of the leader is only available to a subset of followers, while the communication among agents occurs at sampling instant. To achieve leader-following consensus, a class of distributed impulsive control based on sampling information is proposed. By using the stability theory of impulsive systems, algebraic graph theory, and stochastic matrices theory, a necessary and sufficient condition for fixed topology and sufficient condition for switching topology are obtained to guarantee the leader-following consensus of the multiagent system. It is found that leader-following consensus is critically dependent on the sampling period, control gains, and interaction graph. Finally, two numerical examples are given to illustrate the effectiveness of the proposed approach and the correctness of theoretical analysis.

scholarly journals Distributed Impulsive Consensus of the Multiagent System without Velocity Measurement

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Zhi-Wei Liu ◽  
Hong Zhou ◽  
Zhi-Hong Guan ◽  
Wen-Shan Hu ◽  
Li Ding ◽  
...  
Keyword(s):  
Velocity Measurement ◽  
Multiagent System ◽  
Impulsive Control ◽  
Sufficient Conditions ◽  
Laplacian Matrix ◽  
Impulsive System ◽  
Consensus Algorithm ◽  
Communication Graph ◽  
The Stability ◽  
Necessary And Sufficient

This paper deals with the distributed consensus of the multiagent system. In particular, we consider the case where the velocity (second state) is unmeasurable and the communication among agents occurs at sampling instants. Based on the impulsive control theory, we propose an impulsive consensus algorithm that extends some of our previous work to account for the lack of velocity measurement. By using the stability theory of the impulsive system, some necessary and sufficient conditions are obtained to ensure the consensus of the controlled multiagent system. It is shown that the control gains, the sampled period and the eigenvalues of Laplacian matrix of communication graph play key roles in achieving consensus. Finally, a numerical simulation is provided to illustrate the effectiveness of the proposed algorithm.

scholarly journals Leader-Following Consensus in Networks of Agents with Nonuniform Time-Varying Delays

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Zhao-Jun Tang ◽  
Ting-Zhu Huang ◽  
Jiang-Ping Hu ◽  
Jin-Liang Shao
Keyword(s):  
Sufficient Condition ◽  
Time Varying ◽  
Consensus Problem ◽  
Communication Delays ◽  
Necessary And Sufficient Condition ◽  
Leader Following ◽  
Fixed Topology ◽  
Simulation Results ◽  
Necessary And Sufficient ◽  
Theoretical Results

This paper is concerned with a leader-following consensus problem for networks of agents with fixed and switching topologies as well as nonuniform time-varying communication delays. By employing Lyapunov-Razumikhin function, a necessary and sufficient condition is derived in the case of fixed topology, and a sufficient condition is obtained in the case when the interconnection topology is switched and satisfies certain condition. Simulation results are provided to illustrate the theoretical results.

Some Structural Properties of Systolic Tree Automata

1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi
Keyword(s):  
Structural Properties ◽  
Stability Problem ◽  
Sufficient Condition ◽  
Tree Automata ◽  
Necessary And Sufficient Condition ◽  
The Stability ◽  
Necessary And Sufficient

We prove that the classes of languages accepted by systolic automata over t-ary trees (t-STA) are always either equal or incomparable if one varies t. We introduce systolic tree automata with base (T(b)-STA), a subclass of STA with interesting properties of modularity, and we give a necessary and sufficient condition for the equivalence between a T(b)-STA and a t-STA, for a given base b. Finally, we show that the stability problem for T(b)-ST A is decidible.

A Dynamic Duopoly Game with Content Providers’ Bounded Rationality

2020 ◽  
Vol 30 (07) ◽  
pp. 2050095 ◽  
Author(s):  
Hamid Garmani ◽  
Driss Ait Omar ◽  
Mohamed El Amrani ◽  
Mohamed Baslam ◽  
Mostafa Jourhmane
Keyword(s):  
Bounded Rationality ◽  
Chaotic Behavior ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Pricing Decisions ◽  
Dynamical Behaviors ◽  
Duopoly Model ◽  
The Stability ◽  
Necessary And Sufficient ◽  
Dynamic Duopoly

This paper investigates the dynamical behaviors of a duopoly model with two content providers (CPs). Competition between two CPs is assumed to take place in terms of their pricing decisions and the credibility of content they offer. According to the CPs’ rationality level, we consider a scenario where both CPs are bounded rational. Each CP in any period uses the marginal profit observed from the previous period to choose its strategies. We compute explicitly the steady states of the dynamical system induced by bounded rationality, and establish a necessary and sufficient condition for stability of its Nash equilibrium (NE). Numerical simulations show that if some parameters of the model are varied, the stability of the NE point is lost and the complex (periodic or chaotic) behavior occurs. The chaotic behavior of the system is stabilized on the NE point by applying control.

scholarly journals Sampled-Data Consensus for High-Order Multiagent Systems under Fixed and Randomly Switching Topology

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Niu Jie ◽  
Li Zhong
Keyword(s):  
Multiagent Systems ◽  
Linear Time ◽  
Sampling Period ◽  
Switching Topology ◽  
Sampled Data ◽  
System Matrix ◽  
Packet Losses ◽  
Linear Time Invariant ◽  
Switching Topologies ◽  
Necessary And Sufficient

This paper studies the sampled-data based consensus of multiagent system with general linear time-invariant dynamics. It focuses on looking for a maximum allowable sampling period bound such that as long as the sampling period is less than this bound, there always exist linear consensus protocols solving the consensus problem. Both fixed and randomly switching topologies are considered. For systems under fixed topology, a necessary and sufficient sampling period bound is obtained for single-input multiagent systems, and a sufficient allowable bound is proposed for multi-input systems by solving theH∞optimal control problem of certain system with uncertainty. For systems under randomly switching topologies, tree-type and complete broadcasting network with Bernoulli packet losses are discussed, and explicit allowable sampling period bounds are, respectively, given based on the unstable eigenvalues of agent’s system matrix and packet loss probability. Numerical examples are given to illustrate the results.

A New Algorithm for Testing the Stability of a Polytope: A Geometric Approach for Simplification

1996 ◽  
Vol 118 (3) ◽  
pp. 611-615 ◽  
Author(s):  
Jinsiang Shaw ◽  
Suhada Jayasuriya
Keyword(s):  
Characteristic Equation ◽  
Robust Stability ◽  
Geometric Structure ◽  
Geometric Approach ◽  
Geometric Interpretation ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
The Stability ◽  
Necessary And Sufficient ◽  
Edge Theorem

Considered in this paper is the robust stability of a class of systems in which a relevant characteristic equation is a family of polynomials F: f(s, q) = a0(q) + a1(q)s + … + an(q)sn with its coefficients ai(q) depending linearly on q unknown-but-bounded parameters, q = (p1, p2, …, pq)T. It is known that a necessary and sufficient condition for determining the stability of such a family of polynomials is that polynomials at all the exposed edges of the polytope of F in the coefficient space be stable (the edge theorem of Bartlett et al., 1988). The geometric structure of such a family of polynomials is investigated and an approach is given, by which the number of edges of the polytope that need to be checked for stability can be reduced considerably. An example is included to illustrate the benefit of this geometric interpretation.

scholarly journals Stability Analysis ofθ-Methods for Neutral Multidelay Integrodifferential System

2007 ◽  
Vol 2007 ◽  
pp. 1-8
Author(s):  
Y. Xu ◽  
J. J. Zhao ◽  
Z. N. Sui
Keyword(s):  
Numerical Stability ◽  
Numerical Experiments ◽  
Analytic Solutions ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Neutral Delay ◽  
Integrodifferential System ◽  
System A ◽  
The Stability ◽  
Necessary And Sufficient

This paper studies the stability of a class of neutral delay integrodifferential system. A necessary and sufficient condition of stability for its analytic solutions is considered. The improvedθ-methods are developed. Some numerical stability properties are obtained and numerical experiments are given.

On the stability of some solutions of the Stefan problem

1991 ◽  
Vol 2 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Riccardo Ricci ◽  
Xie Weiqing
Keyword(s):  
Stefan Problem ◽  
Travelling Wave ◽  
Sufficient Condition ◽  
Travelling Wave Solutions ◽  
Necessary And Sufficient Condition ◽  
One Dimensional ◽  
The Stability ◽  
The One ◽  
Necessary And Sufficient ◽  
Travelling Wave Front

We investigate the stability of travelling wave solutions of the one-dimensional under-cooled Stefan problem. We find a necessary and sufficient condition on the initial datum under which the free boundary is asymptotic to a travelling wave front. The method applies also to other types of solutions.

Sign in / Sign up

Export Citation Format

Share Document