A Parallel Tree Search Method

Nakagawa, Sei-ichi; Sakai, Toshiyuki

A Parallel Tree Search Method

Download BibTeX Cite

Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .

Abstract

We describe a new tree search method which searches best few paths with backtracking in parallel by the following algorithm (a-8-y search). Expand the best a nodes at one time. If the number of new nodes which have been expanded by a selected node exceeds a pre-set threshold (8), only the best 8 nodes are kept and others are pruned. If the total number of newly generated node sequences and non-expanded node sequences exceeds a pre-set threshold (y), only the best y node sequences are kept, and others are removed. Repeat these consecutive processes until a complete sequence is generated . We evaluated this method by simulaUons and experiments, and obtained good performances both in the search efficiency and in the recognition rate.

Sei-ichi Nakagawa, and Toshiyuki Sakai. 1979. A Parallel Tree Search Method. In Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79. IJCAI, https://ijcai.org/proceedings/1979/137

@inproceedings{ijcai1979p137,
  title     = {A Parallel Tree Search Method},
  author    = {Nakagawa, Sei-ichi and Sakai, Toshiyuki},
  booktitle = {Proceedings of the Sixth International Joint Conference on
               Artificial Intelligence, {IJCAI-79}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Bruce G. Buchanan},
  year      = {1979},
  month     = {8},
  url       = {https://ijcai.org/proceedings/1979/137},
}

TY  - CPAPER
TI  - A Parallel Tree Search Method
AU  - Nakagawa, Sei-ichi
AU  - Sakai, Toshiyuki
T2  - Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1979
UR  - https://ijcai.org/proceedings/1979/137
ER  -