Scalable scheduling algorithms for wireless networked control systems

“© 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 20120213
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).

Weiss, G. (författare)
Alur, R. (författare)
Isaksson, A.J. (författare)
Johansson, Karl HenrikKTH,Reglerteknik,ACCESS Linnaeus Centre(Swepub:kth)u1h0d9k2 (författare)
Pappas, G. J. (författare)
KTHReglerteknik (creator_code:org_t)

Ingår i:2009 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING: IEEE, s. 409-4149781424445783

Av författaren/redakt...: D'Innocenzo, A.; Weiss, G.; Alur, R.; Isaksson, A.J.; Johansson, Karl ...; Pappas, G. J.

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Elektroteknik oc ...; och Reglerteknik

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.