BRÁZDIL, Tomáš, Petr NOVOTNÝ, Krishnendu CHATTERJEE, Martin CHMELÍK and Anchit GUPTA. Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. Singapur: ACM. p. 1465-1466. ISBN 978-1-4503-4239-1. 2016.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract)
Authors BRÁZDIL, Tomáš (203 Czech Republic, guarantor, belonging to the institution), Petr NOVOTNÝ (203 Czech Republic), Krishnendu CHATTERJEE (356 India), Martin CHMELÍK (203 Czech Republic) and Anchit GUPTA (356 India).
Edition Singapur, Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, p. 1465-1466, 2 pp. 2016.
Publisher ACM
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 printed version "print"
RIV identification code RIV/00216224:14330/16:00088501
Organization unit Faculty of Informatics
ISBN 978-1-4503-4239-1
UT WoS 000465199800247
Keywords in English POMDP; planning; energy constraints; decision trees
Tags formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 13/5/2020 19:34.
Abstract
We extend the traditional framework of POMDPs to model resource consumption inducing a hard constraint on the behaviour of the model. Resource levels increase and decrease with transitions, and the hard constraint requires that the level remains positive in all steps. We present an algorithm for solving POMDPs with resource levels, developing on existing POMDP solvers. Our second contribution is related to policy representation. For larger POMDPs the policies computed by existing solvers are too large to be understandable, an issue particularly pronounced in POMDPs with resource levels. We present a procedure based on machine learning techniques that extracts important decisions of a policy and outputs its readable representation.
Links
GBP202/12/G061, research and development projectName: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)
Investor: Czech Science Foundation
PrintDisplayed: 23/4/2024 10:08