@inproceedings{a694ee49cff54fab9be77d08adafdccf,

title = "Computing schedules for time-triggered control using genetic algorithms",

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.",

keywords = "Digital control, Genetic algorithms, Scheduling",

author = "Truong Nghiem and Georgios Fainekos",

year = "2011",

doi = "10.3182/20110828-6-IT-1002.01640",

language = "English (US)",

isbn = "9783902661937",

series = "IFAC Proceedings Volumes (IFAC-PapersOnline)",

publisher = "IFAC Secretariat",

number = "1 PART 1",

pages = "794--799",

booktitle = "Proceedings of the 18th IFAC World Congress",

edition = "1 PART 1",

}