Computing schedules for time-triggered control using genetic algorithms

Truong Nghiem, Georgios Fainekos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this work, we study the optimal scheduling problem for embedded control systems. Given a number of numerical computation tasks that must be executed on an embedded computer, the goal is to find a periodic schedule that minimizes the error of the implementation with respect to the ideal system. In this paper, we pose two open problems: the decidability of the optimal scheduling problem for timed-triggered controllers (OSTTC) and the time complexity of the corresponding bounded version of the problem. We conjecture that the former is undecidable and that the latter is NP-Complete. In view of the previous conjectures, we present a Genetic Algorithm (GA) for the OSTTC problem. Initial experimental results of GA-OSTTC are very promising when compared to random search and exhaustive bounded search.

Original languageEnglish (US)
Title of host publicationProceedings of the 18th IFAC World Congress
PublisherIFAC Secretariat
Pages794-799
Number of pages6
Edition1 PART 1
ISBN (Print)9783902661937
DOIs
StatePublished - Jan 1 2011

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number1 PART 1
Volume44
ISSN (Print)1474-6670

Keywords

  • Digital control
  • Genetic algorithms
  • Scheduling

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Computing schedules for time-triggered control using genetic algorithms'. Together they form a unique fingerprint.

  • Cite this

    Nghiem, T., & Fainekos, G. (2011). Computing schedules for time-triggered control using genetic algorithms. In Proceedings of the 18th IFAC World Congress (1 PART 1 ed., pp. 794-799). (IFAC Proceedings Volumes (IFAC-PapersOnline); Vol. 44, No. 1 PART 1). IFAC Secretariat. https://doi.org/10.3182/20110828-6-IT-1002.01640