Deterministic and Stochastic Fixed-Time Stability of Discrete-time Autonomous Systems

This paper studies deterministic and stochastic fixedtime stability of autonomous nonlinear discrete-time(DT)systems.Lyapunov conditions are first presented under which the fixed-time stability of deterministic DT systems is certified.Extensions to systems under deterministic perturbations as well as stochastic noise are then considered.For the former,sensitivity to perturbations for fixed-time stable DT systems is analyzed,and it is shown that fixed-time attractiveness results from the presented Lyapunov conditions.For the latter,sufficient Lyapunov conditions for fixed-time stability in probability of nonlinear stochastic DT systems are presented.The fixed upper bound of the settling-time function is derived for both fixed-time stable and fixed-time attractive systems,and a stochastic settling-time function fixed upper bound is derived for stochastic DT systems.Illustrative examples are given along with simulation results to verify the introduced results.

Event-Triggered Finite-Time H∞ Filtering for Discrete-Time Nonlinear Stochastic Systems

This paper addresses the problem of event-triggered finite-time H∞ filter design for a class of discrete-time nonlinear stochastic systems with exogenous disturbances. The stochastic Lyapunov-Krasoviskii functional method is adopted to design a filter such that the filtering error system is stochastic finite-time stable (SFTS) and preserves a prescribed performance level according to the pre-defined event-triggered criteria. Based on stochastic differential equations theory, some sufficient conditions for the existence of H∞ filter are obtained for the suggested system by employing linear matrix inequality technique. Finally, the desired H∞ filter gain matrices can be expressed in an explicit form.

A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue

We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the transient distributions of the system length and of the system waiting time in a simple and unified manner. From these distributions, important performance measures of practical interest can be easily obtained. Numerical examples concerning the superposition of certain video traffics are presented at the end.

A Maintenance Service Improvement Approach Based on Queue Networks: Application

The quest to increase the performance of production systems that have become complex leads to the transfer to the maintenance function of the responsibility of guaranteeing the availability of such systems. Also, we will never stop saying that maintenance must integrate into all of the company’s initiatives, to affirm its role, which is to ensure greater availability and sustainability of the means of production. The objective of this paper is to evaluate the reliability and availability of a system without knowing the distribution law of the operating times. Among the methods for evaluating dependability criteria (Fault Trees, Petri Nets, etc.), we are interested in queues that have the advantage of taking into account functional dependencies, thus allowing a quantified optimization of maintenance. Indeed, queues make it possible to model parallel or sequential processes, implementing operations taking place at the same time or one after the other, meeting the needs of modeling production systems. The main result of this paper is the study of the influence of availability on the reliability of a multi-state production system.

LMI Consensus Condition for Discrete-time Multi-agent Systems

This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.

Decentralized H-infinity state feedback control for discrete-time singular large-scale systems

The decentralized H-infinity control problem for discrete-time singular large-scale systems is considered. Based on the bounded real lemma of discrete-time singular systems, a sufficient condition for the existence of decentralized H-infinity controller for discrete-time singular large-scale systems is presented in terms of the solvability to a certain system of linear matrix inequalities by linear matrix inequality (LMI) approach, and the feasible solutions to the system of LMIs provide a parameterized representation of a set of decentralized H-infinity controller. The given example shows the application of the method.

Suboptimal Robust Stabilization of Discrete-time Mismatched Nonlinear System

This paper proposes a discrete-time robust control technique for an uncertain nonlinear system. The uncertainty mainly affects the system dynamics due to mismatched parameter variation which is bounded by a predefined known function. In order to compensate the effect of uncertainty, a robust control input is derived by formulating an equivalent optimal control problem for a virtual nominal system with a modified costfunctional. To derive the stabilizing control law for a mismatched system, this paper introduces another control input named as virtual input. This virtual input is not applied directly to stabilize the uncertain system, rather it is used to define a sufficient condition. To solve the nonlinear optimal control problem, a discretetime general Hamilton-Jacobi-Bellman(DT-GHJB) equation is considered and it is approximated numerically through a neural network(NN) implementation. The approximated solution of DTGHJB is used to compute the suboptimal control input for the virtual system. The suboptimal inputs for the virtual system ensure the asymptotic stability of the closed-loop uncertain system. A numerical example is illustrated with simulation results to prove the efficacy of the proposed control algorithm.

