Name
Abstract | ||
|---|---|---|
In this work we employ hierarchy in order to greatly reduce the computational complexity for generating the optimal control for a discrete event system. Specifically, we propose a formal notion of equivalence we term cost equivalence that we use to generate an abstraction of a weighted automaton representing a supervisory controller. We demonstrate that this abstraction can be employed for planning, even in the presence of events that cannot be controlled. Furthermore, we propose additional requirements that we show guarantee that the plan generated from the abstracted automaton achieves optimal behavior when applied to the original unabstracted automaton. The results we generate in this paper have application to a broad class of graph-search problems. |
Year | Venue | Field |
|---|---|---|
2016 | 2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC) | Mathematical optimization,Control theory,Abstraction,Optimal control,Computer science,Supervisory control,Automaton,Equivalence (measure theory),Hierarchy,Computational complexity theory |
DocType | ISSN | Citations |
Conference | 0743-1546 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hill, R.C. | 1 | 3 | 2.51 |
| StéPhane Lafortune | 2 | 1738 | 181.23 |