The symbolic OBDD scheme for generating mechanical assembly sequences

DOI10.1007/s10703-008-0052-yzbMath1165.68489OpenAlexW2136325461MaRDI QIDQ1028726

Tianlong Gu, Huadong Liu

Publication date: 6 July 2009

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-008-0052-y

zbMATH Keywords

ordered binary decision diagramassemble sequence planningassembly liaison graphassembly sequences generation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Visual C++
• CUDD

Cites Work

• Unnamed Item
• Unnamed Item
• Graph driven BDDs -- a new data structure for Boolean functions
• Weak, strong, and strong cyclic planning via symbolic model checking
• Reduction of OBDDs in linear time
• The symbolic algorithms for maximum flow in networks
• Strong planning under partial observability
• Graph-Based Algorithms for Boolean Function Manipulation
• Applying case-based reasoning in assembly sequence planning

This page was built for publication: The symbolic OBDD scheme for generating mechanical assembly sequences