A probabilistic algorithm for scheduling networked control systems under data losses
Anubhab Dasgupta, Darsana Udayakumar, Atreyee Kundu

TL;DR
This paper introduces a probabilistic scheduling algorithm for networked control systems with limited capacity and data losses, ensuring stochastic stability through specific controller and network design conditions.
Contribution
It presents a novel probabilistic algorithm for scheduling in NCSs that guarantees stability under data loss conditions, along with controller design guidelines.
Findings
The algorithm ensures stochastic stability under certain conditions.
Numerical examples validate the effectiveness of the proposed method.
Design guidelines for controllers are provided for stability assurance.
Abstract
This paper deals with the design of scheduling logics for networked control systems (NCSs) whose communication networks have limited capacity and are prone to data losses. Our contributions are twofold. First, we present a probabilistic algorithm to generate a scheduling logic that under certain conditions on the plant and the controller dynamics, the capacity of the network and the probability of data losses, ensures stochastic stability of each plant in the NCS. Second, given the plant dynamics, the capacity of the shared communication network and the probability of data losses, we discuss the design of state-feedback controllers such that our stability conditions are obeyed. Numerical examples are presented to demonstrate the results reported in this paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetri Nets in System Modeling · Formal Methods in Verification · Gene Regulatory Network Analysis
