Efficient linear unboundedness testing: Algorithm and applications to translational assembly planning

International Journal of Robotics Research

Volumn 19, Issue 9, 2000, Pages 817-834

  Schwarzer, Fabian ^a   Schweikard, Achim ^a   Joskowicz, Leo ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; LINEAR PROGRAMMING; MOTION PLANNING; STRATEGIC PLANNING;

LINEAR UNBOUNDEDNESS TESTING;

COMPUTER INTEGRATED MANUFACTURING;

EID: 0034263036     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/02783640022067193     Document Type: Article

References (22)

1. Agarwal, P. K., de Berg, M., Halperin, D., and Sharir, M. 1996. Efficient generation of k-directional assembly sequences. Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), Atlanta, GA, pp. 122-131.
2. Baraff, D., Mattikalli, R., and Khosla, P. 1997. Minimal fix-turing of frictionless assemblies: Complexity and algorithms. Algorithmica 19:4-39.
3. Chazelle, B., Ottmann, T. A., Soisalon-Soininen, E., and Wood, D. 1984. The complexity and decidability of SEPARATION. Proc. 11th Int. Colloquium on Autom. Lang. Prog. LNCS 172, 119-127.
4. Dawson, R. 1984. On removing a ball without disturbing the others. Mathematics Magazine 57(1):27-30.
5. Halperin, D. Latombe, J. C., and Wilson, R. H. 1998. A general framework for assembly planning: The motion space approach. Proc. of the 12th ACM Conference on Computational Geometry, Minneapolis, MN, pp. 9-18.
6. Halperin, D., and Wilson, R. H. 1997. Assembly partitioning along simple paths: The case of multiple translations. Advanced Robotics 11:127-146.
7. Hoffman, R. L. 1991. A common sense approach to assembly sequence planning. In Computer-Aided Mechanical Assembly Planning, ed. L. S. Homem de Mello and S. Lee, 289-314. Boston: Kluwer.
8. Homem de Mello, L. S., and Lee, S., eds. 1991. Computer-Aided Mechanical Assembly Planning. Boston: Kluwer Academic.
9. Huyn, T., Joskowicz, L., Lassez, C., and Lassez, J. L. 1991. Practical tools for reasoning about linear constraints. Fundamenta Informaticae 15:3-4.
10. Joskowicz, L., and Taylor, R. H. 1996. Interference-free insertion of a solid body into a cavity: An algorithm and a medical application. International Journal of Robotics Research 15(3):211-229.
11. Karmarkar, N. 1984. A new polynomial-time algorithm for linear programming. STOC, Washington, DC, pp. 302-311.
12. Larsen, E., Gottschalk, S., Lin, M. C., and Manocha, D. 1999. Fast proximity queries with swept sphere volumes. Technical Report TR99-018, Department of Computer Science, University of North Carolina, Chapel Hill.
13. Latombe, J. C. 1991. Robot Motion Planning. Boston: Kluwer Academic.
14. Mehlhorn, K., and Naeher, S. 1995. LEDA: A Platform for Combinatorial and Geometric Computing. Saarbrücken: Max-Planck-Institut für Informatik.
15. Ramkumar, G. D. 1998. Tracings and Their Convolution: Theory and Applications. Ph.D. thesis, Department of Computer Science, Stanford University.
16. Schweikard, A., and Schwarzer, F. 1998. Detecting geometric infeasibility. Artificial Intelligence 105(1-2):139-159.
17. Schweikard, A., and Wilson, R. H. 1995. Assembly sequences for polyhedra. Algorithmica 13(6):539-552.
18. Snoeyink, J., and Stolfi, J. 1994. Objects that cannot be taken apart with two hands. Discrete and Computational Geometry 12:367-384.
19. Stoer, J. 1976. Einführung in die Numerische Mathematik I. Berlin/New York: Springer-Verlag.
20. Toussaint, G. T. 1985. Movable separability of sets. In Computational Geometry, ed. G. T. Toussaint. New York: Elsevier.
21. Wolter, J. D., and Trinkle, J. C. 1994. Automatic selection of fixture points for frictionless assemblies. Technical Report CS TR 94-017, Texas A&M University.
22. Wright, M. H. 1992. Interior methods for constrained optimization. In Acta Numerica, ed. A. Iserles. New York: Cambridge University Press.