226 search results - page 31 / 46 » Heuristic Search Planning with BDDs |
IROS
2007
IEEE
14 years 5 months ago
2007
IEEE
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
AAAI
2008
14 years 1 months ago
2008
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hind...
CP
2008
Springer
14 years 19 days ago
2008
Springer
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...
JAIR
2008
13 years 10 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
AAAI
1998
14 years 6 days ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...