408 search results - page 13 / 82 » A lookahead strategy for solving large planning problems |
80
Voted
CCCG
1996
14 years 11 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
ICPP
1998
IEEE
15 years 1 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
ANSS
2001
IEEE
15 years 1 months ago
2001
IEEE
In this work, we study the different buffering techniques used in the literature to solve the contention problem in A TM switching architectures. The objective of our study is to ...
137
click to vote
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
68
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
In many AI settings an agent is comprised of both actionplanning and action-execution components. We examine the relationship between the precision of the execution component, the...