• 한국경영과학회지
• /
• 제26권3호
• /
• pp.79-94
• /
• 2001

This paper presents a new algorithm for the K shortest paths Problem which develops initial K shortest paths, and repeat to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution comprises K shortest paths among shortest paths to traverse each arc in a Double Shortest Arborescence which is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, there may be some hidden paths which are shorter than present k-th path. To expose a hidden shortest path, one inward arc of this crossing node is chose by means of minimum detouring distance calculated with dual variables, and then the hidden shortest path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. If this exposed path is shorter than the k-th path, the exposed path replaces the k-th path. This algorithm requires worst case time complexity of O(Kn$^2$), and O(n$^2$) in the case k$\leq$3.

• 한국군사과학기술학회지
• /
• 제17권6호
• /
• pp.711-717
• /
• 2014

Global path planning for autonomous driving of unmanned ground vehicle is essential. When setting global path planning, its accuracy and effectiveness is increased if useful information such as terrain type of driving route has been reflected on global path planning. As a method to reflect the terrain type, there is a method to perform global path planning by applying the weight to each terrain type. At this time, how to assign appropriate weights corresponding to the terrain type is more important than anything. In this paper, we proposed a method to determine the weight for terrain type that may affect the results of global path planning. Moreover, we presented effective operation method and design results(GUI) to check the possibility of the use of the proposed method.

• 한국군사과학기술학회지
• /
• 제19권6호
• /
• pp.779-788
• /
• 2016

In this paper, a global path replanning method is proposed in order to plan a global path minimizing the risk of the unmanned vehicle on the battlefield. We first introduce 4D environmental information consisting of mobility, visibility, kill, and hit attributes, and a unified threat map and a mobility map are defined by the four attributes. Using the mobility map, the unmanned vehicle can find the shortest path on the traversable area. And then taking into account the deterrent according to the type of the unmanned vehicle on the integrated threat map, the vehicle can generate a route to suppress or avoid the threat of enemy as well. Moreover, we present a waypoints bypassing method to exclude unnecessary waypoints rather than the mission point when planning paths for the multiple waypoints.

• 한국환경과학회지
• /
• 제25권11호
• /
• pp.1521-1530
• /
• 2016

As a result of dividing typhoon that affected Korean Peninsular between 1999 and 2012 into 7 types of path and entering forecast field and analysis field of RDAPS, until 36 hours from the time of forecast, it is reliable to use the forecast field of RDAPS to predict typhoon and for each typhoon path, the difference between the forecast and the analysis shows normal distribution, which is usable for weather forecast until the $36^{th}$ hour. In the $48^{th}$ hour from the time of forecast, the difference of result depending on each typhoon path increased, which was analyzed to be due to errors in the forecast. It was expected that relatively reasonable results should be shown if the $36^{th}$ hour forecast is used to predict the strength and distribution of strong wind. As a result of using Korean RAM and observing the difference of the maximum damage, reliability was secured up to 36 hours and after 48hours, it was expected that the fluctuation of results may become more severe.

• Journal of information and communication convergence engineering
• /
• 제4권3호
• /
• pp.97-100
• /
• 2006

In this paper, the transmission service for medical image is proposed via IEEE 802.15.4a on WPAN environment. Also, transmission and receiving performance of medical image using TH UWB-IR system is evaluated on indoor multi-path fading environment. On the results, the proposed scheme can solve the problem of interference from the medical equipment in same frequency band, and minimize the loss due to the indoor multi-path fading environment. Therefore, the transmission with low power usage is possible.

• 스마트미디어저널
• /
• 제7권2호
• /
• pp.9-14
• /
• 2018

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• 한국군사과학기술학회지
• /
• 제20권5호
• /
• pp.647-653
• /
• 2017

In this paper, we deal with the experimental verification of 1D virtual force field algorithm based reflexive local path planning on uneven and dusty environment. The existing obstacle detection method on uneven and dusty environment and 1D virtual force field based reflexive local path planning algorithm simply are introduced. Although the 1D virtual force field algorithm is verified by various simulations, additional efforts are needed to verify this algorithm in the real-world. The introduced methods are combined with each other, installed to real mobile platforms and verified by various real experiments.

• 한국산학기술학회논문지
• /
• 제19권10호
• /
• pp.401-409
• /
• 2018

