Abstract
This paper proposes new heuristic distributed parallel algorithms for searching and planning, which are based on the concepts of wave concurrent propagations and competitive activation mechanisms. These algorithms are characterized by simplicity and clearness of control strategies for searching, and distinguished abilities in many aspects, such as high speed processing, wide suitability for searching AND/OR implicit graphs, and ease in hardware implementation.
Similar content being viewed by others
References
Pearl J. Heuristics, intelligent search strategies for computer problem solving. Addison-Wesley Publishing Company, 1984.
Benain M, Samuelides M. Dynamic properties of neural nets using competitive activation mechanism. InProc. of IJCNN'90, Vol.III, pp.541–546.
Shuai Dianxun, Watanabe Yoichiro. A hierarchy neural network approach to symbolic logic algorithms of problem solving. InProc. of IJCNN'93-NAGOYA, Japan, pp.1606–1610.
Shuai Dianxun. An approach to solving the longest common subsequences, based on stringcoding functional and neural network. InProc. of IEEE International Conference on System Engineering, 1992-Kobe, Japan, 564–567.
Shuai Dianxun. A homomorphic harmony network approach to solving the unification problem. InProc. of IJCNN'92, Beijing, Vol.I, pp.564–571.
Author information
Authors and Affiliations
Additional information
Supported by the CNNSF under Grant No.69073316, the CNHTDP under Grant No. 5120402 and the research foundation of Doshisha University, Japan.
For the biography ofShuai Dianxun please see p.133 of this volume.
Rights and permissions
About this article
Cite this article
Shuai, D. New heuristic distributed parallel algorithms for searching and planning. J. of Comput. Sci. & Technol. 10, 354–374 (1995). https://doi.org/10.1007/BF02943504
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943504