scholarly journals On Hybrid Adaptive and Pinning Consensus for Multiagent Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Lianghao Ji ◽  
Yi Tang ◽  
Qun Liu
Keyword(s):  
Convergence Rate ◽  
Discrete Time ◽  
Continuous Time ◽  
Spanning Tree ◽  
Pinning Control ◽  
Control Laws ◽  
Numerical Examples ◽  
Multiagent Networks ◽  
Directed Spanning Tree ◽  
Pinning Scheme

The consensus problems for both continuous-time and discrete-time multiagent networks are deeply investigated by adopting hybrid adaptive and pinning control laws, respectively. Particularly, the topology of the networks needs to neither be symmetric nor contain a directed spanning tree and some useful criteria are addressed analytically. Simultaneously, a comprehensive pinning scheme is proposed as well which shows that the nodes with zero in-degree need to be pinned primarily in order to guarantee the system to achieve consensus, and then the nodes whose out-degrees are bigger than their in-degrees can give priority to be pinned compared to other nodes for improving the convergence rate of the system, whereas it is also interesting to find out that the regular rule does not always hold, that is, the more nodes are selected to be pinned, the faster the system will converge. Finally, the validity of our theoretical findings is verified by several numerical examples.

scholarly journals Pinning Synchronization of Nonlinearly Coupled Complex Dynamical Networks on Time Scales

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Fang-Di Kong
Keyword(s):  
Time Scales ◽  
Discrete Time ◽  
Control Strategy ◽  
Continuous Time ◽  
General Framework ◽  
Pinning Control ◽  
Complex Dynamical Networks ◽  
Dynamical Networks ◽  
Numerical Examples ◽  
Synchronization Problem

In this paper, we study the synchronization problem for nonlinearly coupled complex dynamical networks on time scales. To achieve synchronization for nonlinearly coupled complex dynamical networks on time scales, a pinning control strategy is designed. Some pinning synchronization criteria are established for nonlinearly coupled complex dynamical networks on time scales, which guarantee the whole network can be pinned to some desired state. The model investigated in this paper generalizes the continuous-time and discrete-time nonlinearly coupled complex dynamical networks to a unique and general framework. Moreover, two numerical examples are given for illustration and verification of the obtained results.

ORCCAD: software engineering for real-time robotics. A technical insight

Robotica ◽  
1997 ◽  
Vol 15 (1) ◽  
pp. 111-115 ◽  
Author(s):  
D. Simon ◽  
B. Espiau ◽  
K. Kapellos ◽  
R. Pissard-Gibollet
Keyword(s):  
Software Engineering ◽  
Real Time ◽  
Discrete Time ◽  
Continuous Time ◽  
Robotic Systems ◽  
Formal Definition ◽  
Programming Environment ◽  
Control Laws ◽  
Low Levels ◽  
Definition Of

The ORCCAD programming environment for robotic systems gathers control laws in continuous time at the low levels and discrete time logical aspects at higher levels. Based upon a formal definition of robotic actions, complex applications can be designed, verified and generated incrementally. The approach and tools prototypes have been validated through several applications.

scholarly journals Descriptor fractional linear systems with regular pencils

2013 ◽  
Vol 23 (2) ◽  
pp. 309-315 ◽  
Author(s):  
Tadeusz Kaczorek
Keyword(s):  
Laplace Transform ◽  
Linear Systems ◽  
Discrete Time ◽  
Continuous Time ◽  
The State ◽  
Transition Matrices ◽  
State Equations ◽  
Numerical Examples ◽  
The Laplace Transform ◽  
Time Linear

Methods for finding solutions of the state equations of descriptor fractional discrete-time and continuous-time linear systems with regular pencils are proposed. The derivation of the solution formulas is based on the application of the Z transform, the Laplace transform and the convolution theorems. Procedures for computation of the transition matrices are proposed. The efficiency of the proposed methods is demonstrated on simple numerical examples.

Discrete time methods for simulating continuous time Markov chains

1976 ◽  
Vol 8 (04) ◽  
pp. 772-788 ◽  
Author(s):  
Arie Hordijk ◽  
Donald L. Iglehart ◽  
Rolf Schassberger
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Markov Chains ◽  
Confidence Intervals ◽  
Discrete Time ◽  
Continuous Time ◽  
Statistical Efficiency ◽  
Numerical Examples ◽  
The Central Limit Theorem ◽  
Continuous Time Markov Chains

This paper discusses several problems which arise when the regenerative method is used to analyse simulations of Markov chains. The first problem involves calculating the variance constant which appears in the central limit theorem used to obtain confidence intervals. Knowledge of this constant is very helpful in evaluating simulation methodologies. The second problem is to devise a method for simulating continuous time Markov chains without having to generate exponentially distributed holding times. Several methods are presented and compared. Numerical examples are given to illustrate the computional and statistical efficiency of these methods.

scholarly journals Comparison of approximation methods of positive stable continuous-time linear systems by positive stable discrete-time systems

2013 ◽  
Vol 62 (2) ◽  
pp. 345-355 ◽  
Author(s):  
Tadeusz Kaczorek
Keyword(s):  
Linear Systems ◽  
Discrete Time ◽  
Continuous Time ◽  
Electrical Circuit ◽  
Approximation Methods ◽  
Asymptotically Stable ◽  
Numerical Examples ◽  
Discrete Time Systems ◽  
Time Systems ◽  
Time Linear

