KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. Mean Payoff Optimization for Systems of Periodic Service and Maintenance. Online. In Edith Elkind. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023,. Neuveden: International Joint Conferences on Artificial Intelligence, 2023, p. 5386-5393. ISBN 978-1-956792-03-4. Available from: https://dx.doi.org/10.24963/ijcai.2023/598.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Mean Payoff Optimization for Systems of Periodic Service and Maintenance
Authors KLAŠKA, David (203 Czech Republic, belonging to the institution), Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution), Vít MUSIL (203 Czech Republic, belonging to the institution) and Vojtěch ŘEHÁK (203 Czech Republic, belonging to the institution).
Edition Neuveden, Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, p. 5386-5393, 8 pp. 2023.
Publisher International Joint Conferences on Artificial Intelligence
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW Paper URL
RIV identification code RIV/00216224:14330/23:00131517
Organization unit Faculty of Informatics
ISBN 978-1-956792-03-4
ISSN 1045-0823
Doi http://dx.doi.org/10.24963/ijcai.2023/598
Keywords in English Periodic Maintenance; strategy synthesis
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 8/4/2024 15:45.
Abstract
Consider oriented graph nodes requiring periodic visits by a service agent. The agent moves among the nodes and receives a payoff for each completed service task, depending on the time elapsed since the previous visit to a node. We consider the problem of finding a suitable schedule for the agent to maximize its long-run average payoff per time unit. We show that the problem of constructing an epsilon-optimal schedule is PSPACE-hard for every fixed non-negative epsilon, and that there exists an optimal periodic schedule of exponential length. We propose randomized finite-memory (RFM) schedules as a compact description of the agent's strategies and design an efficient algorithm for constructing RFM schedules. Furthermore, we construct deterministic periodic schedules by sampling from RFM schedules.
Links
GA21-24711S, research and development projectName: Efektivní analýza a optimalizace pravděpodobnostních systémů a her (Acronym: Efektivní analýza a optimalizace pravděpodobnostní)
Investor: Czech Science Foundation
MUNI/A/1081/2022, interní kód MUName: Modelování, analýza a verifikace (2023)
Investor: Masaryk University
MUNI/A/1433/2022, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 23
Investor: Masaryk University
PrintDisplayed: 16/8/2024 09:31