Sciweavers

866 search results - page 91 / 174
» On Dynamic Shortest Paths Problems
Sort
View
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
14 years 4 months ago
Path following for an omnidirectional mobile robot based on model predictive control
— In this paper, the path following problem of an omnidirectional mobile robot has been studied. Given the error dynamic model derived from the robot state vector and the path st...
Kiattisin Kanjanawanishkul, Andreas Zell
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 2 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 4 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
14 years 3 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
MATES
2010
Springer
13 years 8 months ago
Context-Aware Route Planning
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
Adriaan ter Mors, Cees Witteveen, Jonne Zutt, Fern...