본 연구는 패스(Path) 제어방법을 적용하여 소형전술차량에 적용된 NSD의 소음을 저감하기 위한 것이다. 소형전술차량은 고기동성 확보를 위해 후차축에 차동제한장치 중 하나인 NSD를 적용하였다. NSD는 높은 제한율을 가져 기동성을 향상 시켜주지만 기계적 구조에 의해 특정 조건에서 소음이 발생되는 단점이 있다. 이 소음은 NSD가 차동장치로써 원활한 역할 수행을 위해 기어간 유격에 의해 치간 접촉에 따라 발생되는 소음이다. 이러한 소음이 지속적으로 사용자에게 전달됨에 따라 운용자가 지속적인 문제 제기 및 개선 요구를 하고 있다. 물론, NSD의 소음으로 인해 제품의 성능 또는 내구성에 미치는 영향은 없으며, 국방규격에서 규정하는 소음 조건 역시 만족한다. 하지만, 사용자의 지속적인 개선요구에 따라 소음저감을 위한 방안에 대해 연구를 수행하였다. 따라서, 본 연구에서는 소음원의 제거가 현실적으로 제한되는 전술차량의 NSD 소음을 감소하기 위해 NSD의 소음이 전달되는 경로를 제어하는 패스제어방법을 적용하였다. 이를 통해 구조 전달계를 개선 보완하고 이에 대한 개선효과를 검증하고자 한다.

• 대한교통학회지
• /
• 제22권6호
• /
• pp.121-131
• /
• 2004

다수경로 알고리즘은 비루프경로(Loopless Path: 또는 Simple Path)와 루프경로(Loop Path)를 탐색하는 방안으로 대별된다. 알고리즘의 난이도 측면에서 일반적으로 비루프경로를 탐색하는 방안이 루프경로를 탐색하는 방안보다 많은 노력이 소요된다. 바꾸어 말하면, 루프경로 탐색방안이 알고리즘의 이해 및 활용성 측면에서 용이하다는 장점이 존재한다. 루프경로탐색방안에서 경로삭제방식(Path Deletion Method)이 가장 효율적인 알고리즘으로 알려져 있다. 경로삭제방식은 K번째의 최적경로를 탐색하기 위하여 K-1번째의 경로의 탐색금지 상황설정이 필요하며, 이를 네트워크의 변형된 확장형태(Enlarged Transform)를 통하여 추구하는 방식이다. 그러나 이 알고리즘은 경로상에 노드 및 링크의 반복이 허용되는 루프를 생성시켜 교통망에 적용하기에는 한계가 존재하는 단점이 있다. 본 연구에서 링크표지를 활용하여 루프를 제거하는 방안을 개발한다. 이를 위해 K-1번째 확장네트워크에서 링크표지를 갱신하는 과정에서 대상링크와 전 링크의 부분경로와의 관계를 고려하여 루프가 생성되지 않도록 링크표지를 확정하여 원천적으로 루프의 생성을 방지한다. 본 연구에서 제안하는 비루프 알고리즘은 노드비루프와 링크비루프로 구분되며, 노드비루프는 경로 상에서 노드의 반복이 존재하지 않는 일반적인 단순경로(Simple Path)를 의미하며, 링크비루프는 경로 상에 링크의 반복이 존재하지 않는 경로를 의미한다. 특히 링크비루프는 도시 교차로에서 발생하는 U-턴, P-턴의 덩굴망 통행행태를 설명하기 위한 중요개념으로 확대 정의된다. 사례연구를 통하여 제안된 알고리즘의 활용성을 검증한다.

• 한국경영과학회지
• /
• 제16권1호
• /
• pp.1-12
• /
• 1991

This paper studies an optimal algorithm for the Maximum Origin-Destination Flor Path (MODFP) in an acyclic transportation network. We define a Pseudo-Flow each are so that it can give an upper bound to the total flow of a given path. And using the K-th Shortest Path algorithm we obtain upper bound of MODF which is decreasing as the number of searched path grows. Computational Complexity of optimal algorithm is O(K + m) $n_{2}$), K being the total number of searched path. We proved that the problem complexity of finding MODFP in an acyclic network is NP-hard, showing that the-satisfiability problem can be polynomialy reduced to this problem. And we estimated the average of the number K as being (m/n)$^{1,08}$ Exp (0.00689gm) from the computational experiments.