We address the problem of efficiently determining if the intersection of a given set of d-dimensional half-spaces is unbounded. It is shown that detecting unboundedness can be reduced to a single linear range computation followed by a single linear feasibility test. In contrast, detecting unboundedness is at least as hard as linear feasibility testing and maximization. Our analysis suggests that algorithms for establishing linear unboundedness can be used as a basis of simple and practical algorithms in motion planning, insertability analysis and assembly planning. We show that m-handed assembly planning can be reduced to testing for unboundedness. A valid motion sequence can be computed in polynomial time, if the parts are not already separated in their initial placement. No polynomial algorithms were previously known for this problem. We present experimental results obtained with an implementation of our algorithms.
|Original language||American English|
|Number of pages||6|
|State||Published - 1998|
|Event||Proceedings of the 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Part 1 (of 3) - Victoria, Can|
Duration: 13 Oct 1998 → 17 Oct 1998
|Conference||Proceedings of the 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Part 1 (of 3)|
|Period||13/10/98 → 17/10/98|