2,774 research outputs found
Design of State-based Schedulers for a Network of Control Loops
For a closed-loop system, which has a contention-based multiple access
network on its sensor link, the Medium Access Controller (MAC) may discard some
packets when the traffic on the link is high. We use a local state-based
scheduler to select a few critical data packets to send to the MAC. In this
paper, we analyze the impact of such a scheduler on the closed-loop system in
the presence of traffic, and show that there is a dual effect with state-based
scheduling. In general, this makes the optimal scheduler and controller hard to
find. However, by removing past controls from the scheduling criterion, we find
that certainty equivalence holds. This condition is related to the classical
result of Bar-Shalom and Tse, and it leads to the design of a scheduler with a
certainty equivalent controller. This design, however, does not result in an
equivalent system to the original problem, in the sense of Witsenhausen.
Computing the estimate is difficult, but can be simplified by introducing a
symmetry constraint on the scheduler. Based on these findings, we propose a
dual predictor architecture for the closed-loop system, which ensures
separation between scheduler, observer and controller. We present an example of
this architecture, which illustrates a network-aware event-triggering
mechanism.Comment: 17 pages, technical repor
Neural Feedback Scheduling of Real-Time Control Tasks
Many embedded real-time control systems suffer from resource constraints and
dynamic workload variations. Although optimal feedback scheduling schemes are
in principle capable of maximizing the overall control performance of
multitasking control systems, most of them induce excessively large
computational overheads associated with the mathematical optimization routines
involved and hence are not directly applicable to practical systems. To
optimize the overall control performance while minimizing the overhead of
feedback scheduling, this paper proposes an efficient feedback scheduling
scheme based on feedforward neural networks. Using the optimal solutions
obtained offline by mathematical optimization methods, a back-propagation (BP)
neural network is designed to adapt online the sampling periods of concurrent
control tasks with respect to changes in computing resource availability.
Numerical simulation results show that the proposed scheme can reduce the
computational overhead significantly while delivering almost the same overall
control performance as compared to optimal feedback scheduling.Comment: To appear in International Journal of Innovative Computing,
Information and Contro
Cross-Layer Adaptive Feedback Scheduling of Wireless Control Systems
There is a trend towards using wireless technologies in networked control
systems. However, the adverse properties of the radio channels make it
difficult to design and implement control systems in wireless environments. To
attack the uncertainty in available communication resources in wireless control
systems closed over WLAN, a cross-layer adaptive feedback scheduling (CLAFS)
scheme is developed, which takes advantage of the co-design of control and
wireless communications. By exploiting cross-layer design, CLAFS adjusts the
sampling periods of control systems at the application layer based on
information about deadline miss ratio and transmission rate from the physical
layer. Within the framework of feedback scheduling, the control performance is
maximized through controlling the deadline miss ratio. Key design parameters of
the feedback scheduler are adapted to dynamic changes in the channel condition.
An event-driven invocation mechanism for the feedback scheduler is also
developed. Simulation results show that the proposed approach is efficient in
dealing with channel capacity variations and noise interference, thus providing
an enabling technology for control over WLAN.Comment: 17 pages, 12 figures; Open Access at
http://www.mdpi.org/sensors/papers/s8074265.pd
Real-time and fault tolerance in distributed control software
Closed loop control systems typically contain multitude of spatially distributed sensors and actuators operated simultaneously. So those systems are parallel and distributed in their essence. But mapping this parallelism onto the given distributed hardware architecture, brings in some additional requirements: safe multithreading, optimal process allocation, real-time scheduling of bus and network resources. Nowadays, fault tolerance methods and fast even online reconfiguration are becoming increasingly important. All those often conflicting requirements, make design and implementation of real-time distributed control systems an extremely difficult task, that requires substantial knowledge in several areas of control and computer science. Although many design methods have been proposed so far, none of them had succeeded to cover all important aspects of the problem at hand. [1] Continuous increase of production in embedded market, makes a simple and natural design methodology for real-time systems needed more then ever
Transient Reward Approximation for Continuous-Time Markov Chains
We are interested in the analysis of very large continuous-time Markov chains
(CTMCs) with many distinct rates. Such models arise naturally in the context of
reliability analysis, e.g., of computer network performability analysis, of
power grids, of computer virus vulnerability, and in the study of crowd
dynamics. We use abstraction techniques together with novel algorithms for the
computation of bounds on the expected final and accumulated rewards in
continuous-time Markov decision processes (CTMDPs). These ingredients are
combined in a partly symbolic and partly explicit (symblicit) analysis
approach. In particular, we circumvent the use of multi-terminal decision
diagrams, because the latter do not work well if facing a large number of
different rates. We demonstrate the practical applicability and efficiency of
the approach on two case studies.Comment: Accepted for publication in IEEE Transactions on Reliabilit
- …