RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재

    고밀도 소자 배치를 위한 전략적 회귀 기반 MCTS 탐색 알고리즘 = Strategic Backtracking-Based MCTS Search Algorithm for High-Density Component Placement

    한글로보기

    https://www.riss.kr/link?id=A110338421

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
      • URL 복사
    • 오류접수
    인용문이 복사되었습니다.

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    With the increasing demand for high-performance and compact electronic devices, spatial optimization techniques for the optimal placement of components within restricted areas have become crucial. This paper proposes a Strategic Backtracking and Pruning algorithm based on Monte Carlo Tree Search (MCTS) to solve the component placement problem characterized by a vast search space. While conventional MCTS suffers from reduced search efficiency when encountering deadlocks, the proposed algorithm overcomes this limitation through non-sequential backtracking based on an elite candidate pool. Furthermore, an integer grid system and GPU kernel acceleration were implemented to minimize computational overhead. Experimental results demonstrate that the proposed method achieves a 95.3% placement rate within an execution time of 22.9 seconds for 100,000 iterations, proving its superior performance in both search speed and success rate compared to existing methods. Compared to the standard MCTS with large-first strategy, the proposed method reduces execution time by approximately 95% (from 759.3 seconds to 22.9 seconds) while improving the placement success rate from 71.3% to 95.3%, corresponding to an increase of 24.0 percentage points.
    번역하기

    With the increasing demand for high-performance and compact electronic devices, spatial optimization techniques for the optimal placement of components within restricted areas have become crucial. This paper proposes a Strategic Backtracking and Pruni...

    With the increasing demand for high-performance and compact electronic devices, spatial optimization techniques for the optimal placement of components within restricted areas have become crucial. This paper proposes a Strategic Backtracking and Pruning algorithm based on Monte Carlo Tree Search (MCTS) to solve the component placement problem characterized by a vast search space. While conventional MCTS suffers from reduced search efficiency when encountering deadlocks, the proposed algorithm overcomes this limitation through non-sequential backtracking based on an elite candidate pool. Furthermore, an integer grid system and GPU kernel acceleration were implemented to minimize computational overhead. Experimental results demonstrate that the proposed method achieves a 95.3% placement rate within an execution time of 22.9 seconds for 100,000 iterations, proving its superior performance in both search speed and success rate compared to existing methods. Compared to the standard MCTS with large-first strategy, the proposed method reduces execution time by approximately 95% (from 759.3 seconds to 22.9 seconds) while improving the placement success rate from 71.3% to 95.3%, corresponding to an increase of 24.0 percentage points.

    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    해외이동버튼