696 search results - page 88 / 140 » Planning for Network-Aware Paths |
ESA
2008
Springer
15 years 2 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
119
Voted
ISRR
2005
Springer
15 years 6 months ago
2005
Springer
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...
139
click to vote
RSS
2007
15 years 2 months ago
2007
— 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 ...
99
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— 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...
104
click to vote
SYNASC
2006
IEEE
15 years 6 months ago
2006
IEEE
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...