A Discrete-Time Traffic and Topology Adaptive Routing Algorithm for LEO Satellite Networks

“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.

Leader-following consensus of discrete-time fractional-order multi-agent systems

Leader-following consensus of fractional order multi-agent systems is investigated. The agents are considered as discrete-time fractional order integrators or fractional order double-integrators. Moreover, the interaction between the agents is described with an undirected communication graph with a fixed topology. It is shown that the leader-following consensus problem for the considered agents could be converted to the asymptotic stability analysis of a discrete-time fractional order system. Based on this idea, sufficient conditions to reach the leader-following consensus in terms of the controller parameters are extracted. This leads to an appropriate region in the controller parameters space. Numerical simulations are provided to show the performance of the proposed leader-following consensus approach.

Global Practical Stabilization of Discrete-Time Switched Affine Systems via a General Quadratic Lyapunov Function and a Decentralized Ellipsoid

This paper addresses the problem of global practical stabilization of discrete-time switched affine systems via statedependent switching rules.Several attempts have been made to solve this problem via different types of a common quadratic Lyapunov function and an ellipsoid.These classical results require either the quadratic Lyapunov function or the employed ellipsoid to be of the centralized type.In some cases,the ellipsoids are defined dependently as the level sets of a decentralized Lyapunov function.In this paper,we extend the existing results by the simultaneous use of a general decentralized Lyapunov function and a decentralized ellipsoid parameterized independently.The proposed conditions provide less conservative results than existing works in the sense of the ultimate invariant set of attraction size.Two different approaches are proposed to extract the ultimate invariant set of attraction with a minimum size,i.e.,a purely numerical method and a numerical-analytical one.In the former,both invariant and attractiveness conditions are imposed to extract the final set of matrix inequalities.The latter is established on a principle that the attractiveness of a set implies its invariance.Thus,the stability conditions are derived based on only the attractiveness property as a set of matrix inequalities with a smaller dimension.Illustrative examples are presented to prove the satisfactory operation of the proposed stabilization methods.

Distributed Fault Detection for Consensus in Second-Order Discrete-Time Multiagent Systems with Adversary

This paper is concerned with distributed fault detection of second-order discrete-time multi-agent systems with adversary,where the adversary is regarded as a slowly time-varying signal.Firstly,a novel intrusion detection scheme based on the theory of unknown input observability( UIO) is proposed. By constructing a bank of UIO,the states of the malicious agents can be directly estimated. Secondly,the faulty-node-removal algorithm is provided.Simulations are also provided to demonstrate the effectiveness of the theoretical results.

Robust Sliding Mode Control for Nonlinear Discrete-Time Delayed Systems Based on Neural Network

This paper presents a robust sliding mode controller for a class of unknown nonlinear discrete-time systems in the presence of fixed time delay. A neural-network approximation and the Lyapunov-Krasovskii functional theory into the sliding-mode technique is used and a neural-network based sliding mode control scheme is proposed. Because of the novality of Chebyshev Neural Networks (CNNs), that it requires much less computation time as compare to multi layer neural network (MLNN), is preferred to approximate the unknown system functions. By means of linear matrix inequalities, a sufficient condition is derived to ensure the asymptotic stability such that the sliding mode dynamics is restricted to the defined sliding surface. The proposed sliding mode control technique guarantees the system state trajectory to the designed sliding surface. Finally, simulation results illustrate the main characteristics and performance of the proposed approach.

Stabilization of Unknown Nonlinear Discrete-Time Delay Systems Based on Neural Network

