Planning and acting in partially observable stochastic domains
type: Item
instance of: scholarly article
published in: Artificial Intelligence
volume: 101
issue: 1-2
page(s): 99-134
publication date: 1998-05-01T00:00:00Z
publication date: 1999-01-12T00:00:00Z
author: Leslie Pack Kaelbling
author: Michael L. Littman
author: Anthony R. Cassandra
title: Planning and acting in partially observable stochastic domains
zbMATH Open document ID: 0908.68165
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1238304
zbMATH Keywords: planning
zbMATH Keywords: uncertainty
zbMATH Keywords: partially observable Markov decision processes
describes a project that uses: Graphplan
describes a project that uses: POMDPS
describes a project that uses: UCPOP
MaRDI profile type: Publication
Wikidata QID: Q56602944
cites work: Optimal control of Markov processes with incomplete state information
cites work: Q4368722
cites work: Fast planning through planning graph analysis
cites work: The complexity of stochastic games
cites work: The Optimal Search for a Moving Target When the Search Path Is Constrained
cites work: Q3266141
cites work: Q4845469
cites work: A survey of algorithmic methods for partially observed Markov decision processes
cites work: State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
cites work: Q4315289
cites work: OPTIMAL CONTROL FOR PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES OVER AN INFINITE HORIZON
cites work: Q3818127
cites work: The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
cites work: The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
cites work: Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
cites work: Application of Jensen's inequality to adaptive suboptimal design
cites work: A survey of solution techniques for the partially observed Markov decision process
cites work: Solution Procedures for Partially Observed Markov Decision Processes
cites work: The complexity of mean payoff games on graphs
full work available at URL: s0004-3702(98)00023-x
OpenAlex ID: W2168359464
DBLP publication ID: journals/ai/KaelblingLC98
DOI: 10.1016/S0004-3702(98)00023-X
Recommended article: Planning in partially-observable switching-mode continuous domains
Recommended article: Q3624110
Recommended article: Strong planning under partial observability
Recommended article: Learning and planning in partially observable environments without prior domain knowledge
Recommended article: Replanning in Domains with Partial Information and Sensing Actions
Recommended article: Randomized Belief-Space Replanning in Partially-Observable Continuous Spaces
description: scientific article; zbMATH DE number 1238304