802 research outputs found

    Exploiting timing information in event-triggered stabilization of linear systems with disturbances

    Get PDF
    In the same way that subsequent pauses in spoken language are used to convey information, it is also possible to transmit information in communication networks not only by message content, but also with its timing. This paper presents an event-triggering strategy that utilizes timing information by transmitting in a state-dependent fashion. We consider the stabilization of a continuous-time, time-invariant, linear plant over a digital communication channel with bounded delay and subject to bounded plant disturbances and establish two main results. On the one hand, we design an encoding-decoding scheme that guarantees a sufficient information transmission rate for stabilization. On the other hand, we determine a lower bound on the information transmission rate necessary for stabilization by any control policy

    Data Rates Conditions for Network Control System Stabilization

    Get PDF
    In this paper we present sufficient conditions on the rate of a packet network to guarantee asymptotic stability of unstable discrete LTI system with linear state feedback control. Two types of network control systems are considered in the absence of communication delays. For one type we consider the case where we have invertible B matrix and the case where this does not occurred. Examples and simulations are provided to demonstrate the results

    Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey

    Get PDF
    This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

    Special arod system studies seventh quarterly report

    Get PDF
    Phase lock loop advanced circuits, and technical summary for Airborne Range and Orbit Determination /AROD/ syste

    Networked Control Under DoS Attacks:Tradeoffs Between Resilience and Data Rate

    Get PDF
    In this article, we study communication-constrained networked control problems for linear time-invariant systems in the presence of Denial-of-Service (DoS) attacks, namely attacks that prevent transmissions over the communication network. Our article aims at exploring the tradeoffs between system resilience and network bandwidth capacity. Given a class of DoS attacks, we characterize the bit-rate conditions that are dependent on the unstable eigenvalues of the dynamic matrix of the plant and the parameters of DoS attacks, under which exponential stability of the closed-loop system can be guaranteed. Our characterization clearly shows the tradeoffs between the communication bandwidth and resilience against DoS. An example is given to illustrate the proposed approach

    Stabilization of networked control systems via dynamic output-feedback controllers

    Get PDF
    This paper investigates the problem of stabilization of networked control systems via dynamic output-feedback controllers. The physical plant and the dynamic controller are in continuous time, and a communication channel exists between the output of the physical plant and the input of the dynamic controller. Three important communication features are considered: measurement quantization, signal transmission delay, and data packet dropout, which appear typically in a networked environment. Attention is focused on the design of dynamic output-feedback controllers which ensure asymptotic stability of the closed-loop systems. Linear matrix inequality (LMI)-based conditions are formulated for the existence of admissible controllers. If these conditions are satisfied, a desired controller can be readily constructed. A satellite system is used to illustrate the applicability and effectiveness of the proposed controller design method.published_or_final_versio

    Stabilizability of Markov jump linear systems modeling wireless networked control scenarios (extended version)

    Full text link
    The communication channels used to convey information between the components of wireless networked control systems (WNCSs) are subject to packet losses due to time-varying fading and interference. The WNCSs with missing packets can be modeled as Markov jump linear systems with one time-step delayed mode observations. While the problem of the optimal linear quadratic regulation for such systems has been already solved, we derive the necessary and sufficient conditions for stabilizability. We also show, with an example considering a communication channel model based on WirelessHART (a on-the-market wireless communication standard specifically designed for process automation), that such conditions are essential to the analysis of WNCSs where packet losses are modeled with Bernoulli random variables representing the expected value of the real random process governing the channel.Comment: Extended version of the paper accepted for the presentation at the 58th IEEE Conference on Decision and Control (CDC 2019

    Anytime Control using Input Sequences with Markovian Processor Availability

    Full text link
    We study an anytime control algorithm for situations where the processing resources available for control are time-varying in an a priori unknown fashion. Thus, at times, processing resources are insufficient to calculate control inputs. To address this issue, the algorithm calculates sequences of tentative future control inputs whenever possible, which are then buffered for possible future use. We assume that the processor availability is correlated so that the number of control inputs calculated at any time step is described by a Markov chain. Using a Lyapunov function based approach we derive sufficient conditions for stochastic stability of the closed loop.Comment: IEEE Transactions on Automatic Control, to be publishe

    Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes

    Get PDF
    Consider the following communication scenario. An encoder observes a stochastic process and causally decides when and what to transmit about it, under a constraint on bits transmitted per second. A decoder uses the received codewords to causally estimate the process in real time. The encoder and the decoder are synchronized in time. We aim to find the optimal encoding and decoding policies that minimize the end-to-end estimation mean-square error under the rate constraint. For a class of continuous Markov processes satisfying regularity conditions, we show that the optimal encoding policy transmits a 1-bit codeword once the process innovation passes one of two thresholds. The optimal decoder noiselessly recovers the last sample from the 1-bit codewords and codeword-generating time stamps, and uses it as the running estimate of the current process, until the next codeword arrives. In particular, we show the optimal causal code for the Ornstein-Uhlenbeck process and calculate its distortion-rate function
    corecore