Efficient algorithm for searching implicit AND/OR graphs with cycles

Artificial Intelligence

Volumn 124, Issue 1, 2000, Pages 1-30

  Jimenez P ^a   Torras, C ^a  

^a INSTITUT DE ROBÒTICA I INFORMÀTICA INDUSTRIAL CSIC UPC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING; THEOREM PROVING;

CYCLIC GRAPHS;

ARTIFICIAL INTELLIGENCE;

EID: 0342520857     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00063-1     Document Type: Article

References (21)

1. Arenales M., Morabito R. An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems. European J. Oper. Res. Vol. 84:1995;599-617.
2. Bagchi A., Mahanti A. Admissible heuristic search in AND/OR graphs. Theoret. Comput. Sci. Vol. 24:1983;207-219.
3. Barnett J.A., Verma T. Intelligent reliability analysis. Proc. 10th IEEE Conference on Artificial Intelligence for Applications, San Antonio, TX. 1994;428-433.
4. Cao T., Sanderson A.C. AND/OR net representation for robotic task sequence planning. IEEE Trans. Systems Man Cybernet. - Part C: Applications and Reviews. Vol. 28:(2):1998;204-218.
5. Chakrabarti P., Ghose S., DeSarkar S. Admissibility of AO* when heuristics overestimate. Artificial Intelligence. Vol. 34:1988;97-113.
6. Chakrabarti P.P. Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search. Artificial Intelligence. Vol. 65:(2):1994;329-345.
7. Chang C.L., Slagle J.R. An admissible and optimal algorithm for searching AND/OR graphs. Artificial Intelligence. Vol. 2:1971;117-128.
8. DeMello L.S.H., Sanderson A.C. A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans. Robotics and Automation. Vol. 7:(2):1991;228-240.
9. Goldwasser M. Complexity measures for assembly sequences. Ph.D. Thesis. 1997;Stanford University, CA.
10. Goldwasser M., Latombe J.-C., Motwani R. Complexity measures for assembly sequences. Proc. IEEE Internat. Conference on Robotics and Automation, Minneapolis, MN, Vol. 2. 1996;1851-1857.
11. Goldwasser M., Motwani R. Intractability of assembly sequencing: Unit disks in the plane. Proc. Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science. Vol. 1272:1997;307-320 Springer, Berlin.
12. Hvalica D. On the cost of potential solution subgraphs. Proc. 3rd Symposium on Operations Research in Slovenia. 1995;81-88.
13. Hvalica D. Best first search algorithm in AND/OR graphs with cycles. J. Algorithms. Vol. 21:1996;102-110.
14. Jiménez P., Thomas F., Torras C. Collision detection algorithms for motion planning. Laumond J.-P. Robot Motion Planning and Control. Lecture Notes in Computer Science. Vol. 229:1998;305-343 Springer, Berlin.
15. Jiménez P., Torras C. Speeding up interference detection between polyhedra. Proc. IEEE Internat. Conference on Robotics and Automation, Minneapolis, MN, Vol. 2. 1996;1485-1492.
16. Kumar V. A general heuristic bottom-up procedure for searching AND/OR graphs. Inform. Sci. Vol. 56:1991;39-57.
17. Mahanti A., Bagchi A. AND/OR graph heuristic search methods. J. ACM. Vol. 32:(1):1985;28-51.
18. Martelli A., Montanari U. Optimizing decision trees through heuristically guided search. Comm. ACM. Vol. 21:(12):1978;1025-1039.
19. Nilsson N.J. Principles of Artificial Intelligence. 1980;Tioga, Palo Alto, CA.
20. Thomas F., Torras C. Inferring feasible assemblies from spatial constraints. IEEE Trans. Robotics and Automation. Vol. 8:(2):1992;228-239.
21. Wilson R., Latombe J.-C. Geometric reasoning about mechanical assembly. Artificial Intelligence. Vol. 71:(2):1994;371-396.