淡江大學機構典藏:Item 987654321/94434
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56829/90534 (63%)
Visitors : 12258903      Online Users : 51
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/94434


    Title: 運用多代理人協同機制於A*最佳路徑之改良 : 以塔防遊戲為例
    Other Titles: Using multi-agent coordination mechanism to improve A* pathfinding on tower defense game
    Authors: 張家銘;Chang, Chia-Ming
    Contributors: 淡江大學資訊工程學系碩士在職專班
    葛煥昭
    Keywords: 多代理人;路徑搜尋;Multi-agent;Pathfinding;A*
    Date: 2013
    Issue Date: 2014-01-23 14:38:31 (UTC+8)
    Abstract: 本研究主要將應用多代理人機制,透過實際開發塔防遊戲為例,改進遊戲的人工智能。過去傳統的塔防遊戲都是使用固定的敵方行走路徑,這樣的設計除了遊戲的挑戰性有限外,也缺少玩家運用策略的變化性。因此,此研究將改以使用 A* 最短路徑演算法來改善基本的路徑搜索方式,再透過多個遊戲物件代理人之間互相的溝通及協調藉以產生路徑的變化進一步改良路徑搜尋演算法,使敵方的路徑選擇和整體智能夠有大幅度的提昇。
    This article uses the multi-agent system coordination mechanism and implements the characteristics of agents to construct and add intelligence to a computer program. By redesigning and developing a tower defense game as an example, this article presents models for coordination and message transmission between agents and creates two new methods to correct the path of the enemies and dynamically generate agents, which largely improves the intelligence of the enemies and towers in the game. Overall, the system changed traditional game rules and made a real-time strategy game more challenging.
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Thesis

    Files in This Item:

    File SizeFormat
    index.html0KbHTML289View/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