Další formáty:
BibTeX
LaTeX
RIS
@article{2386722,
author = {Blahoudek, Fratišek and Novotný, Petr and Ornik, Melkior and Thangeda, Pranay and Topcu, Ufuk},
article_number = {8},
doi = {http://dx.doi.org/10.1109/TAC.2022.3209612},
keywords = {Consumption Markov decision process (CMDP); planning; resource constraints; strategy synthesis},
language = {eng},
issn = {0018-9286},
journal = {IEEE Transactions on Automatic Control},
title = {Efficient Strategy Synthesis for MDPs With Resource Constraints},
url = {https://ieeexplore.ieee.org/document/9903331},
volume = {68},
year = {2023}
}
TY - JOUR
ID - 2386722
AU - Blahoudek, Fratišek - Novotný, Petr - Ornik, Melkior - Thangeda, Pranay - Topcu, Ufuk
PY - 2023
TI - Efficient Strategy Synthesis for MDPs With Resource Constraints
JF - IEEE Transactions on Automatic Control
VL - 68
IS - 8
SP - 4586 - 4601
EP - 4586 - 4601
SN - 00189286
KW - Consumption Markov decision process (CMDP)
KW - planning
KW - resource constraints
KW - strategy synthesis
UR - https://ieeexplore.ieee.org/document/9903331
N2 - We consider qualitative strategy synthesis for the formalism called consumption Markov decision processes. This formalism can model the dynamics of an agent that operates under resource constraints in a stochastic environment. The presented algorithms work in time polynomial with respect to the representation of the model and they synthesize strategies ensuring that a given set of goal states will be reached (once or infinitely many times) with probability 1 without resource exhaustion. In particular, when the amount of resource becomes too low to safely continue in the mission, the strategy changes course of the agent toward one of a designated set of reload states where the agent replenishes the resource to full capacity; with a sufficient amount of resource, the agent attempts to fulfill the mission again. We also present two heuristics that attempt to reduce the expected time that the agent needs to fulfill the given mission, a parameter important in practical planning. The presented algorithms were implemented, and the numerical examples demonstrate the effectiveness (in terms of computation time) of the planning approach based on consumption Markov decision processes and the positive impact of the two heuristics on planning in a realistic example.
ER -
BLAHOUDEK, Fratišek, Petr NOVOTNÝ, Melkior ORNIK, Pranay THANGEDA a Ufuk TOPCU. Efficient Strategy Synthesis for MDPs With Resource Constraints. \textit{IEEE Transactions on Automatic Control}. 2023, roč.~68, č.~8, s.~4586 - 4601. ISSN~0018-9286. Dostupné z: https://dx.doi.org/10.1109/TAC.2022.3209612.
|
