3678 search results - page 160 / 736 » On the Stable Paths Problem |
133
Voted
IPL
2008
15 years 3 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
125
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
138
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
158
Voted
W2GIS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
138
Voted
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— By combining a low-order model of forecast errors, the extended Kalman filter, and classical continuous optimization, we develop an integrated methodology for planning mobile ...