53 research outputs found
Decentralized event-triggered control over wireless sensor/actuator networks
In recent years we have witnessed a move of the major industrial automation
providers into the wireless domain. While most of these companies already offer
wireless products for measurement and monitoring purposes, the ultimate goal is
to be able to close feedback loops over wireless networks interconnecting
sensors, computation devices, and actuators. In this paper we present a
decentralized event-triggered implementation, over sensor/actuator networks, of
centralized nonlinear controllers. Event-triggered control has been recently
proposed as an alternative to the more traditional periodic execution of
control tasks. In a typical event-triggered implementation, the control signals
are kept constant until the violation of a condition on the state of the plant
triggers the re-computation of the control signals. The possibility of reducing
the number of re-computations, and thus of transmissions, while guaranteeing
desired levels of performance makes event-triggered control very appealing in
the context of sensor/actuator networks. In these systems the communication
network is a shared resource and event-triggered implementations of control
laws offer a flexible way to reduce network utilization. Moreover reducing the
number of times that a feedback control law is executed implies a reduction in
transmissions and thus a reduction in energy expenditures of battery powered
wireless sensor nodes.Comment: 13 pages, 3 figures, journal submissio
Self-Triggered and Event-Triggered Set-Valued Observers
This paper addresses the problem of reducing the required network load and computational power for the implementation of Set-Valued Observers (SVOs) in Networked Control System (NCS). Event- and self-triggered strategies for NCS, modeled as discrete-time Linear Parameter-Varying (LPV) systems, are studied by showing how the triggering condition can be selected. The methodology provided can be applied to determine when it is required to perform a full (``classical'') computation of the SVOs, while providing low-complexity state overbounds for the remaining time, at the expenses of temporarily reducing the estimation accuracy. As part of the procedure, an algorithm is provided to compute a suitable centrally symmetric polytope that allows to find hyper-parallelepiped and ellipsoidal overbounds to the exact set-valued state estimates calculated by the SVOs. By construction, the proposed triggering techniques do not influence the convergence of the SVOs, as at some subsequent time instants, set-valued estimates are computed using the \emph{conventional} SVOs. Results are provided for the triggering frequency of the self-triggered strategy and two interesting cases: distributed systems when the dynamics of all nodes are equal up to a reordering of the matrix; and when the probability distribution of the parameters influencing the dynamics is known. The performance of the proposed algorithm is demonstrated in simulation by using a time-sensitive example
Towards Stabilization of Distributed Systems under Denial-of-Service
In this paper, we consider networked distributed systems in the presence of
Denial-of-Service (DoS) attacks, namely attacks that prevent transmissions over
the communication network. First, we consider a simple and typical scenario
where communication sequence is purely Round-robin and we explicitly calculate
a bound of attack frequency and duration, under which the interconnected
large-scale system is asymptotically stable. Second, trading-off system
resilience and communication load, we design a hybrid transmission strategy
consisting of Zeno-free distributed event-triggered control and Round-robin. We
show that with lower communication loads, the hybrid communication strategy
enables the systems to have the same resilience as in pure Round-robin
- …