English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8679935      Online Users : 64
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/60849

    Title: Ant colony optimization for best path planning
    Authors: Hsiao, Ying-tung;Chuang, Cheng-long;Chien, Cheng-chih
    Contributors: 淡江大學電機工程學系
    Date: 2004-10
    Issue Date: 2011-10-15 00:58:46 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Abstract: The paper presents an optimal approach to search the best path of a map considering the traffic loading conditions. The main objective of this work is to minimize the path length to get the best path planning for a given map. This study proposes a solution algorithm based on the ant colony optimization technique to search the shortest path from a desired origin to a desired destination of the map. The proposed algorithm is implemented in C++. Furthermore, the simulation program can randomly generate maps for evaluating its flexibility and performance. Simulation results demonstrate that the proposed algorithm can obtain the shortest path of a map with fast speed.
    Relation: Communications and Information Technology, 2004. ISCIT 2004. IEEE International Symposium on (Volume:1 ), pp.109-113
    DOI: 10.1109/ISCIT.2004.1412460
    Appears in Collections:[電機工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    Ant Colony Optimization for Best Path Planning.pdf581KbAdobe PDF252View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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