232 search results - page 11 / 47 » Randomized Kinodynamic Planning |
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
ICRA
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— Randomized motion planning techniques are responsible for many of the recent successes in robot control. However, most motion planning algorithms assume perfect and com...
JMLR
2010
13 years 4 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
EOR
2000
13 years 9 months ago
2000
This paper addresses the problem of scheduling randomly arriving tasks of dierent types at a diversi
SIGMOD
2004
ACM
14 years 10 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...