Abstract
This paper proposes a new algebraic-and-heuristic search algorithm, called the algebraic algorithm A*. An algebraic analysis of the action planning problems is performed. A solution-preservation theorem is proved. Finally, it is shown that the algorithm is correct.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Banerji,R.B., “Theory of Problem Solving”, American Elsvier, New York, 1969.
Korf,R.E., “ Macro-operators: a weak method for learning“, Artificial Intelligence, 26, 35–77, 1985.
Korf,R.E., “Planning as search: a quantitative approach”, Artificial Intelligence, 33, 65–88, 1987.
Niizuma,S. and Kitahashi,T.,“ A problem solving method using differences or equivalence relations between states”, Artificial Intelligence, 25, 117–151, 1985.
Nilsson.,N., “Principles of Artificial Intelligence”, Tioga Publishers, Palo Alto, CA, 1980.
Pearl,J., “Heuristics”, Addison Wesley, 1984.
Sacerdoti,E.D., “ Planning in a hierarchy of abstraction space“, Artificial Intelligence, 5, 115–135, 1974.
Sierocki,I., “A description of a set of hypotheses for system identification problem”, Int. J.General Systems, 15, 301–319, 1989.
Sierocki,I., “Algebraic structure of Macro Problem Solver”, submitted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sierocki, I. (1992). The algebraic algorithm A * for the action planning problems. In: Pichler, F., Díaz, R.M. (eds) Computer Aided Systems Theory — EUROCAST '91. EUROCAST 1991. Lecture Notes in Computer Science, vol 585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021038
Download citation
DOI: https://doi.org/10.1007/BFb0021038
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55354-0
Online ISBN: 978-3-540-47034-2
eBook Packages: Springer Book Archive