Name
Title | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1515/auto-2020-0051 | AT-AUTOMATISIERUNGSTECHNIK |
Keywords | DocType | Volume |
timed event graphs,idempotent semirings,just-in-time control,min-plus algebra,resource sharing | Journal | 68 |
Issue | ISSN | Citations |
7 | 0178-2312 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Germano Schafaschek | 1 | 0 | 0.34 |
| Laurent Hardouin | 2 | 171 | 28.97 |
| Jörg Raisch | 3 | 390 | 58.45 |