On the Qualitative Structure of a Mechanical Assembly

A mechanical assembly is usually described by the geometry of its parts and the spatial relations defining their positions. This model does not directly provide the information needed to reason about assembly and disassembly motions. We propose another representation, the non-directional blocking graph, which describes the qualitative internal structure of the assembly. This representation makes explicit how the parts prevent each other from being moved in every possible direction of motion. It derives from the observation that the infinite set of motion directions can be partitioned into a finite arrangement of subsets such that over each subset the interferences among the parts remain qualitatively the same. We describe how this structure can be efficiently computed from the geometric model of the assembly. The (dis)assembly motions considered include infinitesimal and extended translations in two and three dimensions, and infinitesimal rigid motions.

[1]  Scott E. Fahlman,et al.  A Planning System for Robot Construction Tasks , 1973, Artif. Intell..

[2]  Achim Schweikard,et al.  Assembling polyhedra with single translations , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[3]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[4]  Esther M. Arkin,et al.  On monotone paths among obstacles with applications to planning assemblies , 1989, SCG '89.

[5]  Sukhan Lee,et al.  Computer-Aided Mechanical Assembly Planning , 1991 .

[6]  Earl David Sacerdoti,et al.  A Structure for Plans and Behavior , 1977 .

[7]  Randall H. Wilson Efficiently partitioning an assembly , 1991 .

[8]  Randall H. Wilson,et al.  Partitioning An Assembly For Infinitesimal Motions In Translation And Rotation , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[10]  Randall H. Wilson,et al.  On geometric assembly planning , 1992 .

[11]  Brian C. Williams,et al.  Qualitative Reasoning about Physical Systems: A Return to Roots , 1991, Artif. Intell..

[12]  Leo Joskowicz,et al.  Computational Kinematics , 1991, Artif. Intell..

[13]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[14]  Ann Patricia Fothergill,et al.  An Interpreter for a Language for Describing Assemblies , 1980, Artif. Intell..

[15]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[16]  Micha Sharir,et al.  Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..

[17]  Balas K. Natarajan,et al.  On planning assemblies , 1988, SCG '88.

[18]  Bernard Chazelle,et al.  The power of geometric duality , 1985, BIT Comput. Sci. Sect..

[19]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[20]  H. Hirukawa,et al.  A general algorithm for derivation and analysis of constraint for motion of polyhedra in contact , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[21]  Godfried T. Toussaint,et al.  Movable Separability of Sets , 1985 .

[22]  Arthur C. Sanderson,et al.  Task sequence planning for robotic assembly , 1989 .