473 search results - page 4 / 95 » Computing shortest paths with uncertainty |
84
Voted
PVLDB
2010
14 years 8 months ago
2010
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
GIS
2010
ACM
14 years 8 months ago
2010
ACM
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
ICRA
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...
105
click to vote
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
CAINE
2004
14 years 11 months ago
2004
The problem of finding a shortest path is common to many different fields including transportation systems, mechanical systems and computer communications. Most telecommunication ...