Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Adobe portable document format (pdf)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This paper deals with a new type of optimal control for Discrete Event Systems that extends the theory of \cite{sengupta98}. Our aim is to make a system optimally evolve through a set of multiple goals, one by one, with no order necessarily pre-specified. Our method is divided into two steps. We first use the results in \cite{sengupta98} to synthesize individual optimal controllers for each goal. We then develop the solution of another optimal control problem, namely, how to adapt, if necessary, and schedule all of the controllers built in the first step in order to visit all of the goals with least total cost. We solve this problem by defining the notion of a scheduler and then by mapping the problem of finding an optimal scheduler to an instance of the Traveling Salesman Problem.
Keywords: Discrete Event Systems, Optimal Control, Scheduler, Traveling Salesman Problem.
Hervé Marchand
hmarchan@irisa.fr
@InProceedings{marchand98c,
Author = {Marchand, H. and Boivineau, O. and Lafortune, S.},
Title = {On the Synthesis of Optimal Schedulers in Discrete Event Control Problems with Multiple Goals},
BookTitle = {1998 IEEE International Conf. On Systems, Man, And Cybernetics},
Pages = {734--739},
Address = {San Diego, California, USA},
Month = {October},
Year = {1998}
}
Get EndNote Reference (.ref)