A best-first search algorithm guided by a set-valued heuristic
- 1 July 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 25 (7) , 1097-1101
- https://doi.org/10.1109/21.391289
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Stopping Rule for Forecasting Horizons in Nonhomogeneous Markov Decision ProcessesOperations Research, 1992
- A new result on the complexity of heuristic estimates for the A★ algorithmArtificial Intelligence, 1992
- The Optimality of A*Published by Springer Nature ,1988
- Generalized best-first search strategies and the optimality of A*Journal of the ACM, 1985
- A result on the computational complexity of heuristic estimates for the A∗ algorithmInformation Sciences, 1984
- A model of multiattribute decisionmaking and trade-off weight determination under uncertaintyIEEE Transactions on Systems, Man, and Cybernetics, 1984
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision ProblemsOperations Research, 1967