Mean Payoff Optimization for Systems of Periodic Service and Maintenance

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F23%3A00131517" target="_blank" >RIV/00216224:14330/23:00131517 - isvavai.cz</a>

Result on the web

<a href="https://www.ijcai.org/proceedings/2023/598" target="_blank" >https://www.ijcai.org/proceedings/2023/598</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.24963/ijcai.2023/598" target="_blank" >10.24963/ijcai.2023/598</a>

Result language

angličtina

Original language name

Mean Payoff Optimization for Systems of Periodic Service and Maintenance

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA21-24711S" target="_blank" >GA21-24711S: Efficient Analysis and Optimization for Probabilistic Systems and Games</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2023

Confidentiality

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

Article name in the collection

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023,

ISBN

9781956792034

ISSN

1045-0823

e-ISSN

—

Number of pages

8

Pages from-to

5386-5393

Publisher name

International Joint Conferences on Artificial Intelligence

Place of publication

Neuveden

Event location

Macao

Event date

Jan 1, 2023

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—