This paper discusses about the stabilization of unknown nonlinear discrete-time fixed state delay systems. The unknown system nonlinearity is approximated by Chebyshev neural network (CNN), and weight update law is presented for approximating the system nonlinearity. Using appropriate Lyapunov-Krasovskii functional the stability of the nonlinear system is ensured by the solution of linear matrix inequalities. Finally, a relevant example is given to illustrate the effectiveness of the proposed control scheme.

V-uniform ergodicity for fluid queues

In this paper, we show that a positive recurrent ?uid queue is automatically V-uniformly ergodic for some function V ≥ 1 but never uniformly ergodic. This reveals a similarity of ergodicity between a ?uid queue and a quasi-birth-and-death process. As a byproduct of V-uniform ergodicity, we derive computable bounds on the exponential moments of the busy period.

A Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units

We study a vacation queueing system with a single server simultaneously dealing with an M/G/1 and an M/D/1 queue. Two classes of units, priority and non-priority, arrive at the system in two independent Poisson streams. Under a non-preemptive priority rule, the server provides a general service to the priority units and a deterministic service to the non-priority units. We further assume that the server may take a vacation of random length just after serving the last priority unit present in the system. We obtain steady state queue size distribution at a random epoch. Corresponding results for some special cases, including the known results of the M/G/1 and the M/D/1 queues, have been derived.

OUTPUT REGULATION OF THE GENERAL NONLINEARDISCRETE-TIME SYSTEM

With the use of centre manifold and dynamic system theory, the necessary and sufficient conditions are obtained for the solvabilities of the output regulator problems for the general nonlinear discrete-time system. This work generalizes and refines the corresponding results ac Isidori and Byrnes on the affine nonlinear continuous-time system.

Reduced-Order Observer-Based Leader-Following Formation Control for Discrete-Time Linear Multi-Agent Systems

Formation control of discrete-time linear multi-agent systems using directed switching topology is considered in this work via a reduced-order observer, in which a formation control protocol is proposed under the assumption that each directed communication topology has a directed spanning tree. By utilizing the relative outputs of neighboring agents, a reduced-order observer is designed for each following agent. A multi-step control algorithm is established based on the Lyapunov method and the modified discrete-time algebraic Riccati equation. A sufficient condition is given to ensure that the discrete-time linear multi-agent system can achieve the expected leader-following formation.Finally, numerical examples are provided so as to demonstrate the effectiveness of the obtained results.

Basic Limit Theorems for Light Traffic Queues &Their Applications

In this paper, we study some basic limit theorems characterizing the stationary behavior of light traffic queuing systems. Beginning with limit theorems for the simple M/M/1 queuing system, we demonstrate the methodology for applying these theorems for the benefit of service systems. The limit theorems studied here are dominant in the literature. Our contribution is primarily on the analysis leading to the application of these theorems in various problem situations for better operations. Relevant Examples are included to aid the application of the results studied in this work.

STATIONARITY OF A CLASS OF LARGE-SCALE DISCRETE-TIME STOCHASTIC SYSTEMS

Stationarity of a class of stochastically interconnecteil discrete-timesystems is analyzed by utilizins results from ergodic theory of general stateMarkov chains, incorporated with the so called large-scale system approach.

Effect of Parameters on Geoa/Geob/1 Queues: Theoretical Analysis and Simulation Results

This paper analyzes a discrete-time Geoa/Geob/1 queuing system with batch arrivals of fixed size a, and batch services of fixed size b. Both arrivals and services occur randomly following a geometric distribution. The steady-state queue length distribution is obtained as the solution of a system of difference equations. Necessary and sufficient conditions are given for the system to be stationary. Besides, the uniqueness of the root of the characteristic polynomial in the interval (0, 1) is proven which is the only root needed for the computation of the theoretical solution with the proposed procedure. The theoretical results are compared with the ones observed in some simulations of the queuing system under different sets of parameters. The agreement of the results encourages the use of simulation for more complex systems. Finally, we explore the effect of parameters on the mean length of the queue as well as on the mean waiting time.