| DC 欄位 |
值 |
語言 |
| DC.contributor | 數學系 | zh_TW |
| DC.creator | 趙訢 | zh_TW |
| DC.creator | Hsin Chao | en_US |
| dc.date.accessioned | 2023-1-16T07:39:07Z | |
| dc.date.available | 2023-1-16T07:39:07Z | |
| dc.date.issued | 2023 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=110221022 | |
| dc.contributor.department | 數學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 這篇論文專注於多機器人追逐單一目標的追趕問題。在已知的地
圖上， 目標為最大化目標物的偵測機率。此研究提出以聚類演算法與
貪婪演算法來解決這個問題， 在目標函數為次模函數的情況下， 貪
婪演算法帶有理論保證值。模擬證實了提出的演算法比起另一個演算
法更好。 | zh_TW |
| dc.description.abstract | This research focuses on pursuit-evasion(PE) games with multi-pursuer and an evader. Given the map, the objective function is to maximize the probability of the evader detection. The proposed algorithms compute search path of pursuers via cluster algorithm and greedy algorithms. Since the objective function is submodular, the algorithms have theoretical guarantees. The simulations demonstrate that the proposed method outperforms benchmark approaches. | en_US |
| DC.subject | 次模性 | zh_TW |
| DC.subject | 追趕問題 | zh_TW |
| DC.subject | 多機器人合作, | zh_TW |
| DC.subject | 機率搜尋 | zh_TW |
| DC.subject | Submodularity | en_US |
| DC.subject | Pursuit-evasion games | en_US |
| DC.subject | Multi-robot cooperation | en_US |
| DC.subject | Probability search | en_US |
| DC.title | Evasion and Pursuit Games via Adaptive Submodularity | 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 |