An efficient algorithm for searching implicit AND/OR graphs with cycles
- 1 November 2000
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 124 (1) , 1-30
- https://doi.org/10.1016/s0004-3702(00)00063-1
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- AND/OR net representation for robotic task sequence planningIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 1998
- Best First Search Algorithm in AND/OR Graphs with CyclesJournal of Algorithms, 1996
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problemsEuropean Journal of Operational Research, 1995
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction searchArtificial Intelligence, 1994
- A general heuristic bottom-up procedure for searching and/or graphsInformation Sciences, 1991
- A correct and complete algorithm for the generation of mechanical assembly sequencesIEEE Transactions on Robotics and Automation, 1991
- Admissibility of AO∗ when heuristics overestimateArtificial Intelligence, 1987
- AND/OR graph heuristic search methodsJournal of the ACM, 1985
- Admissible heuristic search in and/or graphsTheoretical Computer Science, 1983
- An admissible and optimal algorithm for searching AND/OR graphsArtificial Intelligence, 1971