473 search results - page 35 / 95 » Computing shortest paths with uncertainty |
61
Voted
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
IPL
2010
14 years 8 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
58
Voted
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
2010
Eurographics
In this paper, we propose an automatic method for generating roads based on a weighted anisotropic shortest path algorithm. Given an input scene, we automatically create a path co...
DEBU
2010
14 years 9 months ago
2010
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
MFCS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...