Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Concise Introduction to Models and Methods for Automated PlanningMDP Planning: Stochastic Actions and Full Feedback

A Concise Introduction to Models and Methods for Automated Planning: MDP Planning: Stochastic... [Markov Decision Processes (MDPs) generalize the model underlying classical planning by allowing actions with stochastic effects and fully observable states. In this chapter, we look at a variety of MDP models and the basic algorithms for solving them: from offline methods based on dynamic programming and heuristic search, to online methods where the action to do next is obtained by solving simplifications, like finite-horizon versions of the problem or deterministic relaxations.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Concise Introduction to Models and Methods for Automated PlanningMDP Planning: Stochastic Actions and Full Feedback

Download PDF
17 pages

Loading next page...
 
/lp/springer-journals/a-concise-introduction-to-models-and-methods-for-automated-planning-xalEQo9iG2

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer International Publishing
Copyright
© Springer Nature Switzerland AG 2013
ISBN
978-3-031-00436-0
Pages
79 –96
DOI
10.1007/978-3-031-01564-9_6
Publisher site
See Chapter on Publisher Site

Abstract

[Markov Decision Processes (MDPs) generalize the model underlying classical planning by allowing actions with stochastic effects and fully observable states. In this chapter, we look at a variety of MDP models and the basic algorithms for solving them: from offline methods based on dynamic programming and heuristic search, to online methods where the action to do next is obtained by solving simplifications, like finite-horizon versions of the problem or deterministic relaxations.]

Published: Jan 1, 2013

There are no references for this article.