English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70548/70548 (100%)
Visitors : 23051812      Online Users : 308
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/84269


    Title: 3D Map Exploration and Search using Topological Fourier Sparse Set
    Authors: 呂秉憲;Lu, Bing-Xian
    Contributors: 數學系
    Keywords: 3D 地圖勘探;壓縮感測;物件搜尋;3D map exploration;Compressed sensing;Object search
    Date: 2020-07-17
    Issue Date: 2020-09-02 18:45:12 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 3D地圖探索是機器人技術中的關鍵技術之一。
    然而,由於環境未知,尋找最佳的勘探路徑是一個挑戰。
    這項研究提出了拓撲傅立葉稀疏集(TFSS)演算法,
    使無人飛行器(UAV)能夠在理論上保證探索3D環境效能。
    該演算法由Rips複合體和傅立葉稀疏集組成。
    Rips複合體用於擴展子目標以進行地圖探索,
    而傅立葉稀疏集用於學習子目標選擇的子模函數。
    由於空間探索的目標函數被重新構造為路徑限制下的最大化子模函數,
    貪婪算法可以達到(1/2)(1-e^(-1))的近似最佳值。
    使用該演算法進行的實驗證明,無人機可以比基準方法探索更多環境。
    此外,該演算法顯示了探索問題的持續同調性。;3D map exploration is one of key technologies in robotics.
    However, nding an optimal exploration path is a challenge due to unknown environments.
    This research proposed the Topological Fourier Sparse Set (TFSS) algorithm to enable an unmanned aerial vehicle (UAV) to explore 3D environments with theoretical guarantees.
    The algorithm consists of the Rips complex and Fourier sparse set.
    The Rips complex is to expand subgoals for map exploration while the Fourier sparse set is to learn submodular functions for subgoal selection.
    Since the objective function of spatial exploration is reformulated as a maximizing submodular function with path constraints,
    greedy algorithms can achieve (1/2)(1-e^(-1)) of the optimum.
    Experiments conducted with this algorithm demonstrates that the UAV can explore the environments more than the benchmark approaches.
    Furthermore, the algorithm shows the persistence homology of exploration problems.
    Appears in Collections:[數學研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML42View/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 ©   - Feedback  - 隱私權政策聲明