Minimizing Running Costs in Consumption Systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F14%3A00074098" target="_blank" >RIV/00216224:14330/14:00074098 - isvavai.cz</a>
Result on the web
<a href="http://arxiv.org/abs/1402.4995" target="_blank" >http://arxiv.org/abs/1402.4995</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-08867-9_30" target="_blank" >10.1007/978-3-319-08867-9_30</a>

Result language
angličtina
Original language name
Minimizing Running Costs in Consumption Systems
Original language description
A standard approach to optimizing long-run running costs of discrete systems is based on minimizing the mean-payoff, i.e., the long-run average amount of resources ("energy") consumed per transition. However, this approach inherently assumes that the energy source has an unbounded capacity, which is not always realistic. For example, an autonomous robotic device has a battery of finite capacity that has to be recharged periodically, and the total amount of energy consumed between two successive chargingcycles is bounded by the capacity. Hence, a controller minimizing the mean-payoff must obey this restriction. In this paper we study the controller synthesis problem for consumption systems with a finite battery capacity, where the task of the controller is to minimize the mean-payoff while preserving the functionality of the system encoded by a given linear-time property.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F10%2F1469" target="_blank" >GAP202/10/1469: Formal methods for analysis and verification of complex systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)