793 search results - page 57 / 159 » Analogical Path Planning |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
DAC
1994
ACM
14 years 5 days ago
1994
ACM
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
CRV
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we present our approach to 3D surface reconstruction from large sparse range data sets. In space robotics constructing an accurate model of the environment is very i...
SIAMDM
2010
13 years 6 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
AROBOTS
2002
13 years 8 months ago
2002
The potential field method is widely used for autonomous mobile robot path planning due to its elegant mathematical analysis and simplicity. However, most researches have been focu...