Scalable scheduling algorithms for wireless networked control systems
2009 (English)In: 2009 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, IEEE , 2009, 409-414 p.Conference paper (Refereed)
In this paper, we address the problem of designing scalable scheduling and routing policies over a time-triggered multi-hop control network, when closing a considerable number of control loops on the same network. The key idea is to formally define by means of regular languages the set of schedules for each control loop that satisfy a given control specification, and to exploit operators on regular languages to compute the set of schedules for the whole system. In order to test our methodology, we address a mineral floatation control problem derived from the Boliden (a swedish mining company) mine in Garpenberg, and propose a scheduling solution that can be implemented on systems compliant with communication protocols for wireless networks (e.g. the WirelessHART specification).
Place, publisher, year, edition, pages
IEEE , 2009. 409-414 p.
IdentifiersURN: urn:nbn:se:kth:diva-80013DOI: 10.1109/COASE.2009.5234106ISI: 000276311700071ScopusID: 2-s2.0-70449116137ISBN: 978-1-4244-4578-3OAI: oai:DiVA.org:kth-80013DiVA: diva2:495927
2009 IEEE International Conference on Automation Science and Engineering, CASE 2009; Bangalore; 22 August 2009 through 25 August 2009
“© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”
QC 201202132012-02-132012-02-092012-02-13Bibliographically approved