在未知環境中進行地圖探勘是具有挑戰性的，因為最大化覆蓋率 是個NP-hard的問題，這項研究提出了基於動態更新樹狀結構路徑而 最大化覆蓋率之邊際效益的方法。由於缺少環境資訊，樹狀結構路徑 需於不同時間段進行更新。因此，此項研究證明出每個時間段的理論 保證值。實驗結果說明此項研究提出的方法效能更勝於其他方法。;Map exploration in unknown environments is challenging since find ing the optimal solution to maximize the environmental coverage is NP hard. 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.
