English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69937/69937 (100%)
Visitors : 23332652      Online Users : 535
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/72144

    Title: 使用人工蜂群演算法和快速搜索隨機樹改進路徑規劃系統之研究;Using ABC and RRT Algorithms to Improve Path Planning
    Authors: 崔嶽;Tusi,Yue
    Contributors: 電機工程學系
    Keywords: 人工蜂群演算法;快速搜索隨機樹;移動機器人;路徑規劃;危險度;Artificial bee colony;Rapidly-exploring Random Tree;Path Planning;Mobile Robot;Danger Degree Map
    Date: 2016-07-15
    Issue Date: 2016-10-13 14:28:14 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 本研究以人工蜂群演算法(ABC)結合快速搜索隨機樹(RRT)來創新路徑規劃演算法應用在移動式機器人當中,路徑規劃對於移動機器人是非常重要的研究之一,本文目的是如何在有障礙物的環境中,規劃出一條適合行走且無危險和有效率的路徑,讓機器人從起始點移動到目標點是安全且正確的。
    ;In this study, we use the Artificial Bee Colony algorithm incorporating the fast search Random Tree (RRT) for innovation path planning, and is implemented in a mobile robot. Path planning for mobile robot is one of the very important researches. The aim is how to plan a path in the environment which have obstacles, and make the robot walk from start point to target safely and correctly.
    Different from conventional algorithms, we use the RRT algorithm to find several extending points, and after comparison we choose the best extending point to make the extension of bees move. Because Artificial Bee Colony algorithm is simple structure, easy operation and fast convergence, it improved the problem of path planning which in the slow convergence and easy to local optimal solution in previous path planning algorithms. While the RRT has excellent characteristics in seeking unknown area, it is unstable for each planning. We herein combine the characteristics of artificial bee colony with the RRT algorithms to deal with the problem of obstacles and make practical simulation in a mobile robot.
    In summary, it is shown that the data of the new algorithm on path planning are much more effective and stable than those of either single ABC or single RRT, and the path is the shortest.
    Appears in Collections:[電機工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat

    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  - 隱私權政策聲明