| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 邱韋翔 | zh_TW |
| DC.creator | Wei-Hsiang Chiu | 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:88/thesis/view_etd.asp?URN=109221013 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 資訊軌跡規劃 (IPP) 是無人機的關鍵應用之一。它可以重新定義為在軌跡限制下的次模性最大化問題。然而，尋找最佳搜索軌跡包括兩個NP-hard問題，即最大覆蓋問題和最小路徑問題。此研究提出成 本效益生成樹(CBST) ，以提高IPP 的效能。理論說明樹的總曲率影響了理論保證值。實驗表明，所提出的 CBST 演算法的效能比其他演算法的效能更好。 | zh_TW |
| dc.description.abstract | Informative path planning (IPP) is one of key applications for unmanned aerial vehicles (UAVs). It can be formulated as the submodular maximization problem with routing constraints. However, fi nding an optimal search path includes two NP-hard problems, the covering problem and routing problem. In this research, the proposed algorithm generates the cost-benefi t spanning tree (CBST) to boost the IPP performance. The proofs show the theoretical guarantees depends on the total curvatures of the trees. The experiments demonstrate that the proposed method outperforms the benchmark approaches. | en_US |
| DC.subject | 機率搜尋 | zh_TW |
| DC.subject | 次模性 | zh_TW |
| DC.subject | 普林-戴克斯特拉演算法 | zh_TW |
| DC.subject | 資訊軌跡規劃 | zh_TW |
| DC.subject | 空中機器人 | zh_TW |
| DC.subject | 貪婪演算法 | zh_TW |
| DC.title | 使用成本效益生成樹的資訊軌跡規劃 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Informative path planning via cost-benefit spanning tree | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |