English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51883/87052 (60%)
造訪人次 : 8460659      線上人數 : 141
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/94439

    題名: 無線感測網路具克服障礙物之多機器人合作佈建演算法
    其他題名: Cooperative deployment algorithm for wireless sensor networks with obstacles
    作者: 鄧振亞;Teng, Cheng-Ya
    貢獻者: 淡江大學資訊工程學系碩士班
    關鍵詞: 感測器;機器人;合作佈建;sensor;Robot;Cooperative deployment
    日期: 2013
    上傳時間: 2014-01-23 14:38:54 (UTC+8)
    摘要: 在無線感測網路的環境中,感測器的佈建將決定監控效能及硬體成本,如何佈建最少的感測器並達到全區覆蓋,一直是無線感測網路中最重要的問題之一。由於機器人佈建通常較為規則,相較於隨機佈建而言,其可利用較少的感測器便能達到全區覆蓋的目的。在文獻中,現存的機器人佈建演算法通常都只針對單一機器人克服障礙之佈建方式進行討論,較少考慮多台機器人合作佈建的議題。為達到快速完成佈建的目的,本論文將提出利用多台機器人合作佈建之演算法以提升全區佈建的效率。
    In wireless sensor networks (WSNs), sensor deployment is an important issue which intends to deploy sensors in a given monitoring region in a way of low hardware cost and high coverage quality. In literature, some robot deployment algorithms have been proposed. Their performances are mainly determined by the obstacle-resistance capability which refers to how well the robot can overcome the Dead-End problem and deploy minimal number of sensors for achieving full coverage even though the environment contains multiple obstacles. Moreover, most of the existing robot deployment mechanisms consider only single robot for executing the deployment task. This thesis presents a multi-robot cooperative deployment algorithm for multiple robots to cooperate with each other aiming at deploying minimal number of sensors while achieving the full coverage purpose even though the given monitoring region contains unknown obstacles.
    顯示於類別:[資訊工程學系暨研究所] 學位論文


    檔案 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