Practical control of timed behaviours in industrial applications is difficult. One of the few efficient modelling approaches to deal with time constraints on discrete event systems is to use timed event graph (TEG), a subclass of Petri nets. The dynamic behaviour of these graphs is represented by a linear equations system over the max-plus algebra. Up to date, these models were assumed to be fully observable. In this paper, it is demonstrated that if a TEG is strongly connected, one can derive a realisable output feedback control. In other words, the control law depends solely on the control itself and the system’s outputs, considered to be the only observable events. The satisfaction of a set of constraints is addressed in the case of a single input model (i.e. having only one input transition) and the procedure to derive a realisable output feedback control law is provided. Finally, the present control method is applied to a dual-armed cluster tool, a well-known industrial practical application.
Unlike other fields of computing and communications, low-power wireless networking is plagued by one major issue: the absence of a well-defined, agreed-upon yardstick to compare the performance of systems, namely, a benchmark. We argue that this situation may eventually represent a hampering factor for a technology expected to be key in the Internet of Things (IoT) and Cyber-physical Systems (CPS). This paper describes a recent initiative to remedy this situation, seeking to enlarge the participation from the community.
16 November 2019 in ACM Transactions on Cyber-Physical Systems
Closing feedback loops fast and over long distances is key to emerging cyber-physical applications; for example, robot motion control and swarm coordination require update intervals of tens of milliseconds. Low-power wireless communication technology is preferred for its low cost, small form factor, and flexibility, especially if the devices support multi-hop communication. Thus far, however, feedback control over multi-hop low-power wireless networks has only been demonstrated for update intervals on the order of seconds. To fill this gap, this article presents a wireless embedded system that supports dynamic mode changes and tames imperfections impairing control performance (e.g., jitter and message loss), and a control design that exploits the essential properties of this system to provably guarantee closed-loop stability for physical processes with linear time-invariant dynamics in the presence of mode changes. Using experiments on a cyber-physical testbed with 20 wireless devices and multiple cart-pole systems, we are the first to demonstrate and evaluate feedback control and coordination with mode changes over multi-hop networks for update intervals of 20 to 50 milliseconds.
In cyber-physical systems (CPS), the communication among the sensing, actuating, and computing elements is often subject to hard real-time constraints. Real-time communication among wireless network interfaces and real-time scheduling for complex, dynamic applications have been intensively studied. Despite these major efforts, there is still a significant gap to fill. In particular, the integration of several real-time components to provide end-to-end real-time guarantees between interfaces of distributed applications in wireless CPS is an unsolved problem. We thus present a distributed protocol that considers the complete transmission chain including peripheral busses, memory accesses, networking interfaces, and the wireless real-time protocol. Our protocol provably guarantees that message buffers along this chain do not overflow and that all messages received at the destination application interface meet their end-to-end deadlines. To achieve this while being adaptive to unpredictable changes in the system and the real-time traffic requirements, our protocol establishes at run-time a set of contracts among all major elements of the transmission chain based on a worst-case delay and buffer analysis of the overall system. Using simulations, we validate that our analytic bounds are both safe and tight.
Today, networking hardware is not fast enough to save energy with rate adaptation. Or is it? While we are not (yet) able to turn on and off line cards in milliseconds, we can do so a couple of times per day. The question is, does it make sense to save energy? It may: We estimate we could potentially save in the order of MWh per year with link sleeping and down-rating in a cloud provider network. Importantly, these are "easy" gains: They would come without modifying the routing state nor impacting the quality of service of the traffic; it only leverages the typically low utilization of the links. This study provides only a rough approximation of the potential savings of rate adaptation and leaves several practical questions open. More than anything else, it motivates further investigation of the approach.