473 search results - page 40 / 95 » Computing shortest paths with uncertainty |
79
Voted
AROBOTS
2005
14 years 9 months ago
2005
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
68
Voted
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We present an efficient approach to generating paths for a robotic manipulator that are collision-free and guaranteed to meet task specifications despite pose uncertainty. We ...
85
Voted
ICRA
1999
IEEE
15 years 2 months ago
1999
IEEE
In future planetary exploration missions, rovers will be required to autonomously traverse challenging environments. Much of the previous work in robot motion planning cannot be s...
124
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...