Sciweavers

166 search results - page 15 / 34
» Planning with Action Abstraction and Plan Decomposition Hier...
Sort
View
CPAIOR
2010
Springer
15 years 2 months ago
Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
Elvin Coban, John N. Hooker
NIPS
1993
14 years 11 months ago
Robust Reinforcement Learning in Motion Planning
While exploring to nd better solutions, an agent performing online reinforcement learning (RL) can perform worse than is acceptable. In some cases, exploration might have unsafe, ...
Satinder P. Singh, Andrew G. Barto, Roderic A. Gru...
AIPS
2003
14 years 11 months ago
Synthesis of Hierarchical Finite-State Controllers for POMDPs
We develop a hierarchical approach to planning for partially observable Markov decision processes (POMDPs) in which a policy is represented as a hierarchical finite-state control...
Eric A. Hansen, Rong Zhou
AAAI
2007
15 years 3 days ago
Detecting Execution Failures Using Learned Action Models
reason with abstracted models of the behaviours they use to construct plans. When plans are turned into the instructions that drive an executive, the real behaviours interacting w...
Maria Fox, Jonathan Gough, Derek Long
KI
2004
Springer
15 years 3 months ago
On-Line Decision-Theoretic Golog for Unpredictable Domains
Abstract. DTGolog was proposed by Boutilier et al. as an integration of decision-theoretic (DT) planning and the programming language Golog. Advantages include the ability to handl...
Alexander Ferrein, Christian Fritz, Gerhard Lakeme...