Study on Multi-Agent Joint Parallel Computing for the Unknown Situation Path Explore / Exploit Search

碩士 === 元智大學 === 工業工程與管理學系 === 100 === Modern electronic warfare systems, the information loading and timeliness requirements is keep growing. How to quickly deal with these intelligence and the integration of computing under limited resources and time has become very important. MPI parallel computin...

Full description

Bibliographic Details
Main Authors: Chang-Kuo Chen, 陳章國
Other Authors: Yee-MingChen
Format: Others
Language:zh-TW
Online Access:http://ndltd.ncl.edu.tw/handle/84497063647445283787
id ndltd-TW-100YZU05031090
record_format oai_dc
spelling ndltd-TW-100YZU050310902015-10-13T21:33:10Z http://ndltd.ncl.edu.tw/handle/84497063647445283787 Study on Multi-Agent Joint Parallel Computing for the Unknown Situation Path Explore / Exploit Search 多重代理人及平行運算在未知情境之路徑探索/搜尋研究 Chang-Kuo Chen 陳章國 碩士 元智大學 工業工程與管理學系 100 Modern electronic warfare systems, the information loading and timeliness requirements is keep growing. How to quickly deal with these intelligence and the integration of computing under limited resources and time has become very important. MPI parallel computing provides decision-makers a way that dramatically reduce the computation time within the limited resources, MPI combine with digital pheromones particle swarm optimization by using the particle swarm to find out the optimal solutions through the swarms communication of the MPI parallel. The global optimal exploration then transits to a local exploit search. The local exploit search use Unity 3D and multi-agent with A * path finding method to search the shortest path and threat avoidance. We construct the agent behavior parameters for decision-makers adjust depth study and compare the simulation results under different scenarios. Yee-MingChen 陳以明 學位論文 ; thesis 87 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 元智大學 === 工業工程與管理學系 === 100 === Modern electronic warfare systems, the information loading and timeliness requirements is keep growing. How to quickly deal with these intelligence and the integration of computing under limited resources and time has become very important. MPI parallel computing provides decision-makers a way that dramatically reduce the computation time within the limited resources, MPI combine with digital pheromones particle swarm optimization by using the particle swarm to find out the optimal solutions through the swarms communication of the MPI parallel. The global optimal exploration then transits to a local exploit search. The local exploit search use Unity 3D and multi-agent with A * path finding method to search the shortest path and threat avoidance. We construct the agent behavior parameters for decision-makers adjust depth study and compare the simulation results under different scenarios.
author2 Yee-MingChen
author_facet Yee-MingChen
Chang-Kuo Chen
陳章國
author Chang-Kuo Chen
陳章國
spellingShingle Chang-Kuo Chen
陳章國
Study on Multi-Agent Joint Parallel Computing for the Unknown Situation Path Explore / Exploit Search
author_sort Chang-Kuo Chen
title Study on Multi-Agent Joint Parallel Computing for the Unknown Situation Path Explore / Exploit Search
title_short Study on Multi-Agent Joint Parallel Computing for the Unknown Situation Path Explore / Exploit Search
title_full Study on Multi-Agent Joint Parallel Computing for the Unknown Situation Path Explore / Exploit Search
title_fullStr Study on Multi-Agent Joint Parallel Computing for the Unknown Situation Path Explore / Exploit Search
title_full_unstemmed Study on Multi-Agent Joint Parallel Computing for the Unknown Situation Path Explore / Exploit Search
title_sort study on multi-agent joint parallel computing for the unknown situation path explore / exploit search
url http://ndltd.ncl.edu.tw/handle/84497063647445283787
work_keys_str_mv AT changkuochen studyonmultiagentjointparallelcomputingfortheunknownsituationpathexploreexploitsearch
AT chénzhāngguó studyonmultiagentjointparallelcomputingfortheunknownsituationpathexploreexploitsearch
AT changkuochen duōzhòngdàilǐrénjípíngxíngyùnsuànzàiwèizhīqíngjìngzhīlùjìngtànsuǒsōuxúnyánjiū
AT chénzhāngguó duōzhòngdàilǐrénjípíngxíngyùnsuànzàiwèizhīqíngjìngzhīlùjìngtànsuǒsōuxúnyánjiū
_version_ 1718066166965993472