Movement problems for 2-dimensional linkages
SIAM Journal on Computing
Computational complexity of art gallery problems
IEEE Transactions on Information Theory
A probabilistic learning approach to motion planning
WAFR Proceedings of the workshop on Algorithmic foundations of robotics
Randomized query processing in robot path planning
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower Bounds for Geometrical and Physical Problems
SIAM Journal on Computing
On finding narrow passages with probabilistic roadmap planners
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
OBPRM: an obstacle-based PRM for 3D workspaces
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
On Frictional Mechanical Systems and Their Computational Power
SIAM Journal on Computing
| Hi-index | 0.00 |
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint subsets of C, the free space F is defined to be the portion of C not occupied by these obstacles. The space is said to be highly visible if at each point in F a viewer can see at least an ε fraction of the entire F. This assumption has been used for robotic motion planning in the analysis of random sampling of points in the robot's configuration space, as well as the upper bound of the minimum number of guards needed for art gallery problems. However, there is no prior result on the implication of this assumption to the geometry of the space under study. For the two-dimensional case, with the additional assumptions that C is bounded within a rectangle of constant aspect ratio and that the volume ratio between F and C is a constant, we use the proof technique of "charging" each obstacle boundary segment by a certain portion of C to show that the total length of all obstacle boundaries in C is O(√nµ(F)/ε), if F contains polygonal obstacles with a total of n boundary edges; or O(√nµ(F)/ε), if C contains n convex obstacles that are piecewise smooth. In both cases, µ(F) is the volume of F. For the polygonal case, this bound is tight as we can construct a space whose boundary size is Θ(√nµ(F)/ε). These results can be partially extended to three dimensions. We show that these results can be applied to the analysis of certain probabilistic roadmap planners, as well as a variant of the art gallery problem. We also propose a number of conjectures on the properties of these highly visible, spaces.