| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 謝瑞煦 | zh_TW |
| DC.creator | Rei-Shu Shieh | en_US |
| dc.date.accessioned | 2023-7-25T07:39:07Z | |
| dc.date.available | 2023-7-25T07:39:07Z | |
| dc.date.issued | 2023 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=110221001 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 在未知環境中進行地圖探勘是具有挑戰性的，因為最大化覆蓋率
是個NP-hard的問題，這項研究提出了基於動態更新樹狀結構路徑而
最大化覆蓋率之邊際效益的方法。由於缺少環境資訊，樹狀結構路徑
需於不同時間段進行更新。因此，此項研究證明出每個時間段的理論
保證值。實驗結果說明此項研究提出的方法效能更勝於其他方法。 | zh_TW |
| dc.description.abstract | Map exploration in unknown environments is challenging since finding the optimal solution to maximize the environmental coverage is NPhard. This research proposes a method that maximizes the dynamic marginal gain of the coverage with the tree-Structured routing. Since the map is unknown, the tree-structured routing is dynamically updated at each time step. Thus, the theoretical guarantees at each time step are proved. The experiments show that the proposed method outperforms benchmark methods. | en_US |
| DC.subject | 次模性 | zh_TW |
| DC.subject | 3D地圖探勘 | zh_TW |
| DC.subject | 最大覆蓋問題 | zh_TW |
| DC.subject | Submodularity | en_US |
| DC.subject | 3D map exploration | en_US |
| DC.subject | Maximal coverage problem | en_US |
| DC.title | Map Explorations via Dynamic Tree-Structured Graph | en_US |
| dc.language.iso | en_US | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |