Deliberation scheduling using GSMDPs in stochastic asynchronous domains

DOI10.1016/j.ijar.2009.04.007zbMath1191.68729OpenAlexW1997098593MaRDI QIDQ962948

Kurt D. Krebsbach

Publication date: 7 April 2010

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2009.04.007

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Related Items (1)

Special subclass of generalized semi-Markov decision processes with discrete time

Cites Work

• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• Principles of metareasoning
• Deliberation scheduling for problem solving in time-constrained environments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deliberation scheduling using GSMDPs in stochastic asynchronous domains