Benutzer: Gast  Login
Dokumenttyp:
Technical Report 
Autor(en):
Fabian Schwarzer; Florian Bieberbach; Leo Joskowicz; Achim Schweikard 
Titel:
Efficiently Testing for Unboundedness and m-handed Assembly 
Abstract:
We address the problem of efficiently determining if the intersection of a given set of d-dimensional halfspaces 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 algori...    »
 
Stichworte:
assembly planning; linear programming; unboundedness 
Jahr:
1997 
Jahr / Monat:
1997-12-01 00:00:00 
Seiten/Umfang:
14