48,048 research outputs found
Anytime Control using Input Sequences with Markovian Processor Availability
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
Stability analysis of event-triggered anytime control with multiple control laws
To deal with time-varying processor availability and lossy communication
channels in embedded and networked control systems, one can employ an
event-triggered sequence-based anytime control (E-SAC) algorithm. The main idea
of E-SAC is, when computing resources and measurements are available, to
compute a sequence of tentative control inputs and store them in a buffer for
potential future use. State-dependent Random-time Drift (SRD) approach is often
used to analyse and establish stability properties of such E-SAC algorithms.
However, using SRD, the analysis quickly becomes combinatoric and hence
difficult to extend to more sophisticated E-SAC. In this technical note, we
develop a general model and a new stability analysis for E-SAC based on Markov
jump systems. Using the new stability analysis, stochastic stability conditions
of existing E-SAC are also recovered. In addition, the proposed technique
systematically extends to a more sophisticated E-SAC scheme for which, until
now, no analytical expression had been obtained.Comment: Accepted for publication in IEEE Transactions on Automatic Contro
Stochastic Stability of Event-triggered Anytime Control
We investigate control of a non-linear process when communication and
processing capabilities are limited. The sensor communicates with a controller
node through an erasure channel which introduces i.i.d. packet dropouts.
Processor availability for control is random and, at times, insufficient to
calculate plant inputs. To make efficient use of communication and processing
resources, the sensor only transmits when the plant state lies outside a
bounded target set. Control calculations are triggered by the received data. If
a plant state measurement is successfully received and while the processor is
available for control, the algorithm recursively calculates a sequence of
tentative plant inputs, which are stored in a buffer for potential future use.
This safeguards for time-steps when the processor is unavailable for control.
We derive sufficient conditions on system parameters for stochastic stability
of the closed loop and illustrate performance gains through numerical studies.Comment: IEEE Transactions on Automatic Control, under revie
Sequence-based Anytime Control
We present two related anytime algorithms for control of nonlinear systems
when the processing resources available are time-varying. The basic idea is to
calculate tentative control input sequences for as many time steps into the
future as allowed by the available processing resources at every time step.
This serves to compensate for the time steps when the processor is not
available to perform any control calculations. Using a stochastic Lyapunov
function based approach, we analyze the stability of the resulting closed loop
system for the cases when the processor availability can be modeled as an
independent and identically distributed sequence and via an underlying Markov
chain. Numerical simulations indicate that the increase in performance due to
the proposed algorithms can be significant.Comment: 14 page
CROSS-STACK PREDICTIVE CONTROL FRAMEWORK FOR MULTICORE REAL-TIME APPLICATIONS
Many of the next generation applications in entertainment, human computer interaction, infrastructure, security and medical systems are computationally intensive, always-on, and have soft real time (SRT) requirements. While failure to meet deadlines is not catastrophic in SRT systems, missing deadlines can result in an unacceptable degradation in the quality of service (QoS). To ensure acceptable QoS under dynamically changing operating conditions such as changes in the workload, energy availability, and thermal constraints, systems are typically designed for worst case conditions. Unfortunately, such over-designing of systems increases costs and overall power consumption.
In this dissertation we formulate the real-time task execution as a Multiple-Input, Single- Output (MISO) optimal control problem involving tracking a desired system utilization set point with control inputs derived from across the computing stack. We assume that an arbitrary number of SRT tasks may join and leave the system at arbitrary times. The tasks are scheduled on multiple cores by a dynamic priority multiprocessor scheduling algorithm. We use a model predictive controller (MPC) to realize optimal control. MPCs are easy to tune, can handle multiple control variables, and constraints on both the dependent and independent variables. We experimentally demonstrate the operation of our controller on a video encoder application and a computer vision application executing on a dual socket quadcore Xeon processor with a total of 8 processing cores. We establish that the use of DVFS and application quality as control variables enables operation at a lower power op- erating point while meeting real-time constraints as compared to non cross-stack control approaches. We also evaluate the role of scheduling algorithms in the control of homo- geneous and heterogeneous workloads. Additionally, we propose a novel adaptive control technique for time-varying workloads
Speculative Thread Framework for Transient Management and Bumpless Transfer in Reconfigurable Digital Filters
There are many methods developed to mitigate transients induced when abruptly
changing dynamic algorithms such as those found in digital filters or
controllers. These "bumpless transfer" methods have a computational burden to
them and take time to implement, causing a delay in the desired switching time.
This paper develops a method that automatically reconfigures the computational
resources in order to implement a transient management method without any delay
in switching times. The method spawns a speculative thread when it predicts if
a switch in algorithms is imminent so that the calculations are done prior to
the switch being made. The software framework is described and experimental
results are shown for a switching between filters in a filter bank.Comment: 6 pages, 7 figures, to be presented at American Controls Conference
201
Fuzzy Feedback Scheduling of Resource-Constrained Embedded Control Systems
The quality of control (QoC) of a resource-constrained embedded control
system may be jeopardized in dynamic environments with variable workload. This
gives rise to the increasing demand of co-design of control and scheduling. To
deal with uncertainties in resource availability, a fuzzy feedback scheduling
(FFS) scheme is proposed in this paper. Within the framework of feedback
scheduling, the sampling periods of control loops are dynamically adjusted
using the fuzzy control technique. The feedback scheduler provides QoC
guarantees in dynamic environments through maintaining the CPU utilization at a
desired level. The framework and design methodology of the proposed FFS scheme
are described in detail. A simplified mobile robot target tracking system is
investigated as a case study to demonstrate the effectiveness of the proposed
FFS scheme. The scheme is independent of task execution times, robust to
measurement noises, and easy to implement, while incurring only a small
overhead.Comment: To appear in International Journal of Innovative Computing,
Information and Contro
Advancements in real-time engine simulation technology
The approaches used to develop real-time engine simulations are reviewed. Both digital and hybrid (analog and digital) techniques are discussed and specific examples of each are cited. These approaches are assessed from the standpoint of their usefulness for digital engine control development. A number of NASA-sponsored simulation research activities, aimed at exploring real-time simulation techniques, are described. These include the development of a microcomputer-based, parallel processor system for real-time engine simulation
- …