TY - GEN
T1 - Minimising Makespan of Discrete Controllers
T2 - 58th IEEE Conference on Decision and Control, CDC 2019
AU - Castellano, Ezequiel
AU - Braberman, Victor
AU - D'Ippolito, Nicolas
AU - Uchitel, Sebastian
AU - Tei, Kenji
N1 - Funding Information:
The research was partially supported by National Institute of Information and Communications Technology (NICT) and JSPS KAKENHI. We would also like to thank Linguang Qiu and Rodrigo Castaño for their valuable feedback.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/12
Y1 - 2019/12
N2 - Qualitative controller synthesis techniques produce controllers that guarantee to achieve a given goal in the presence of an adversarial environment. However, qualitative synthesis only produces one controller out of many possible solutions and typically does not provide support for expressing preferences over other alternatives. In this paper, we thus present a formal approach to reason about preferences qualitatively, restricting attention to makespan of discrete eventbased controllers for reachability goals. Time is reasoned upon symbolically, which relieves the user from providing concrete quantitative measures. In particular, we study the scenario in which durations of individual activities are not known up-front. We first show how controllers can be symbolically and fairly compared by fixing the contingencies. Then, we present an algorithm to produce controllers that are makespan-minimising.
AB - Qualitative controller synthesis techniques produce controllers that guarantee to achieve a given goal in the presence of an adversarial environment. However, qualitative synthesis only produces one controller out of many possible solutions and typically does not provide support for expressing preferences over other alternatives. In this paper, we thus present a formal approach to reason about preferences qualitatively, restricting attention to makespan of discrete eventbased controllers for reachability goals. Time is reasoned upon symbolically, which relieves the user from providing concrete quantitative measures. In particular, we study the scenario in which durations of individual activities are not known up-front. We first show how controllers can be symbolically and fairly compared by fixing the contingencies. Then, we present an algorithm to produce controllers that are makespan-minimising.
UR - http://www.scopus.com/inward/record.url?scp=85082458395&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85082458395&partnerID=8YFLogxK
U2 - 10.1109/CDC40024.2019.9029766
DO - 10.1109/CDC40024.2019.9029766
M3 - Conference contribution
AN - SCOPUS:85082458395
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 1068
EP - 1075
BT - 2019 IEEE 58th Conference on Decision and Control, CDC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 11 December 2019 through 13 December 2019
ER -