Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |

marchand98e

H. Marchand, O. Boivineau, S. Lafortune. On the Synthesis of Optimal Schedulers in Discrete Event Control Problems with Multiple Goals. Research Report CGR-98-10, Control Group, College of Engineering, Univeristy of Michigan, USA, July 1998.

Download [help]

Download paper: Adobe portable document (pdf) pdf

Copyright notice: This 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 page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic

Abstract

This paper deals with a new type of optimal control for Discrete Event Systems. Our control problem extends the theory of \cite{sengupta98}, that is characterized by the presence of uncontrollable events, the notion of occurrence and control costs for events, and a worst-case objective function. A significant difference with the work in \cite{sengupta98} is that our aim is to make the system evolve through a set of multiple goals, one by one, with no order necessarily pre-specified, whereas the previous theory only deals with a single goal. Our solution approach is divided into two steps. In the first step, we use the optimal control theory in \cite{sengupta98} to synthesize individual controllers for each goal. In the second step, we develop the solution of another optimal control problem, namely, how to modify if necessary and piece together, or schedule, all of the controllers built in the first step in order to visit each 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 well-known Traveling Salesman Problem (TSP). We finally suggest various strategies to reduce the complexity of the TSP resolution while still preserving global optimality.
Keywords: Discrete Event Systems, Optimal Control, Scheduler, Traveling Salesman Problem

Contact

Hervé Marchand http://www.irisa.fr/prive/hmarchan

BibTex Reference

@TechReport{marchand98e,
   Author = {Marchand, H. and Boivineau, O. and Lafortune, S.},
   Title = {On the Synthesis of Optimal Schedulers in Discrete Event Control Problems with Multiple Goals},
   Institution = {CGR-98-10, Control Group, College of Engineering, Univeristy of Michigan, USA},
   Month = {July},
   Year = {1998}
}

EndNote Reference [help]

Get EndNote Reference (.ref)

| VerTeCs | Team | Publications | New Results | Softwares |
Irisa - Inria - Copyright 2005 © Projet VerTeCs