696 search results - page 84 / 140 » Planning for Network-Aware Paths |
100
Voted
ICRA
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
74
Voted
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— Classical path planning does not address many of the challenges of robotic systems subject to differential constraints. While there have been many recent efforts to develop mot...
104
click to vote
COMPGEOM
1999
ACM
15 years 5 months ago
1999
ACM
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
148
click to vote
AAAI
2008
15 years 3 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
101
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...