389 search results - page 23 / 78 » Route Planning by Analogy |
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Our goal is to create roadmaps that are particularly suited for motion planning in virtual environments. We use our Reachability Roadmap Method to compute an initial, resolutio...
CISIS
2011
IEEE
12 years 7 months ago
2011
IEEE
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
ATMOS
2009
13 years 8 months ago
2009
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...