國立虎尾科技大學 |

Particle Swarm Optimization in the Dynamic Electronic Warfare Battlefield.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Particle Swarm Optimization in the Dynamic Electronic Warfare Battlefield./
作者:	Witcher, Paul Ryan.
面頁冊數:	1 online resource (65 pages)
附註:	Source: Masters Abstracts International, Volume: 56-06.
Contained By:	Masters Abstracts International56-06(E).
標題:	Computer engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9780355188073

Particle Swarm Optimization in the Dynamic Electronic Warfare Battlefield.
Witcher, Paul Ryan.

Particle Swarm Optimization in the Dynamic Electronic Warfare Battlefield. - 1 online resource (65 pages)

Source: Masters Abstracts International, Volume: 56-06.

Thesis (M.S.E.C.E.)--Purdue University, 2017.

Includes bibliographical references

This research improves the realism of an electronic warfare (EW) environment involving dynamic motion of assets and transmitters. Particle Swarm Optimization (PSO) continues to be used to place assets in such a manner where they can communicate with the largest number of highest priority transmitters. This new research accomplishes improvement in three areas. First, the previously stationary assets and transmitters are given a velocity component, allowing them to change positions over time. Because the assets now have a starting position and velocity, they require time to reach the PSO solution. In order to optimally assign each asset to move in the direction of a PSO solution location, a graph-based method is implemented. This encompasses the second area of research. The graph algorithm runs in O(n 3) time and consumes less than 0.2% of the total measured computation time to find a solution. Transmitter location updates prompt a recalculation of the PSO, causing the assets to change their assignments and trajectories every second. The computation required to ensure accuracy with this behavior is less than 0.5% of the total computation time. The final area of research is the completion of algorithmic performance analysis. A scenario with 3 assets and 30 transmitters only requires an average of 147ms to update all relevant information in a single time interval of one second. Analysis conducted on the data collected in this process indicates that more than 95% of the time providing automatic updates is spent with PSO calculations. Recommendations on minimizing the impact of the PSO are also provided in this research.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355188073Subjects--Topical Terms:

569006
Computer engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Particle Swarm Optimization in the Dynamic Electronic Warfare Battlefield.
LDR:02846ntm a2200337Ki 4500 001 919571
005 20181129115238.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355188073
035 $a (MiAaPQ)AAI10274659
035 $a (MiAaPQ)purdue:21422
035 $a AAI10274659
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Witcher, Paul Ryan. $3 1194181
245 1 0 $a Particle Swarm Optimization in the Dynamic Electronic Warfare Battlefield.
264 0 $c 2017
300 $a 1 online resource (65 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Masters Abstracts International, Volume: 56-06.
500 $a Adviser: Lauren Christopher.
502 $a Thesis (M.S.E.C.E.)--Purdue University, 2017.
504 $a Includes bibliographical references
520 $a This research improves the realism of an electronic warfare (EW) environment involving dynamic motion of assets and transmitters. Particle Swarm Optimization (PSO) continues to be used to place assets in such a manner where they can communicate with the largest number of highest priority transmitters. This new research accomplishes improvement in three areas. First, the previously stationary assets and transmitters are given a velocity component, allowing them to change positions over time. Because the assets now have a starting position and velocity, they require time to reach the PSO solution. In order to optimally assign each asset to move in the direction of a PSO solution location, a graph-based method is implemented. This encompasses the second area of research. The graph algorithm runs in O(n 3) time and consumes less than 0.2% of the total measured computation time to find a solution. Transmitter location updates prompt a recalculation of the PSO, causing the assets to change their assignments and trajectories every second. The computation required to ensure accuracy with this behavior is less than 0.5% of the total computation time. The final area of research is the completion of algorithmic performance analysis. A scenario with 3 assets and 30 transmitters only requires an average of 147ms to update all relevant information in a single time interval of one second. Analysis conducted on the data collected in this process indicates that more than 95% of the time providing automatic updates is spent with PSO calculations. Recommendations on minimizing the impact of the PSO are also provided in this research.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer engineering. $3 569006
650 4 $a Electrical engineering. $3 596380
655 7 $a Electronic books. $2 local $3 554714
690 $a 0464
690 $a 0544
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Purdue University. $b Electrical and Computer Engineering. $3 1148521
773 0 $t Masters Abstracts International $g 56-06(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10274659 $z click for full text (PQDT)