English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69937/69937 (100%)
Visitors : 23277555      Online Users : 582
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/68936


    Title: 應用快速擴展隨機樹和人工魚群演算法及危險度於路徑規劃;Application of the RRT&AFS algorithms with danger degree in path planning
    Authors: 沈昱廷;Shen,Yu-Ting
    Contributors: 電機工程學系
    Keywords: 人工魚群演算法;自走車;危險度地圖;快速擴展隨機樹;路徑規劃;AFSA;Danger Degree Map;Rapidly-exploring Random Tree (RRT);Path Planning;Self-propelled Vehicle
    Date: 2015-08-17
    Issue Date: 2015-09-23 14:46:58 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 對於自走車來說,要如何從一個佈滿各種障礙物的環境中,找到一條合適的路徑,並確保自己能成功的從起始點到達目標點,且行經的路程要是最短的,是個值得研究的方向。
    本篇文章提出一種結合人工魚群演算法(AFSA)和快速擴展隨機樹(RRT)的新型演算法。和過去傳統的人工魚群演算法用於規畫路徑不同的地方在於,它是藉由類似樹枝生長的方式來去增加延伸點,在數個增加的點相互比較後,選擇最佳的延伸點去當做下一條魚的移動位置。
    這個方法改善了人工魚群演算法後期收斂時間慢、不易收斂於全體最佳解的缺點,加上基本的快速擴展隨機樹演算法每次在規畫路徑上並不是那麼穩定,所以本文就利用模擬快速擴展隨機樹演算法的方式去加入到人工魚群演算法,再配合危險度地圖觀念去有效閃避障礙物。
    經過測試,我們可以由數據上顯示這個新式演算法比單一個人工魚群演算法或是快速擴展隨機樹演算法應用在路徑規劃上都好且更穩定,且路徑長度也能是最短的。
    ;In terms of self-propelled vehicles, how to find a suitable route from the environment filled with varied obstacles and how to ensure the target point from the starting point with the minimum passing away can be successfully reached is a direction worthy of research
    In this thesis, the new algorithm in a combination of Artificial Fish Swarm Algorithm (AFSA) and Rapidly-Exploring Random Tree (RRT) is proposed. Compared with the traditional AFSA, the difference of the new algorithm in path planning is it is by similar branch growing up to increase extension points, and after the increase points are compared with each other, the best extension point is chosen as the point of the next moving fish.
    The new algorithm improves the shortcomings of the later-period AFSA in slow convergence time and being hard to be converged in the optimal solution. In addition, the basic RRT algorithm is not so stable on each path planning, so in this paper, the simulation of the RRT algorithm is used to be included in AFSA, with the concept of danger degree map to effectively dodge obstacles.
    After testing, it is shown that the data of the new algorithm on path planning are better than those of either AFSA or RRT and the path is the shortest.
    Appears in Collections:[電機工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML315View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明