## Geometric Reasoning about Mechanical Assembly (1994)

Venue: | Artificial Intelligence |

Citations: | 66 - 18 self |

### BibTeX

@ARTICLE{Wilson94geometricreasoning,

author = {Randall H. Wilson and Jean-claude Latombe},

title = {Geometric Reasoning about Mechanical Assembly},

journal = {Artificial Intelligence},

year = {1994},

volume = {71},

pages = {371--396}

}

### OpenURL

### Abstract

In which order can a product be assembled or disassembled? How many hands are required? How many degrees of freedom? What parts should be withdrawn to allow the removal of a specified subassembly? To answer such questions automatically, important theoretical issues in geometric reasoning must be addressed. This paper investigates the planning of assembly algorithms specifying (dis)assembly operations on the components of a product and the ordering of these operations. It also presents measures to evaluate the complexity of these algorithms and techniques to estimate the inherent complexity of a product. The central concept underlying these planning and complexity evaluation techniques is that of a "non-directional blocking graph," a qualitative representation of the internal structure of an assembly product. This representation describes the combinatorial set of parts interactions in polynomial space. It is obtained by identifying physical criticalities where geometric int...

### Citations

10922 |
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ... This idea is analogous to the computational complexity of a problem, which is defined as the lower-bound complexity (in terms of time and space) of all the computer algorithms that solve the problem =-=[16]-=-. The estimated complexity measures for a product can be used to provide concise, pertinent information to the designers. To be useful, however, the complexity of an assembly product must be measured ... |

2438 |
The Design and Analysis of Computer Algorithms
- Aho, Hopcroft, et al.
- 1974
(Show Context)
Citation Context ...t does not already exist). The computation of G(d; A) takes O(n 2 +c) time. We can avoid the initial clearing of the adjacency matrix by keeping track of the updated cells in a stack of pointers (see =-=[2]-=-, page 71). This modification reduces the computing complexity of G(d; A) to O(c). By repeating the computation for all regular regions, the ndbg \Gamma(A) is constructed in O(c 2 ) time. The size of ... |

1988 |
Robot Motion Planning
- Latombe
- 1991
(Show Context)
Citation Context ... 1 1. Introduction Reasoning about mechanical assembly (and disassembly) is an important research topic which has attracted interest from researchers in both artificial intelligence [38] and robotics =-=[27]-=-. In which order can a product be assembled or disassembled? How many hands are required? How many degrees of freedom? What parts should be removed from the assembled product to allow replacement of a... |

1762 |
Computational Geometry: An Introduction
- Preparata, Shamos
- 1985
(Show Context)
Citation Context ...nvex faces F i and F j having v i and v j vertices, respectively, has O(v i v j ) vertices and can be computed in O(v i v j ) time. Its convex hull is constructed in \Theta(v i v j log v i v j ) time =-=[40] and -=-has O(v i + v j ) vertices. Indeed, all the intersection vertices of F i " F j lie on edges of F i and F j , but each particular edge can contribute at most two vertices of the convex hull. Let k... |

1740 |
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
- Fikes, Nilsson
- 1971
(Show Context)
Citation Context ... automatic planning of assembly and disassembly operations has attracted the interest of AI researchers for a long time. The classical blocks world can be seen as a primitive assembly planning domain =-=[15, 38]-=-. Moreover, some AI planners have considered more complex domains. For instance, noah [42] was originally aimed at supplying instructions to a human apprentice to repair an air compressor, including d... |

706 |
Data Structures and Algorithms
- Aho, Hopcroft, et al.
- 1983
(Show Context)
Citation Context ...assemblies, S and A n S, such that one is locally free to translate in some direction d. Each dbg contains n nodes and at most 2r arcs. Hence, finding the strong components of any dbg takes O(r) time =-=[3]-=- and generating a candidate partitioning of A, given \Gamma(A), takes O(r 2 ) time. Furthermore, if a candidate algorithm exists, one candidate algorithm also exists for each of the two subassemblies ... |

340 | Spatial Planning: A Configuration Space Approach
- Lozano-Perez
- 1983
(Show Context)
Citation Context ...t their positions in A, blocks the infinite translation of the coordinate origin O. If P i and P j are polygons in 2D (resp. polyhedra in 3D), then P j \Psi P i is also a polygon (resp. a polyhedron) =-=[27, 32]-=-. Again, let us consider the 3D case with polyhedral parts. B ij is the intersection of S 2 and the polygonal cone of all rays erected from O and intersecting P j \PsiP i . This intersection is a regi... |

331 |
A Structurefor Plans and Behavior
- Sacerdoti
- 1977
(Show Context)
Citation Context ...searchers for a long time. The classical blocks world can be seen as a primitive assembly planning domain [15, 38]. Moreover, some AI planners have considered more complex domains. For instance, noah =-=[42]-=- was originally aimed at supplying instructions to a human apprentice to repair an air compressor, including disassembly and assembly plans. However, because they are usually interested in more genera... |

227 | Complexity of the mover’s problem and generalizations - Reif - 1979 |

135 | On the existence and synthesis of multifinger positive grips
- Mishra, Schwartz, et al.
- 1987
(Show Context)
Citation Context ...e safer the grasp. The number of fingers to achieve form-closure grasps for a single rigid part (equivalently, form-closure of order 0 for a set of parts) is investigated in several papers, including =-=[34, 36]-=-. There exist other pertinent measures of complexity. For example, uncertainties may also play an important role in assembly instructions, requiring sensors to be used. The number of elementary sensor... |

124 |
Topological sweeping an arrangement
- Edelsbrunner, Guibas
- 1989
(Show Context)
Citation Context ...itioning S 2 into an arrangement of O(c 2 ) regular regions of dimensions 2, 1 and 0 (faces, edges, and vertices, respectively). This arrangement is computed in O(c 2 ) time using a topological sweep =-=[12]-=-. The ndbg is computed in O(c 3 ) time and has size O(c 2 n 2 ). If only one dbg is represented at any one time, we can use crossing rules between regions and successively compute all the dbgs in O(c ... |

96 |
On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the warehouseman’s problem
- Hopcroft, Schwartz, et al.
- 1984
(Show Context)
Citation Context ...ndbg or collection of ndbgs covering all possible motions would bring us back to the general planning problem of finding a coordinated path for a set of parts. This problem is known to be pspace-hard =-=[23, 37]-=- and is strongly believed to require exponential time in the number of parts. Polynomial ndbgs such as those described above should be regarded as efficient filters to quickly identify feasible assemb... |

81 | Computing exact aspect graphs or curved objects: parametric surfaces
- Ponce, Kriegman
- 1987
(Show Context)
Citation Context ...dvantage of the fact that, except at critical viewing directions, the occluding contours of an object remain qualitatively (i.e., topologically) the same for small changes in the viewpoint (e.g., see =-=[25]-=-). In [17] a criticality-driven approach makes it possible to plan a sensorless sequence of squeezing operations to achieve some specified orientation of a polygonal part independent of its initial or... |

71 | On constraints in assembly planning
- Jones, Wilson, et al.
- 1998
(Show Context)
Citation Context ...d even mass production. Recently, however, the interest has shifted toward generating assembly sequences to evaluate assembly designs and help designers create products that are easier to manufacture =-=[44, 48]-=-. In this new context, automated geometric reasoning and computational efficiency of assembly planning are critical issues that must be thoroughly explored. The synthesis of pertinent information to f... |

59 |
Simplified generation of all mechanical assembly sequences
- Fanzio, Whitney
- 1987
(Show Context)
Citation Context ...ere mainly sequence editors. Geometric reasoning was supplied by a human who answered questions asked by the computer systems; the assembly sequences were inferred from the answers to these questions =-=[7, 10]-=-. Automated geometric reasoning was later added to answer these questions automatically [5, 19, 20, 28, 30, 47, 51]. This development resulted in generate-and-test assembly sequencers, with a module g... |

53 | Robot planning
- McDermott
- 1992
(Show Context)
Citation Context ... block on top of another). A noticeable exception is build [13], which includes a simple treatment of such notions as stability and friction. The interest of AI in general planning is still very high =-=[35]-=-. The geometric approach to assembly planning originated in robotics with the work reported in [29] (autopass), [31] (lama), and [45]. It is more limited in scope than traditional AI planning and focu... |

48 |
The synthesis of manipulator control programs from task-level specifications
- Taylor
- 1976
(Show Context)
Citation Context ...riction. The interest of AI in general planning is still very high [35]. The geometric approach to assembly planning originated in robotics with the work reported in [29] (autopass), [31] (lama), and =-=[45]-=-. It is more limited in scope than traditional AI planning and focuses specifically on issues raised by the manipulation of physical objects. It has motivated various research in basic path planning, ... |

42 |
Assembly Automation and Product Design
- Boothroyd
- 1992
(Show Context)
Citation Context ...gorithmic complexity of an assembly design presented in this paper directly addresses this issue. It derives in part from informal complexity measures currently in use in several companies (e.g., see =-=[6]-=-). The field of computational geometry has also explored issues relevant to assembly planning, for example, set separation problems [46]. Given a 2D polygonal assembly A, the problem of deciding wheth... |

38 | Movable separability of sets
- Toussaint
- 1985
(Show Context)
Citation Context ...lexity measures currently in use in several companies (e.g., see [6]). The field of computational geometry has also explored issues relevant to assembly planning, for example, set separation problems =-=[46]-=-. Given a 2D polygonal assembly A, the problem of deciding whether there is a direction d and a subassembly S ae A such that a translation along d separates S from the rest of A is addressed in [4]. A... |

34 | Stochastic Plans for Robotic Manipulation
- Goldberg
- 1990
(Show Context)
Citation Context ...f the fact that, except at critical viewing directions, the occluding contours of an object remain qualitatively (i.e., topologically) the same for small changes in the viewpoint (e.g., see [25]). In =-=[17]-=- a criticality-driven approach makes it possible to plan a sensorless sequence of squeezing operations to achieve some specified orientation of a polygonal part independent of its initial orientation.... |

33 |
A planning system for robot construction tasks
- Fahlman
- 1974
(Show Context)
Citation Context ... ON(A,B). Additional geometric knowledge is implicitly coded in the operators representing the actions that can be executed (e.g., stacking a block on top of another). A noticeable exception is build =-=[13]-=-, which includes a simple treatment of such notions as stability and friction. The interest of AI in general planning is still very high [35]. The geometric approach to assembly planning originated in... |

33 |
On planning assemblies
- Natarajan
- 1988
(Show Context)
Citation Context ...ndbg or collection of ndbgs covering all possible motions would bring us back to the general planning problem of finding a coordinated path for a set of parts. This problem is known to be pspace-hard =-=[23, 37]-=- and is strongly believed to require exponential time in the number of parts. Polynomial ndbgs such as those described above should be regarded as efficient filters to quickly identify feasible assemb... |

32 |
Contribution à une approche méthodologique de l'assemblage automatisé: Elaboration automatique des séquences opératoires
- Bourjault
- 1984
(Show Context)
Citation Context ...ere mainly sequence editors. Geometric reasoning was supplied by a human who answered questions asked by the computer systems; the assembly sequences were inferred from the answers to these questions =-=[7, 10]-=-. Automated geometric reasoning was later added to answer these questions automatically [5, 19, 20, 28, 30, 47, 51]. This development resulted in generate-and-test assembly sequencers, with a module g... |

32 |
On the Automatic Generation of Plans for Mechanical Assembly
- Wolter
- 1988
(Show Context)
Citation Context ... asked by the computer systems; the assembly sequences were inferred from the answers to these questions [7, 10]. Automated geometric reasoning was later added to answer these questions automatically =-=[5, 19, 20, 28, 30, 47, 51]-=-. This development resulted in generate-and-test assembly sequencers, with a module guessing candidate sequences and generating questions to check their feasibility, and geometric reasoning modules an... |

28 |
Mechanics of form closure
- Lakshminarayana
- 1978
(Show Context)
Citation Context ...lements on their boundary. A grasp of a moved set achieves form closure if, when the fingers are locked relative to each other, no part in the moved set can move relative to any other and the fingers =-=[26, 27]-=-. (Another concept, involving friction and forces, is that of force closure; we will not discuss it here, though it is perhaps more practical than form closure.) Given some abstract dimensionless mode... |

28 |
Separating two simple polygons by a sequence of translations
- Pollack, Sharir, et al.
- 1988
(Show Context)
Citation Context ... subassembly S ae A such that a translation along d separates S from the rest of A is addressed in [4]. An algorithm to construct a sequence of translations separating two polygonal parts is given in =-=[39]-=-. Several techniques presented in this paper have been influenced by the work in computational geometry. The construction of an ndbg is based on the identification of physical criticalities to decompo... |

26 | A symbolic approach to qualitative kinematics
- Faltings
- 1992
(Show Context)
Citation Context ...uous set into a finite number of regions that are treated as single entities. This approach relates to the general interests of qualitative physics [11] and, more specifically, qualitative kinematics =-=[14, 24]-=-, which studies the internal motions of parts in an operational device. It yields more meaningful decompositions than blind discretizations not based on any sort of criticality (discontinuity, singula... |

26 |
The design of a mechanical assembly system
- Lozano-P'erez
- 1976
(Show Context)
Citation Context ...s stability and friction. The interest of AI in general planning is still very high [35]. The geometric approach to assembly planning originated in robotics with the work reported in [29] (autopass), =-=[31]-=- (lama), and [45]. It is more limited in scope than traditional AI planning and focuses specifically on issues raised by the manipulation of physical objects. It has motivated various research in basi... |

25 |
AUTOPASS: An Automatic Programming System for Computer Controlled Mechanical Assembly
- Lieberman, Wesley
- 1977
(Show Context)
Citation Context ...of such notions as stability and friction. The interest of AI in general planning is still very high [35]. The geometric approach to assembly planning originated in robotics with the work reported in =-=[29]-=- (autopass), [31] (lama), and [45]. It is more limited in scope than traditional AI planning and focuses specifically on issues raised by the manipulation of physical objects. It has motivated various... |

22 |
On monotone paths among obstacles with applications to planning assemblies
- Arkin, Connelly, et al.
- 1989
(Show Context)
Citation Context ...s [46]. Given a 2D polygonal assembly A, the problem of deciding whether there is a direction d and a subassembly S ae A such that a translation along d separates S from the rest of A is addressed in =-=[4]-=-. An algorithm to construct a sequence of translations separating two polygonal parts is given in [39]. Several techniques presented in this paper have been influenced by the work in computational geo... |

22 | Shotgun sequencing
- Wilson, Mardis
- 1997
(Show Context)
Citation Context ...neralized motions and, more generally, sequences of extended motions along different directions could be investigated as well. The investigation for sequences of extended translations is under way in =-=[33]-=-. It leads to partitioning the composite configuration space CA of the parts in A into regions 17 over which all the relative placements of the parts induce the same ndbgs for infinitesimal translatio... |

17 |
A methodology and computational framework for concurrent product and process
- Cutkosky, Tenenbaum
- 1990
(Show Context)
Citation Context ... is to provide efficient computational support for the "concurrent engineering" approach to design, in which constraints arising from manufacturing and servicing are taken into account at de=-=sign time [9]-=-. As products are designed with more parts of various sorts (e.g., machined, composite, electrical, electronic) densely packed to provide more functions per cubic inch, the need for powerful assembly ... |

17 |
Robotworld: A multiple robot vision guided assembly system
- Scheinman
- 1987
(Show Context)
Citation Context ... to find any candidate instructions for the friction-testing machine in two days. Assembly sequences generated for the electric bell were converted into robot programs executed by a RobotWorld system =-=[43]-=-. 7. Complexity of an Assembly The outcome of assembly planning, i.e., assembly algorithms, can be used to specify, select, design, and/or program the manipulation systems that will execute these algo... |

14 |
Symmetry Groups in Robotic Assembly Planning
- Liu
- 1990
(Show Context)
Citation Context ... asked by the computer systems; the assembly sequences were inferred from the answers to these questions [7, 10]. Automated geometric reasoning was later added to answer these questions automatically =-=[5, 19, 20, 28, 30, 47, 51]-=-. This development resulted in generate-and-test assembly sequencers, with a module guessing candidate sequences and generating questions to check their feasibility, and geometric reasoning modules an... |

13 |
Maintaining geometric dependencies in an assembly planner
- Wilson, Rit
- 1990
(Show Context)
Citation Context ... asked by the computer systems; the assembly sequences were inferred from the answers to these questions [7, 10]. Automated geometric reasoning was later added to answer these questions automatically =-=[5, 19, 20, 28, 30, 47, 51]-=-. This development resulted in generate-and-test assembly sequencers, with a module guessing candidate sequences and generating questions to check their feasibility, and geometric reasoning modules an... |

12 |
Papadimitriou, “The geometry of grasping,” Int
- Ni, H
- 1990
(Show Context)
Citation Context ...e safer the grasp. The number of fingers to achieve form-closure grasps for a single rigid part (equivalently, form-closure of order 0 for a set of parts) is investigated in several papers, including =-=[34, 36]-=-. There exist other pertinent measures of complexity. For example, uncertainties may also play an important role in assembly instructions, requiring sensors to be used. The number of elementary sensor... |

11 |
A common sense approach to assembly sequence planning
- Hoffman
- 1991
(Show Context)
Citation Context |

10 |
Representations of mechanical assembly sequences
- S, Sanderson
- 1991
(Show Context)
Citation Context ...ms for a product is a lower bound 24 on the minimal length of all correct one-handed monotonic prismatic assembly algorithms. The set of all candidate algorithms can be represented as an and/or graph =-=[21]-=- and searched for the shortest one using alpha-beta pruning [38]. But in general, the size of this graph is exponential in the number n of parts. Efficiently computing the minimal length of candidate ... |

10 |
Partioning an assembly for infinitesimal motions in translation and rotation
- Wilson, Matsui
- 1992
(Show Context)
Citation Context ...). The set of motions dX allowed by this contact is the intersection of all the closed half-spaces n F j J V k dXs0 computed for the vertices V k of the convex hull of the intersection of F i and F j =-=[18, 49]-=-. For example, in Fig. 6, the vertices V k are circled. We make the same simplifying assumptions about contacts as in Subsection 5.1. For each vertex V k of the convex hull of the intersection of two ... |

