비행체의 경로최적화Path Optimization for Aircraft

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 307
  • Download : 131
This paper shows a new efficient solution method of finding an optimal path for a cruise missile or aircraft to a target which has the maximal survivability and penetration effectiveness against sophisticated defenses and over varied terrain. We first generate a grid structure over the terrain, to construct a network. Since our network usually has about 10,000 nodes, the conventional Dijkstra algorithm takes too much computational time in its searching process for a new permanent node. Our method utilizes the Hashing technique to reduce the computational time of the searching process. Extensive computational results are presented.
Publisher
한국경영과학회
Issue Date
1983-04
Language
Korean
Citation

한국경영과학회지, v.8, no.1, pp.11 - 18

ISSN
1225-1119
URI
http://hdl.handle.net/10203/11891
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0