DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김세헌 | ko |
dc.contributor.author | 염건 | ko |
dc.date.accessioned | 2009-10-19T05:24:45Z | - |
dc.date.available | 2009-10-19T05:24:45Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1983-04 | - |
dc.identifier.citation | 한국경영과학회지, v.8, no.1, pp.11 - 18 | - |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | http://hdl.handle.net/10203/11891 | - |
dc.description.abstract | 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. | - |
dc.language | Korean | - |
dc.language.iso | ko | en |
dc.publisher | 한국경영과학회 | - |
dc.title | 비행체의 경로최적화 | - |
dc.title.alternative | Path Optimization for Aircraft | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 8 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 11 | - |
dc.citation.endingpage | 18 | - |
dc.citation.publicationname | 한국경영과학회지 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | 김세헌 | - |
dc.contributor.nonIdAuthor | 염건 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.