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 ...
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...
— 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...
— 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...
— 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 ...