Abstract
We propose a formal generalization for various works dealing with Heuristic Search in state graphs. This generalization focuses on the properties of the evaluation functions, on the characteristics of the state graphs, on the notion of path length, on the procedures that control the choices of the node expansions, on the rules that govern the updating operations. Consequently, we present new theorems about the subadmissibility. These theorems widely extend the analogous results previously published concerning Nilsson's A* algorithms and diverse successors due to Pohl (HPA), Harris (particular A), Martelli (B), Pearl and Kim (A* ε), Ghallab and Allard (Aε), Bagchi and Mahanti (C), Pearl (BF*), Mero (B′), Korf (IDA*), Mahanti and Ray (D), Dechter and Pearl (A**). They provide a theoretical support for using diverse kinds of Heuristic Search algorithms in enlarged contexts.
Preview
Unable to display preview. Download preview PDF.
References
A. Bagchi and A. Mahanti, Search algorithms under different kinds of heuristics — A comparative study, J. ACM 30 (1) (1983) 1–27.
A. Bagchi and A. Mahanti, Three approaches to heuristic search in networks, J. ACM 32 (1) (1985) 1–27.
R. Dechter and J. Pearl, Generalized best-first search strategies and the optimality of A*, J. ACM 32 (3) (1985) 505–536.
R. Dechter and J. Pearl, The optimality of A*, in: L. Kanal and D. Kumar, eds, Search in Artificial Intelligence (Springer-Verlag, 1988) 166–199.
D. Dubois, H. Farreny and Henri Prade, Combinatorial search with fuzzy estimates, in: J. Kacprzyk and S. A. Orlowski, eds, Optimization models using fuzzy sets and possibility theory (D. Reidel publishing company, 1987) 171–185.
D. Dubois, J. Lang and H. Prade, Theorem proving under uncertainty. A possibility theory-based approach, in: Proceedings 10th IJCAI, Milan, Italy (1987) 984–986.
D. Dubois and H. Prade, Possibility theory — An Approach to Computerized Processing of Uncertainty, (Plenum, 1988).
H. Farreny, Recherche Heuristiquement Ordonnie — Algorithmes et propriétés, (Masson, Paris, 1995).
H. Farreny, Une généralisation pour la Recherche Heuristiquement Ordonnée: les algorithmes ϱ et la propriété d'arrêt avec découverte de solution, in: Proceedings of RFIA 96, Rennes, France (1996) 225–234.
D. Gelperin, On the optimality of A*, Artificial Intelligence 8 (1) (1977) 69–76.
M. Ghallab, Optimisation de processus décisionnels pour la robotique, Thèse de Doctorat d'Etat, Université Paul Sabatier, Toulouse, France (1982).
M. Ghallab and D. G. Allard, Aε: An efficient near admissible heuristic search algorithm, in: Proceedings 8th IJCAI, Karlsruhe, Germany (1983) 789–791.
R. Gonella, Diagnostic de pannes sur avions: mise en oeuvre d'un raisonnement révisable, Thèse de l'École Nationale Supérieure de l'Aéronautique et de l'Espace, Toulouse, France (1989).
L. R. Harris, The heuristic search under conditions of error, Artificial Intelligence 5 (3) (1974) 217–234.
P. E. Hart, N. J. Nilsson and B. Raphael-A formal basis for the heuristic determination of minimal cost paths, IEEE Trans. SSC 4 (1968) 100–107.
R. E. Korf, Depth-first iterative-deepening: an optimal admissible tree search, Artificial Intelligence 27 (1985) 97–109.
A. Mahanti and K. Ray, Network search algorithms with modifiable heuristics, in L. Kanal and D. Kumar, eds, Search in Artificial Intelligence, (Springer-Verlag, 1988) 200–222.
A. Martelli, On the complexity of admissible search algorithms, Artificial Intelligence 8 (1) (1977) 1–13.
L. Mero, A heuristic search algorithm with modifiable estimate, Artificial Intelligence 23 (1) (1984) 13–27.
N. J. Nilsson, Problem-solving methods in artificial intelligence, (Mc Graw-Hill, 1971).
N. J. Nilsson, Principles of artificial intelligence, (Tioga, 1980).
J. Pearl, Some recent results in heuristic search theory, IEEE Trans. on PAMI 6 (1) (1984) 1–12.
J. Pearl, Heuristics: intelligent search strategies for computer problem solving (Addison-Wesley, 1984).
J. Pearl and J. H. Kim, Studies in semi-admissible heuristics, IEEE Trans. on PAMI 4 (4) (1982) 392–400.
I. Pohl, First results on the effect of error in heuristic search, in: B. Meltzer and D. Michie, eds, Machine Intelligence 5 (Edinburgh University Press, 1969) 219–236.
I. Pohl, The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving, in Proceedings 3d IJCAI, Stanford, USA (1973) 12–17.
M. J. Schoppers, On A* as a special case of ordered search, Proc. 8th IJCAI, Karlsruhe, Germany (1983) 783–785.
H. A. Simon, Search and Reasoning in Problem Solving, Artificial Intelligence 21 (1–2) (1983) 7–29.
B. Steward, C. F. Liaw and C. C. White III, A bibliography of Heuristic Search Research Through 1992, IEEE transactions on Systems, Man, and Cybernetics 24 (2) (1994) 268–293.
R. R. Yager, Paths of least resistance in possibilistic production systems, Fuzzy sets and systems 19 (1986) 121–132.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farreny, H. (1997). New results about sub-admissibility for general families of heuristic search algorithms. In: Coasta, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 1997. Lecture Notes in Computer Science, vol 1323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023926
Download citation
DOI: https://doi.org/10.1007/BFb0023926
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63586-4
Online ISBN: 978-3-540-69605-6
eBook Packages: Springer Book Archive