English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78345/78345 (100%)
Visitors : 32479753      Online Users : 1453
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/91995


    Title: 應用基因演算法於光轉置技術矩陣轉移之研究;Application of Genetic Algorithm in Optical Transposition Technology: A Study of Matrix Transfer
    Authors: 孫浩倫;Sun, Hao-Lun
    Contributors: 光機電工程研究所
    Keywords: 最佳化演算法;矩陣轉移;雷射前向誘導;巨量轉移
    Date: 2023-08-17
    Issue Date: 2023-10-04 14:52:28 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 近年來顯示器產業的發展飛速般成長,Mini/Micro LED 的巨量轉移技術仍尚未成熟,
    故本研究比較不同的巨量轉移技術,並探討如何在光轉置技術中應用最佳化演算法進行
    矩陣轉移。意旨利用雷射誘導前向轉移(Laser Induced Forward Transfer, LIFT)技術,開發
    一種基於最小公倍數邏輯的面轉移方法,且可滿足隨意調整接收基板上 LED 之間的間
    距。
    本研究運用最佳化演算法解決面轉移中的優化問題,嘗試以較短的時間、較少的次
    數完成轉移,並透過 GUI 介面顯示運算與模擬結果。這些演算法基於最小公倍數原理,
    將路徑進行最佳化計算,以找到最佳的轉移路徑和參數設定。
    研究結果表明,將最佳化演算法應用於光轉置技術的矩陣轉移之方法,相較於逐顆轉移
    可以大幅提高轉移的效率。這種基於最小公倍數概念的面轉移方法在模擬中取得了良好
    的效果,能夠在短時間內完成大面積的巨量轉移。
    本研究的成果對於光轉置技術的應用具有重要意義,除了使用在 LED 巨量轉移上,
    還可應用於其他不同的製程:如 LED 分選、微小矩陣元件之轉移等等。故本研究之貢
    獻在於提出一套矩陣轉移邏輯結合最佳化演算法,用來解決目前 LIFT 在可調變節距的
    需求下轉移過慢之問題,且為少數應用於提高 LIFT 速度的最佳化演算法。;In recent years, the display industry has witnessed rapid growth and development. However,
    the mass transfer technology for Mini/Micro LED is still in its nascent stage. Therefore, this
    study aims to compare various mass transfer techniques and explore the application of
    optimization algorithms in the field of optical transposition technology, specifically focusing
    on Laser Induced Forward Transfer (LIFT). The goal is to develop a matrix transfer method
    based on the principles of the least common multiple (LCM) logic, which allows for flexible
    adjustment of the spacing between LEDs on the receiving substrate.
    This research employs optimization algorithms to address optimization challenges in matrix
    transfer. The aim is to achieve transfer with reduced time and minimal iterations through LIFT
    technology, while presenting computation and simulation results through a graphical user
    interface (GUI). These algorithms, rooted in the concept of least common multiple, optimize
    the transfer path calculations to identify the optimal transfer path and parameter settings.
    The research findings indicate that applying optimization algorithms to matrix transfer in
    optical transposition technology significantly enhances transfer efficiency compared to
    individual LED transfers. This LCM-based matrix transfer approach demonstrates promising
    simulation results, achieving efficient mass transfer over a large area within a short time.
    The outcomes of this research hold significant implications for the application of optical
    transposition technology. Apart from its usage in mass transfer for LEDs, this approach can be
    extended to various processes, such as LED sorting and transfer of micro-matrix components.
    Thus, the contribution of this research lies in proposing a matrix transfer logic integrated with
    optimization algorithms to address the issue of slow transfer speeds in LIFT under the
    requirement of adjustable spacing. This approach stands as one of the few optimization
    algorithms aimed at enhancing LIFT speed and holds relevance for its potential application
    across diverse fields.
    Appears in Collections:[光機電工程研究所 ] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML25View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明