A structure-oriented approach to assembly sequence planning

@article{Chakrabarty1997ASA,
  title={A structure-oriented approach to assembly sequence planning},
  author={Sugato Chakrabarty and Jan D. Wolter},
  journal={IEEE Trans. Robotics Autom.},
  year={1997},
  volume={13},
  pages={14-29}
}
An assembly sequence planner is a system which, given a description of an assembly to be manufactured, identifies subassemblies and generates high-level plans for the construction of the each subassembly, including the final assembly. Previous research has shown that feasible plans can be efficiently produced for large assemblies, but the generation of good plans has met with less success. Not only are there difficulties in defining "good plans," but all published methods for finding good plans… 
A structure-oriented method for generating good assembly sequence plans
An assembly sequence planner is a system which, given a description of an assembly to be manufactured, identifies subassemblies and generates high-level plans for the construction of each
Optimal assembly plan generation: a simplifying approach
TLDR
This method of assembly plan generation belongs to the approach called “disassembly” and is founded on a new representation of the assembly process, with introduction of a new concept, the equivalence of binary trees, which allows to generate the minimal list of all non-redundant assembly plans.
Subassembly identification for assembly sequence planning
Assembly sequence planning is a typical of NP-complete problem which will spend a large amount of computation time or disk memory once the assembly becomes complex. The complex product or assembly is
A knowledge-based approach to assembly sequence planning
TLDR
The approach proposed in this paper can generate assembly sequences for each CSBAT directly, without the problem of merging plans for different child CSBATs, and shows that the knowledge-based approach can reduce the computational complexity drastically and obtain more feasible and practical plans.
Subassembly generation algorithm from a CAD model
Assembly or disassembly sequence planning is a very hard combinatory problem while the assembly parts numbers become important. To reduce this difficulty, especially for the case of complex products,
TOWARDS AUTOMATIC GENERATION OF PLANS FOR AUTOMATED ASSEMBLY
The present CAD/CAM systems still lack the appropriate CAE component that would allow more efficient assembly planning in the effort to integrate the product design, assembly system design, assembly
An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm
Assembly sequence planning (ASP) becomes one of the major challenges in product design and manufacturing. A good assembly sequence leads to reduced costs and duration in the manufacturing process.
A collaborative approach to assembly sequence planning
...
...

References

SHOWING 1-10 OF 35 REFERENCES
A hierarchical assembly planning system
This dissertation addresses the problem of generating feasible assembly sequences for a mechanical product from a description of it in a fundamentally new way. An operation is a motion to bring
A hierarchical approach to assembly planning
  • S. Chakrabarty, J. Wolter
  • Physics
    Proceedings of the 1994 IEEE International Conference on Robotics and Automation
  • 1994
This paper describes a fundamentally new approach to assembly sequence planning which views an assembly as a hierarchy of standard structures and uses a strategy of merging partial plans for
On the automatic generation of plans for mechanical assembly
The problem of moving a set of parts from a given initial configuration to a given final configuration has been well studied. However, this classical problem differs in several important respects
On the automatic generation of assembly plans
  • J. Wolter
  • Business
    Proceedings, 1989 International Conference on Robotics and Automation
  • 1989
TLDR
The author describes a level of assembly process-planning in which a task-level plan is generated directly from a model of the proposed assembly, and an experimental assembly planning system which is capable of rapidly generating plans for most assemblies.
A framework of knowledge-based assembly planning
  • Y. Huang, C. S. Lee
  • Business, Computer Science
    Proceedings. 1991 IEEE International Conference on Robotics and Automation
  • 1991
TLDR
A framework of knowledge-based assembly planning for the automatic generation of assembly plans from the CAD model of an assembly is presented and a prototype system has been developed that can read in the CAD data of a product and the resource information of anassembly cell and automatically generate an optimal assembly plan based on the selection criteria specified by the user of the system.
Backward assembly planning with assembly cost analysis
  • Sukhan Lee
  • Business
    Proceedings 1992 IEEE International Conference on Robotics and Automation
  • 1992
The author considers automatic assembly planning by developing a backward assembly planner which handles the case where an assembly sequence is not the same as the reverse of a disassembly sequence;
A combinatorial analysis of enumerative data structures for assembly planning
  • J. Wolter
  • Business
    Proceedings. 1991 IEEE International Conference on Robotics and Automation
  • 1991
TLDR
The most common restrictions applied to assembly plans-sequentiality, monotonicity, and coherence-are defined and discussed and three distinct definitions of an assembly plan are described and compared.
Maintaining geometric dependencies in an assembly planner
  • R. Wilson, J. Rit
  • Computer Science
    Proceedings., IEEE International Conference on Robotics and Automation
  • 1990
The problem of generating assembly sequences strictly from the geometry of a goal assembly is addressed. The planner considers 2-D, polygonal parts and makes the usual assumptions about the monotony
A correct and complete algorithm for the generation of mechanical assembly sequences
The authors present an algorithm for the generation of mechanical assembly sequences and a proof of its correctness and completeness. The algorithm uses a relational model which describes the
On geometric assembly planning
TLDR
The non-directional blocking graph is introduced, a succinct characterization of the blocking relationships between parts in an assembly, and efficient algorithms to identify removable subassemblies by constructing and analyzing the NDBG are described.
...
...