Optimizing expectation with guarantees in POMDPs
A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Re...
Saved in:
Main Authors: | CHATTERJEE, Krishnendu, PEREZ, Guillermo A., RASKIN, Jean-François, ZIKELIC, Dorde |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9071 https://ink.library.smu.edu.sg/context/sis_research/article/10074/viewcontent/11046_13_14574_1_2_20201228.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Solving long-run average reward robust MDPs via stochastic games
by: CHATTERJEE, Krishnendu, et al.
Published: (2024) -
Anytime Planning for Decentralized POMDPs using Expectation Maximization
by: KUMAR, Akshat, et al.
Published: (2010) -
Sound and complete witnesses for template-based verification of LTL properties on polynomial programs
by: CHATTERJEE, Krishnendu, et al.
Published: (2024) -
Networked Distributed POMDPs: A Synthesis of Distributed Constraint Optimization and POMDPs
by: NAIR, Ranjit, et al.
Published: (2005) -
Automated Generation of Interaction Graphs for Value-Factored Decentralized POMDPs
by: YEOH, William, et al.
Published: (2013)