Sciweavers

TON
2002
138views more  TON 2002»
13 years 10 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 4 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
ICRA
2006
IEEE
91views Robotics» more  ICRA 2006»
14 years 5 months ago
Minimum Wheel-rotation Paths for Differential-drive Mobile Robots
— Characterizing optimal paths for mobile robots is an interesting, important, and challenging endeavor. Not only they are interesting with respect to the optimized criteria, but...
Hamid Reza Chitsaz, Steven M. LaValle, Devin J. Ba...
ICRA
2007
IEEE
159views Robotics» more  ICRA 2007»
14 years 5 months ago
Planning with Uncertainty in Position Using High-Resolution Maps
— We present a novel approach to mobile robot navigation that enables navigation in outdoor environments without GPS. The approach uses a path planner that calculates optimal pat...
Juan Pablo Gonzalez, Anthony Stentz
ICNP
2007
IEEE
14 years 5 months ago
Lexicographic products in metarouting
— Routing protocols often keep track of multiple route metrics, where some metrics are more important than others. Route selection is then based on lexicographic comparison: the ...
Alexander J. T. Gurney, Timothy G. Griffin