A broad introduction to algorithms for decision making under uncertainty, introducing the underlying mathematical problem formulations and the algorithms for solving them …
One of the most striking features of human cognition is the ability to plan. Two aspects of human planning stand out—its efficiency and flexibility. Efficiency is especially impressive …
In recent years, the interest in leveraging quantum effects for enhancing machine learning tasks has significantly increased. Many algorithms speeding up supervised and …
G Shani, J Pineau, R Kaplow - Autonomous Agents and Multi-Agent …, 2013 - Springer
The past decade has seen a significant breakthrough in research on solving partially observable Markov decision processes (POMDPs). Where past solvers could not scale …
Markov Decision Processes (MDPs) are a mathematical framework for modeling sequential decision problems under uncertainty as well as reinforcement learning problems. Written by …
Unavoidable dead-ends are common in many probabilistic planning problems, eg when actions may fail or when operating under resource constraints. An important objective in …
Liste der Autoren Page 1 Liste der Autoren Clemens Beckstein Gerhard Brewka Christian Borgelt Wolfram Burgard Hans-Dieter Burkhard Stephan Busemann Thomas Christaller Leonie …
Markov Decision Processes (MDPs) are widely popular in Artificial Intelligence for modeling sequential decision-making scenarios with probabilistic dynamics. They are the framework …
T Keller, P Eyerich - Proceedings of the International Conference on …, 2012 - ojs.aaai.org
We present PROST, a probabilistic planning system that is based on the UCT algorithm by Kocsis and Szepesvari (2006), which has been applied successfully to many areas of …