<--- Back to Details
First PageDocument Content
Cognitive science / Artificial intelligence / Automated planning and scheduling / Probability / Dynamic programming / Markov processes / Stochastic control / Reinforcement learning / Markov decision process / Motion planning / Action selection / Prior probability
Date: 2016-03-28 19:05:32
Cognitive science
Artificial intelligence
Automated planning and scheduling
Probability
Dynamic programming
Markov processes
Stochastic control
Reinforcement learning
Markov decision process
Motion planning
Action selection
Prior probability

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling Goal-Based Action Priors David Abel, D. Ellis Hershkowitz, Gabriel Barth-Maron, Stephen Brawner, Kevin O’Farrell, James Mac

Add to Reading List

Source URL: h2r.cs.brown.edu

Download Document from Source Website

File Size: 985,32 KB

Share Document on Facebook

Similar Documents

Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın Kuˇcera

Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın Kuˇcera

DocID: 1xW2m - View Document

Solvency Markov Decision Processes with Interest Tomáš Brázdil∗1 , Taolue Chen2 , Vojtěch Forejt†3 , Petr Novotný1 , and Aistis Simaitis3 1 2 3

Solvency Markov Decision Processes with Interest Tomáš Brázdil∗1 , Taolue Chen2 , Vojtěch Forejt†3 , Petr Novotný1 , and Aistis Simaitis3 1 2 3

DocID: 1xVLS - View Document

Specification Revision for Markov Decision Processes with Optimal Trade-off M. Lahijanian and M. Kwiatkowska Abstract— Optimal control policy synthesis for probabilistic systems from high-level specifications is increa

Specification Revision for Markov Decision Processes with Optimal Trade-off M. Lahijanian and M. Kwiatkowska Abstract— Optimal control policy synthesis for probabilistic systems from high-level specifications is increa

DocID: 1xVDa - View Document

Strategy Synthesis for Markov Decision Processes and Branching-Time Logics Tom´asˇ Br´azdil⋆ and Vojtˇech Forejt⋆⋆ Faculty of Informatics, Masaryk University, Botanick´a 68a, 60200 Brno, Czech Republic.

Strategy Synthesis for Markov Decision Processes and Branching-Time Logics Tom´asˇ Br´azdil⋆ and Vojtˇech Forejt⋆⋆ Faculty of Informatics, Masaryk University, Botanick´a 68a, 60200 Brno, Czech Republic.

DocID: 1xVy7 - View Document

Process algebra and Markov processes The nature of synchronisation Equivalence relations Case study: active badges Summary  From Markov to Milner and back: Stochastic process algebras Jane Hillston School of Informatics

Process algebra and Markov processes The nature of synchronisation Equivalence relations Case study: active badges Summary From Markov to Milner and back: Stochastic process algebras Jane Hillston School of Informatics

DocID: 1xVg5 - View Document