Path Planning of Anti ship Missile based on Voronoi Diagram and Binary Tree Algorithm

The path planning of anti-ship missile should be considered both cruising in safety and striking in quick, which is an intractable problem. In particular, it is difficult to consider the safety of each missile path in the path planning of multiple missiles. To solve this problem, the “AREA Algorithm...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Defense science journal Ročník 69; číslo 4; s. 369 - 377
Hlavní autoři: Shi, Yan, Zhang, Lihua, Dong, Shouquan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New Delhi Defence Scientific Information & Documentation Centre 01.07.2019
Témata:
Algorithms
Antiship missiles
Computer simulation
Dijkstra's algorithm
Missiles
Path planning
Product design
Safety
Topology
Voronoi graphs
ISSN:0011-748X, 0976-464X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The path planning of anti-ship missile should be considered both cruising in safety and striking in quick, which is an intractable problem. In particular, it is difficult to consider the safety of each missile path in the path planning of multiple missiles. To solve this problem, the “AREA Algorithm” is presented to divide the relative relations of areas：relative security area of the threat areas and fast-attack area of target approaching. Specifically，it is a way to achieve area division through the relationship between the target and the center of the operational area. The Voronoi diagram topology network, Dijkstra algorithm and binary tree algorithm have been used in the above process as well. Finally, Simulations have verified the feasibility and obvious advantages of “AREA Algorithm” compared with the single algorithm, and the tactical meaning in path planning of multiple missiles.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0011-748X
0976-464X
DOI:10.14429/dsj.69.14062