The symbolic OBDD scheme for generating mechanical assembly sequences
From MaRDI portal
Publication:1028726
DOI10.1007/s10703-008-0052-yzbMath1165.68489MaRDI QIDQ1028726
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
ordered binary decision diagram; assemble sequence planning; assembly liaison graph; assembly sequences generation
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Uses Software
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