Sciweavers

793 search results - page 96 / 159
» Analogical Path Planning
Sort
View
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
14 years 1 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart
RSS
2007
136views Robotics» more  RSS 2007»
13 years 9 months ago
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
— We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a ...
Ron Alterovitz, Thierry Siméon, Kenneth Y. ...
ICDE
2006
IEEE
126views Database» more  ICDE 2006»
14 years 2 months ago
Managing the Forecast Factory
The CORIE forecast factory consists of a set of data product generation runs that are executed daily on dedicated local resources. The goal is to maximize productivity and resourc...
Laura Bright, David Maier, Bill Howe
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
14 years 2 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 2 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard