id: 01851042
dt: j
an: 01851042
au: Zorc, S.; Noe, D.; Kononenko, I.
ti: Efficient derivation of the optimal assembly sequence from product
    description.
so: Cybern. Syst. 29, No.2, 159-179 (1998).
py: 1998
pu: Taylor \& Francis, Washington, DC
la: EN
cc: I.2.9
ut: assembly planner
ci: 
li: doi:10.1080/019697298125777
ab: Summary: This paper describes the prototype assembly planner, which derives
    the optimal assembly sequence from a product’s specification.
    Assembly representation used as an input to the planner is based on
    spatial relationships between parts, which are directly related to the
    geometry of the assembly move. This way, in addition to the input
    specification of the product, they can be used for output specification
    of the necessary assembly moves. The space of all possible assembly
    sequences is represented by an AND/OR graph. The graph is searched for
    the best sequence using the variant of the $AO^*$ heuristic algorithm.
    The output of the system is the optimal assembly sequence with a
    description of the required assembly moves. The assembly sequence is,
    at this stage, evaluated with respect to geometrical feasibility,
    stability, and parallelism. To cope with the complexity of the
    implemented approach, we developed efficient algorithms for generating
    and searching the problem space. Empirical evaluation shows the ability
    of the system to deal with real-world assemblies.
rv: