2877 search results - page 36 / 576 » The Complexity of Planarity Testing |
ICRA
2003
IEEE
14 years 2 months ago
2003
IEEE
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but narrow passages in a robot’s configuration space create s...
ISAAC
1992
Springer
14 years 1 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
ALGORITHMICA
2000
13 years 8 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
WG
2001
Springer
14 years 1 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
IJCGA
2010
13 years 7 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...