The symbolic OBDD scheme for generating mechanical assembly sequences

Formal Methods in System Design

Volumn 33, Issue 1-3, 2008, Pages 29-44

  Gu, Tianlong ^a   Liu, Huadong ^a  

^a GUILIN UNIVERSITY OF ELECTRONIC TECHNOLOGY   (China)

Author keywords

Assemble sequence planning; Assembly liaison graph; Assembly sequences generation; Ordered binary decision diagram

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DATA STRUCTURES; DIFFRACTIVE OPTICAL ELEMENTS; FILE ORGANIZATION; GRAPH THEORY; KNOWLEDGE REPRESENTATION; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; TRANSLATION (LANGUAGES);

ASSEMBLE SEQUENCE PLANNING; ASSEMBLY SEQUENCE PLANNING; ASSEMBLY SEQUENCES; ASSEMBLY SEQUENCES GENERATION; CANONICAL FORMS; COMBINATORIAL OPTIMIZATION PROBLEMS; EFFICIENT; EXPERIMENTAL TESTS; FEASIBLE ASSEMBLY SEQUENCES; KNOWLEDGE MODELS; LARGE-SCALE COMBINATORIAL OPTIMIZATIONS; LIAISON GRAPHS; MECHANICAL ASSEMBLIES; ORDERED BINARY DECISION DIAGRAM; ORDERED BINARY DECISION DIAGRAMS; PROTOTYPE TOOLS; STORAGE SPACES; TRANSLATION FUNCTIONS; TRANSLATION RELATIONS; VISUAL C++;

BINARY SEQUENCES;

EID: 54949099289     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-008-0052-y     Document Type: Article

References (29)

1. Bourjault A (1984) Contribution à une approche méthodologique de l'assemblage automatisé: élaboration automatique des séquences opératoires. Thèse d' État. Université de Franche-Comté, Besancon, France
2. RH Wilson 1995 Minimizing user queries in interactive assembly planning IEEE Trans Robotics Autom 11 2 308 311
3. RB Gottipolu K Ghosh 2003 A simplified and efficient representation for evaluation and selection of assembly sequences Comput Ind 50 3 251 264
4. Warrats JJ, Bonschancher N, Bronsvoort WF (1992) A semiautomatic sequence planner. In Proceedings of IEEE International Conference on Robotics and Automation, Nice, France, pp 2431-2438
5. TL Fazio De DE Whitney 1987 Simplified generation of all mechanical assembly sequences IEEE J Robotics Autom 3 6 640 658
6. RB Gottipolu K Ghosh 2003 A simplified and efficient representation for evaluation and selection of assembly sequences Comput Ind 50 3 251 264
7. LS Homem de Mello AC Sanderson 1990 AND/OR graph representation of assembly plans IEEE Trans Robotics Autom 6 2 188 199
8. W Zhang 1989 Representation of assembly and automatic robot planning by Petri net IEEE Trans System, Man, Cybern 19 2 418 422
9. LS Homem de Mello AC Sanderson 1991 Representation of mechanical assembly sequences IEEE Trans Robotics Autom 7 2 211 227
10. LS Homem de Mello AC Sanderson 1991 A correct and complete algorithm for the generation of mechanical assembly sequences IEEE Trans Robotics Autom 7 2 228 240
11. Q Su 2007 Applying case-based reasoning in assembly sequence planning Int J Prod Res 45 1 29 47
12. ZP Yin D Han HX Li YL Xiong 2003 A connector-based hierarchical approach to assembly sequence planning for mechanical assemblies Comput Aided Des 35 1 37 56
13. Marian RM, Luong LHS, Abkary K (2003) Assembly sequence planning and optimization using genetic algorithms. Appl Soft Comput 223-253
14. JF Wang JH Liu YF Zhong 2005 A novel ant colony algorithm for assembly sequence planning Int J Adv Manuf Technol 25 11 1137 1143
15. L Ning T Gu 2007 Immune algorithm for assembly sequence planning problem Comput Integrated Manuf Syst 13 1 81 87
16. RE Bryant 1986 Graph-based algorithms for Boolean function manipulation IEEE Trans Comput 35 8 677 691
17. RE Bryant 1992 Symbolic Boolean manipulation with ordered binary decision diagrams ACM Comput Surv 24 3 293 318
18. D Sieling R Drechsler 1993 Reduction of OBDDs in linear time Inf Process Lett 48 1 139 144
19. D Sieling I Wegener 1995 Graph driven BDDs-a new data structure for Boolean functions Theor Comput Sci 141 283 310
20. GD Hachtel F Somenzi 1997 A Symbolic algorithm for maximum flow in 0-1 networks Formal Methods Syst Des 10 2/3 207 219
21. T Gu Z Xu 2007 The symbolic algorithms for maximum flow in networks Comput Oper Res 34 2 799 816
22. Edelkamp S, Reffel F (1998) OBDDs in heuristic search. In Proceedings of the 22nd Annual German Conference on Artificial Intelligence, pp 81-92
23. S Edelkamp M Helmert 2001 MIPS: The model-checking integrated planning system AI Mag 22 3 67 71
24. A Cimatti M Roveri 2000 Conformant planning via symbolic model checking J Artif Intell Res 13 0 305 338
25. A Cimatti M Pistore M Roveri P Traverso 2003 Weak, strong, and strong cyclic planning Via symbolic model checking Artif Intell 147 35 84
26. P Bertoli A Cimatti M Roveri P Traverso 2006 Strong planning under partial observability Artif Intell 170 4-5 337 384
27. RM Jensen MM Veloso 2000 OBDD-based universal planning for synchronized agents in non-deterministic domains J Artif Intell Res 13 0 189 226
28. Jensen RM, Veloso MM, Bryant RE (2007) State-set branching: leveraging BDDs for heuristic search. Artif Intell (available online)
29. Somenzi F, CUDD: CU Decision Diagram Package Release 2.3.1. http://vlsi.Colorado.edu/