Sciweavers

89 search results - page 1 / 18
» Fast paths in large-scale dynamic road networks
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 5 months ago
Fast paths in large-scale dynamic road networks
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
Giacomo Nannicini, Philippe Baptiste, Gilles Barbi...
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 6 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
ICRA
2006
IEEE
143views Robotics» more  ICRA 2006»
13 years 11 months ago
Evaluation of a Large Scale Pervasive Embedded Network for Robot Path Planning
— We investigate a technique that uses an embedded network deployed pervasively throughout an environment to aid robots in navigation. First, we show that the path computed by th...
Keith J. O'Hara, Victor Bigio, Shaun Whitt, Daniel...
VTC
2010
IEEE
201views Communications» more  VTC 2010»
13 years 3 months ago
iTETRIS: Adaptation of ITS Technologies for Large Scale Integrated Simulation
1 —the European Union (EU) Framework Program 7 (FP7) funded project, iTETRIS [1] (An Integrated Wireless and Traffic Platform for Real-Time Road Traffic Management Solutions) tar...
Vineet Kumar, Lan Lin, Daniel Krajzewicz, Fatma Hr...
4OR
2010
148views more  4OR 2010»
13 years 3 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini