Sciweavers

206 search results - page 6 / 42
» Three Hoppy path problems and ternary paths
Sort
View
ROBOCOMM
2007
IEEE
14 years 1 months ago
Path planning using Shi and Karl level sets
—Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobi...
Randeep Singh, Nagaraju Bussa
CP
2005
Springer
14 years 1 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
13 years 9 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty
PAMI
2010
222views more  PAMI 2010»
13 years 6 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
TON
1998
186views more  TON 1998»
13 years 7 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar