The algebraic algorithm A* for the action planning problems

  • Ireneusz Sierocki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 585)


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.


action planning problem strong congruence quotient problem algorithm A* 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Banerji,R.B., “Theory of Problem Solving”, American Elsvier, New York, 1969.Google Scholar
  2. [2]
    Korf,R.E., “ Macro-operators: a weak method for learning“, Artificial Intelligence, 26, 35–77, 1985.Google Scholar
  3. [3]
    Korf,R.E., “Planning as search: a quantitative approach”, Artificial Intelligence, 33, 65–88, 1987.Google Scholar
  4. [4]
    Niizuma,S. and Kitahashi,T.,“ A problem solving method using differences or equivalence relations between states”, Artificial Intelligence, 25, 117–151, 1985.Google Scholar
  5. [5]
    Nilsson.,N., “Principles of Artificial Intelligence”, Tioga Publishers, Palo Alto, CA, 1980.Google Scholar
  6. [6]
    Pearl,J., “Heuristics”, Addison Wesley, 1984.Google Scholar
  7. [7]
    Sacerdoti,E.D., “ Planning in a hierarchy of abstraction space“, Artificial Intelligence, 5, 115–135, 1974.Google Scholar
  8. [8]
    Sierocki,I., “A description of a set of hypotheses for system identification problem”, Int. J.General Systems, 15, 301–319, 1989.Google Scholar
  9. [9]
    Sierocki,I., “Algebraic structure of Macro Problem Solver”, submitted for publication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Ireneusz Sierocki
    • 1
  1. 1.Institute of Technical CyberneticsTechnical University of WrocławWrocławPoland

Personalised recommendations