淡江大學機構典藏:Item 987654321/60849
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62830/95882 (66%)
造访人次 : 4037357      在线人数 : 600
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/60849


    题名: Ant colony optimization for best path planning
    作者: Hsiao, Ying-tung;Chuang, Cheng-long;Chien, Cheng-chih
    贡献者: 淡江大學電機工程學系
    日期: 2004-10
    上传时间: 2011-10-15 00:58:46 (UTC+8)
    出版者: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: 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.
    關聯: Communications and Information Technology, 2004. ISCIT 2004. IEEE International Symposium on (Volume:1 ), pp.109-113
    DOI: 10.1109/ISCIT.2004.1412460
    显示于类别:[電機工程學系暨研究所] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    Ant Colony Optimization for Best Path Planning.pdf581KbAdobe PDF457检视/开启
    index.html0KbHTML196检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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