Deliberation scheduling using GSMDPs in stochastic asynchronous domains

DOI10.1016/J.IJAR.2009.04.007MaRDI QIDQ962948zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 5547912
• Special subclass of generalized semi-Markov decision processes with discrete time
• scientific article; zbMATH DE number 2087251
• scientific article; zbMATH DE number 1958164
• OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success

Cites work

• scientific article; zbMATH DE number 4176499 (Why is no real title available?)
• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• scientific article; zbMATH DE number 1958164 (Why is no real title available?)
• scientific article; zbMATH DE number 3217463 (Why is no real title available?)
• scientific article; zbMATH DE number 3361677 (Why is no real title available?)
• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• Deliberation scheduling for problem solving in time-constrained environments
• Principles of metareasoning

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962948)