Unknown input observer design for one-sided Lipschitz discrete-time systems subject to time-delay

In this paper, we address the problem of unknown input observer design, which simultaneously estimates state and unknown input, of a class of nonlinear discrete-time systems with time-delay. A novel approach to the state estimation problem of nonlinear systems where the nonlinearities satisfy the one-sided Lipschitz and quadratically inner-bounded conditions is proposed. This approach also allows us to reconstruct the unknown inputs of the systems. The nonlinear system is first transformed to a new system which can be decomposed into unknown-input-free and unknown-input-dependent subsystems. The estimation problem is then reduced to designing observer for the unknown-input-free subsystem. Rather than full-order observer design, in this paper, we propose observer design of reduced-order which is more practical and cost effective. By utilizing several mathematical techniques, the time-delay issue as well as the bilinear terms, which often emerge when designing observers for nonlinear discrete-time systems, are handled and less conservative observer synthesis conditions are derived in the linear matrix inequalities form. Two numerical examples are given to show the efficiency and high performance of our results.

Componentwise ultimate bounds for positive discrete time-delay systems perturbed by interval disturbances

This paper presents a method to derive componentwise ultimate upper bounds and componentwise ultimate lower bounds for linear positive systems with time-varying delays and bounded disturbances. The disturbance vector is assumed to vary within a known interval whose lower bound may be different from zero. We first derive a sufficient condition for the existence of componentwise ultimate bounds. This condition is given in terms of the spectral radius of the system matrices which is easy to check and allows us to compute directly both the smallest componentwise ultimate upper bound and the largest componentwise ultimate lower bound. Then, by using the comparison method, we extend the obtained result to a class of nonlinear time-delay systems which has linear positive bounds. Two numerical examples are given to illustrate the effectiveness of the obtained results.

Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: stability and moving-horizon approximations

Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak conditions on the cost function and the constraints are sufficient to guarantee uniform asymptotic stability of both the optimal infinite-horizon and movinghorizon feedback systems. The infinite-horizon cost associated with the moving-horizon feedback law approaches the optimal infinite-horizon cost as the moving horizon is extended.

Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey

This work is a survey of the average cost control problem for discrete-time Markov processes. The authors have attempted to put together a comprehensive account of the considerable research on this problem over the past three decades. The exposition ranges from finite to Borel state and action spaces and includes a variety of methodologies to find and characterize optimal policies. The authors have included a brief historical perspective of the research efforts in this area and have compiled a substantial yet not exhaustive bibliography. The authors have also identified several important questions that are still open to investigation.

Some algorithms for discrete time queues with finite capacity

We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals, Efficient algorithms are developed to calculate the moments and the distributions of the first time to overflow and the regeneration length, Results are extended to the multiserver queue. Some illustrative numerical examples are provided.

Performance analysis of a fluid queue with random service rate in discrete time

We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily fragmented. We provide conditions on finiteness of moments of stationary delay, its Laplace-Stieltjes transform and various approximations under heavy traffic. Results are extended to the case where the wireless link can transmit in only a few slots during a frame.