Abstract
This paper studies optimal time-bounded control in a simple subclass of linear hybrid systems, which consists of one continuous variable and global constraints. Each state has a continuous cost attached to it, which is linear in the sojourn time, while a discrete cost is attached to each transition taken. We show the corresponding decision problem to be NP-complete and develop an FPTAS for finding an approximate solution. We have implemented a small prototype to compare the performance of these approximate and precise algorithms for this problem. Our results indicate that the proposed approximation schemes scale. Furthermore, we show that the same problem with infinite time horizon is in LOGSPACE.
Original language | English |
---|---|
Title of host publication | 23rd International Symposium on Temporal Representation and Reasoning 2016 |
Editors | Curtis Dyreson, Michael R. Hansen, Luke Hunsberger |
Publisher | IEEE |
Pages | 12-20 |
Number of pages | 9 |
ISBN (Electronic) | 9781509038251 |
DOIs | |
Publication status | Published - 8 Dec 2016 |
Event | 23rd International Symposium on Temporal Representation and Reasoning, TIME 2016 - Kongens Lyngby, Denmark Duration: 17 Oct 2016 → 19 Oct 2016 |
Conference
Conference | 23rd International Symposium on Temporal Representation and Reasoning, TIME 2016 |
---|---|
Country/Territory | Denmark |
City | Kongens Lyngby |
Period | 17/10/16 → 19/10/16 |
Keywords
- approximation algorithms
- linear hybrid automata
- optimal control
ASJC Scopus subject areas
- General Mathematics