Sciweavers

319 search results - page 19 / 64
» Context-Aware Route Planning
Sort
View
87
Voted
IROS
2006
IEEE
140views Robotics» more  IROS 2006»
15 years 6 months ago
Creating High-quality Roadmaps for Motion Planning in Virtual Environments
— 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...
Roland Geraerts, Mark H. Overmars
CISIS
2011
IEEE
14 years 12 days ago
Agent-based Pickup and Delivery Planning: The Learnable Evolution Model Approach
—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...
Janusz Wojtusiak, Tobias Warden, Otthein Herzog
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
15 years 2 months ago
Time-Dependent SHARC-Routing
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...
Daniel Delling
104
Voted
ATMOS
2009
130views Optimization» more  ATMOS 2009»
15 years 1 months ago
Arc-Flags in Dynamic Graphs
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...
Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel ...
122
Voted
COR
2007
176views more  COR 2007»
15 years 13 days ago
Scheduling and routing of automated guided vehicles: A hybrid approach
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
Ayoub Insa Corréa, André Langevin, L...