Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Reduction of OBDDs in linear time
Information Processing Letters
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Strong planning under partial observability
Artificial Intelligence
State-set branching: Leveraging BDDs for heuristic search
Artificial Intelligence
OBDD-based universal planning for synchronized agents in non-deterministic domains
Journal of Artificial Intelligence Research
Conformant planning via symbolic model checking
Journal of Artificial Intelligence Research
An ASP based method for subassembly identification
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Using ASP to improve the information reuse in mechanical assembly sequence planning
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
| Hi-index | 0.00 |
Assembly sequence planning is one of typical combinatorial optimization problems, where the size of parts involved is a significant and often prohibitive difficulty. The compact storage and efficient evaluation of feasible assembly sequences is one crucial concern. Ordered binary decision diagram (OBDD) is a canonical form to represent and manipulate the Boolean functions efficiently, and appears to give improved results for large-scale combinatorial optimization problems. In this paper, assembly knowledge models of liaison graph and translation function are formulated by OBDDs, and OBDD-based representation of assembly sequences is proposed. A novel OBDD-based procedure was presented to generate all geometrically feasible assembly sequences from the OBDDs of liaison graph and translation relation. This procedure can be used conveniently on the computer and all the feasible sequences can be derived. The great advantage of OBDD-based scheme is that the storage space of OBDD-based representation of feasible assembly sequences does not increase with the part count of assembly dramatically so quickly as that of AND/OR graph does. We developed the prototype tool for generating assembly sequence using Visual C++ and CUDD package, and undertake some experimental tests. It was shown that the OBDD scheme generated feasible assembly sequences correctly and completely.