Multiple-paths search with concurrent thread scheduling for fast AND/OR tree search

Fumiyo Takano, Yoshitaka Maekawa, Hironori Kasahara

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)

    Abstract

    This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only a descending order of heuristic evaluation values. However, since the evaluation values are heuristic, a solution node group sometimes includes nodes with lower evaluation values. The tree which has a solution node group including nodes with lower evaluation values requires a long time to be solved by the conventional algorithms. The proposed algorithm allows us to search paths including nodes with lower evaluation values and paths including nodes with higher evaluation values concurrently. For searching various paths concurrently, the proposed algorithm uses pseudo-threads and a pseudo-thread scheduler managed by a user program with low overhead compared with the OS thread management. The pseudo-thread scheduler can weight the amount of search on each path and schedule the pseudo-threads. The proposed algorithm can solve trees which have solutions including nodes with lower evaluation values also quickly. For performance evaluation, the proposed algorithm was applied to a tsume-shogi (Japanese chess problem) solver as a typical AND/OR tree search problem. In tsume-shogi, players can reuse captured pieces. Performance evaluation results on 385 problems show that the proposed algorithm is 1.67 times faster on the average than the previous algorithm df-pn.

    Original languageEnglish
    Title of host publicationProceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009
    Pages51-58
    Number of pages8
    DOIs
    Publication statusPublished - 2009
    EventInternational Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009 - Fukuoka
    Duration: 2009 Mar 162009 Mar 19

    Other

    OtherInternational Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009
    CityFukuoka
    Period09/3/1609/3/19

    Fingerprint

    Scheduling

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Software
    • Control and Systems Engineering

    Cite this

    Takano, F., Maekawa, Y., & Kasahara, H. (2009). Multiple-paths search with concurrent thread scheduling for fast AND/OR tree search. In Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009 (pp. 51-58). [5066768] https://doi.org/10.1109/CISIS.2009.65

    Multiple-paths search with concurrent thread scheduling for fast AND/OR tree search. / Takano, Fumiyo; Maekawa, Yoshitaka; Kasahara, Hironori.

    Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009. 2009. p. 51-58 5066768.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Takano, F, Maekawa, Y & Kasahara, H 2009, Multiple-paths search with concurrent thread scheduling for fast AND/OR tree search. in Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009., 5066768, pp. 51-58, International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009, Fukuoka, 09/3/16. https://doi.org/10.1109/CISIS.2009.65
    Takano F, Maekawa Y, Kasahara H. Multiple-paths search with concurrent thread scheduling for fast AND/OR tree search. In Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009. 2009. p. 51-58. 5066768 https://doi.org/10.1109/CISIS.2009.65
    Takano, Fumiyo ; Maekawa, Yoshitaka ; Kasahara, Hironori. / Multiple-paths search with concurrent thread scheduling for fast AND/OR tree search. Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009. 2009. pp. 51-58
    @inproceedings{322d68abfe4e48e8a93f6592cac3fd9a,
    title = "Multiple-paths search with concurrent thread scheduling for fast AND/OR tree search",
    abstract = "This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only a descending order of heuristic evaluation values. However, since the evaluation values are heuristic, a solution node group sometimes includes nodes with lower evaluation values. The tree which has a solution node group including nodes with lower evaluation values requires a long time to be solved by the conventional algorithms. The proposed algorithm allows us to search paths including nodes with lower evaluation values and paths including nodes with higher evaluation values concurrently. For searching various paths concurrently, the proposed algorithm uses pseudo-threads and a pseudo-thread scheduler managed by a user program with low overhead compared with the OS thread management. The pseudo-thread scheduler can weight the amount of search on each path and schedule the pseudo-threads. The proposed algorithm can solve trees which have solutions including nodes with lower evaluation values also quickly. For performance evaluation, the proposed algorithm was applied to a tsume-shogi (Japanese chess problem) solver as a typical AND/OR tree search problem. In tsume-shogi, players can reuse captured pieces. Performance evaluation results on 385 problems show that the proposed algorithm is 1.67 times faster on the average than the previous algorithm df-pn.",
    author = "Fumiyo Takano and Yoshitaka Maekawa and Hironori Kasahara",
    year = "2009",
    doi = "10.1109/CISIS.2009.65",
    language = "English",
    isbn = "9780769535753",
    pages = "51--58",
    booktitle = "Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009",

    }

    TY - GEN

    T1 - Multiple-paths search with concurrent thread scheduling for fast AND/OR tree search

    AU - Takano, Fumiyo

    AU - Maekawa, Yoshitaka

    AU - Kasahara, Hironori

    PY - 2009

    Y1 - 2009

    N2 - This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only a descending order of heuristic evaluation values. However, since the evaluation values are heuristic, a solution node group sometimes includes nodes with lower evaluation values. The tree which has a solution node group including nodes with lower evaluation values requires a long time to be solved by the conventional algorithms. The proposed algorithm allows us to search paths including nodes with lower evaluation values and paths including nodes with higher evaluation values concurrently. For searching various paths concurrently, the proposed algorithm uses pseudo-threads and a pseudo-thread scheduler managed by a user program with low overhead compared with the OS thread management. The pseudo-thread scheduler can weight the amount of search on each path and schedule the pseudo-threads. The proposed algorithm can solve trees which have solutions including nodes with lower evaluation values also quickly. For performance evaluation, the proposed algorithm was applied to a tsume-shogi (Japanese chess problem) solver as a typical AND/OR tree search problem. In tsume-shogi, players can reuse captured pieces. Performance evaluation results on 385 problems show that the proposed algorithm is 1.67 times faster on the average than the previous algorithm df-pn.

    AB - This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only a descending order of heuristic evaluation values. However, since the evaluation values are heuristic, a solution node group sometimes includes nodes with lower evaluation values. The tree which has a solution node group including nodes with lower evaluation values requires a long time to be solved by the conventional algorithms. The proposed algorithm allows us to search paths including nodes with lower evaluation values and paths including nodes with higher evaluation values concurrently. For searching various paths concurrently, the proposed algorithm uses pseudo-threads and a pseudo-thread scheduler managed by a user program with low overhead compared with the OS thread management. The pseudo-thread scheduler can weight the amount of search on each path and schedule the pseudo-threads. The proposed algorithm can solve trees which have solutions including nodes with lower evaluation values also quickly. For performance evaluation, the proposed algorithm was applied to a tsume-shogi (Japanese chess problem) solver as a typical AND/OR tree search problem. In tsume-shogi, players can reuse captured pieces. Performance evaluation results on 385 problems show that the proposed algorithm is 1.67 times faster on the average than the previous algorithm df-pn.

    UR - http://www.scopus.com/inward/record.url?scp=70349745327&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=70349745327&partnerID=8YFLogxK

    U2 - 10.1109/CISIS.2009.65

    DO - 10.1109/CISIS.2009.65

    M3 - Conference contribution

    AN - SCOPUS:70349745327

    SN - 9780769535753

    SP - 51

    EP - 58

    BT - Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2009

    ER -