Abstract The positive asymptotically stable continuous-time linear systems are approximated by corresponding asymptotically stable discrete-time linear systems. Two methods of the approximation are presented and the comparison of the methods is addressed. The considerations are illustrated by three numerical examples and an example of positive electrical circuit.

scholarly journals Nonlinear Min-Cost-Pursued Route-Swapping Dynamic System

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Wenyi Zhang ◽  
Wei Guan ◽  
Jihui Ma ◽  
Tao Wang
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
User Equilibrium ◽  
Adjustment Process ◽  
Rational Behavior ◽  
Traffic Network ◽  
Selfish Routing ◽  
Numerical Examples ◽  
The Stability ◽  
Routing Games

This study proposes a nonlinear min-cost-pursued swapping dynamic (NMSD) system to model the evolution of selfish routing games on traffic network where travelers only swap from previous costly routes to the least costly ones. NMSD is a rational behavior adjustment process with stationary link flow pattern being the Wardrop user equilibrium. NMSD is able to prevent two behavioral deficiencies suffered by the existing min-cost-oriented models and keep solution invariance. NMSD relaxes the homogeneous user assumption, and the continuous-time NMSD (CNMSD) and discrete-time NMSD (DNMSD) share the same revision protocol. Moreover, CNMSD is Lyapunov-stable. Two numerical examples are conducted. The first one is designed to characterize the NMSD-conducted network traffic evolution and test the stability of day-to-day NMSD. The second one aims to explore the impacts of network scale on the stability of route-swaps conducted by pairwise and min-cost-pursed swapping behaviors.

Discrete time methods for simulating continuous time Markov chains

1976 ◽  
Vol 8 (4) ◽  
pp. 772-788 ◽  
Author(s):  
Arie Hordijk ◽  
Donald L. Iglehart ◽  
Rolf Schassberger
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Markov Chains ◽  
Confidence Intervals ◽  
Discrete Time ◽  
Continuous Time ◽  
Statistical Efficiency ◽  
Numerical Examples ◽  
The Central Limit Theorem ◽  
Continuous Time Markov Chains

This paper discusses several problems which arise when the regenerative method is used to analyse simulations of Markov chains. The first problem involves calculating the variance constant which appears in the central limit theorem used to obtain confidence intervals. Knowledge of this constant is very helpful in evaluating simulation methodologies. The second problem is to devise a method for simulating continuous time Markov chains without having to generate exponentially distributed holding times. Several methods are presented and compared. Numerical examples are given to illustrate the computional and statistical efficiency of these methods.

COUPLING INTERACTING PARTICLE SYSTEMS

1993 ◽  
Vol 05 (03) ◽  
pp. 457-475 ◽  
Author(s):  
CHRISTIAN MAES
Keyword(s):  
Convergence Rate ◽  
Discrete Time ◽  
Continuous Time ◽  
Interacting Particle Systems ◽  
Random Processes ◽  
Particle Systems ◽  
Time Process ◽  
Probabilistic Cellular Automata ◽  
Interacting Particle ◽  
Continuous Time Process

We consider random processes (probabilistic cellular automata or interacting particle systems) defined through the interaction of an infinite number of components. We show how coupling arguments yield simple yet quite general ergodicity theorems. The relation between discrete time and continuous time versions is analyzed via similar techniques and the explicit convergence rate of discrete time approximations to the continuous time process is obtained.

scholarly journals Algorithms to Solve StochasticH2/H∞Control with State-Dependent Noise

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Ming Gao ◽  
Changdi Fu ◽  
Weihai Zhang
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Stochastic Systems ◽  
Infinite Horizon ◽  
Control Problems ◽  
Numerical Examples ◽  
State Dependent

This paper is concerned with the algorithms which solveH2/H∞control problems of stochastic systems with state-dependent noise. Firstly, the algorithms for the finite and infinite horizonH2/H∞control of discrete-time stochastic systems are reviewed and studied. Secondly, two algorithms are proposed for the finite and infinite horizonH2/H∞control of continuous-time stochastic systems, respectively. Finally, several numerical examples are presented to show the effectiveness of the algorithms.

scholarly journals LQG control of linear lossless positive-real systems: the continuous-time and discrete-time cases

2021 ◽  
Author(s):  
Maide Bucolo ◽  
Arturo Buscarino ◽  
Luigi Fortuna ◽  
Mattia Frasca
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Linear Quadratic ◽  
Positive Real ◽  
Linear Quadratic Gaussian ◽  
Numerical Examples ◽  
Input And Output ◽  
Lqg Control ◽  
Optimal Gains

AbstractLossless positive-real systems have been widely studied in the literature. They are systems in which the energy is entirely transferred between input and output. In this paper, new aspects related to the linear quadratic gaussian (LQG) control of lossless positive-real systems are reported including both the continuous-time and the discrete-time cases. Direct formulas for the calculation of the optimal gains will be introduced and the properties of the different structures of the LQG compensator obtained for the continuous-time and the discrete-time cases will be emphasized, also in view of designing positive-real LQG compensators. Numerical examples related to low-damped structures are also discussed to verify the possibility to design the LQG compensator on the basis of a lossless approximation.

Sign in / Sign up

Export Citation Format

Share Document