A general heuristic bottom-up procedure for searching and/or graphs☆
References (25)
- et al.
Admissible heuristic search in AND/OR graphs
Theor. Comp. Sci.
(1983) The B∗ tree search algorithm: A best-first proof procedure
Artificial Intelligence
(1979)Solvable classes of discrete dynamic programming
J. Math. Anal. Appl.
(1973)- et al.
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
Artificial Intelligence
(1983) - et al.
General branch-and-bound and its relation to A∗ and AO∗
Artificial Intelligence
(1984) A minimax algorithm better than alpha-beta?
Artificial Intelligence
(1979)- et al.
The Design and Analysis of Computer Algorithms
(1974) - et al.
Artificial Intelligence
(1971) A note on two problems in connection with graphs
Numer. Math.
(1959)- et al.
The Art and Theory of Dynamic Programming
(1977)
Dynamic programming as graph searching
JACM
(1982)
Branch-and-bound and beyond
Cited by (4)
Efficient algorithm for searching implicit AND/OR graphs with cycles
2000, Artificial IntelligenceSemantic-aware real-time scheduling in robotics
2013, IEEE Transactions on RoboticsCombinatorial optimization problem reduction and algorithm derivation
2011, Ruan Jian Xue Bao/Journal of SoftwareUsing the internal logic of a topos to model search spaces for problems
2007, Logic Journal of the IGPL
- ☆
This work was supported in part by Army Research Office grant #DAAG29-84-K-0060 to the Artificial Intelligence Laboratory at the University of Texas at Austin, when the author was on the faculty at the University of Texas.
Copyright © 1991 Published by Elsevier Inc.