Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Theoretical Computer Science
Abstraction and approximate decision-theoretic planning
Artificial Intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
TALplanner: A temporal logic based forward chaining planner
Annals of Mathematics and Artificial Intelligence
Nearly deterministic abstractions of Markov decision processes
Eighteenth national conference on Artificial intelligence
Symbolic heuristic search for factored Markov decision processes
Eighteenth national conference on Artificial intelligence
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Hierarchical control and learning for markov decision processes
Hierarchical control and learning for markov decision processes
Forward-chaining planning in nondeterministic domains
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
OBDD-based universal planning for synchronized agents in non-deterministic domains
Journal of Artificial Intelligence Research
Hierarchical reinforcement learning with the MAXQ value function decomposition
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Real-time search in non-deterministic domains
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Controllers for reachability specifications for hybrid systems
Automatica (Journal of IFAC)
HOPPER: a hierarchical planning agent for unpredictable domains
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Hi-index | 0.00 |
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological backtracking. The second is a recursive method based on assuming that the ...