9 | On the qualitative structure of a mechanical assembly - Wilson, Latombe - 1992 |

9 | Mating constraint languages for assembly sequence planning - Wolter, Chakrabarty, et al. - 1992 |

7 |
Algorithmic methods and software tools for the generation of mechanical assembly sequences. M.Sc. thesis
- Baldwin
- 1990
(Show Context)
Citation Context |

3 |
A general algorithm for derivation and analysis of constraint for motion of polyhedra in contact
- Hirukawa, Matsui, et al.
- 1991
(Show Context)
Citation Context ...). The set of motions dX allowed by this contact is the intersection of all the closed half-spaces n F j J V k dXs0 computed for the vertices V k of the convex hull of the intersection of F i and F j =-=[18, 49]-=-. For example, in Fig. 6, the vertices V k are circled. We make the same simplifying assumptions about contacts as in Subsection 5.1. For each vertex V k of the convex hull of the intersection of two ... |

2 |
Task Sequence Planning for Robotic Assembly
- Mello, S
- 1989
(Show Context)
Citation Context |

2 | Assembly Planning Based - Lee, Shin - 1990 |

2 |
Development of a Design for Service Methodology
- Subramani
- 1992
(Show Context)
Citation Context ...d even mass production. Recently, however, the interest has shifted toward generating assembly sequences to evaluate assembly designs and help designers create products that are easier to manufacture =-=[44, 48]-=-. In this new context, automated geometric reasoning and computational efficiency of assembly planning are critical issues that must be thoroughly explored. The synthesis of pertinent information to f... |