202 search results - page 14 / 41 » Admissible Heuristics for Optimal Planning |
182
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
90
Voted
ATAL
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
104
click to vote
UAI
2004
15 years 1 months ago
2004
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
94
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
CPAIOR
2006
Springer
15 years 4 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...