Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

Optimal control of timed event graphs with resource sharing and output-reference update

Abstract : Timed event graphs (TEGs) are a subclass of timed Petri nets that model synchronization and delay phenomena, but not conflict or choice. We consider a scenario where a number of TEGs share one or several resources and are subject to changes in their output-reference signals. Because of resource sharing, the resulting overall discrete event system is not a TEG. We propose a formal method to determine the optimal control input for such systems, where optimality is in the sense of the widely adopted just-in-time criterion. Our approach is based on a prespecified priority policy for the TEG components of the overall system. It builds on existing control theory for TEGs, which exploits the fact that, in a suitable mathematical framework (idempotent semirings such as the max-plus or the min-plus algebra), the temporal evolution of TEGs can be described by a set of linear time-invariant equations.
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.univ-angers.fr/hal-02961755
Contributeur : Laurent Hardouin <>
Soumis le : jeudi 8 octobre 2020 - 16:34:36
Dernière modification le : mercredi 14 octobre 2020 - 04:24:55

Fichier

[2196677X - at - Automatisieru...
Fichiers éditeurs autorisés sur une archive ouverte

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Collections

Citation

Germano Schafaschek, Laurent Hardouin, Jörg Raisch. Optimal control of timed event graphs with resource sharing and output-reference update. Automatisierungstechnik, Oldenbourg Verlag, 2020, 68 (7), pp.512-528. ⟨10.1515/auto-2020-0051⟩. ⟨hal-02961755⟩

Partager

Métriques

Consultations de la notice

6

Téléchargements de fichiers

8