• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.4
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.11
• /
• pp.181-188
• /
• 2019

The migration path of a multiple-generation technology that occurs during a technological substitution by a new technology is important to understanding the phenomenon of technological substitution, and can contribute to understanding the process of technological innovation. This research defines the concept of migration path and develops a model of the types of migration paths by multiple dimensions (actor, generation, and time) in a multiple-generation technology. Based on a literature review and tracking of migration paths according to multiple dimensions, the definitions and types of migration paths were provided, and the accuracy of the model was verified based on a case study of the semiconductor industry. The migration paths of suppliers are modeled with three types (switching, leapfrogging, and new entrance paths), and the migration paths of customers are modeled with four types (switching, leapfrogging, new entrance, and diffusion paths) in a multiple-generation technology. This research will be useful for understanding the migration paths in the phenomenon of technological substitution, and can be applied to other industries in addition to the semiconductor industry, including various actors. In addition, suppliers and customers can understand technological substitution and can establish a technology strategy against their competitors.

• 한국정보교육학회:학술대회논문집
• /
• 2010.08a
• /
• pp.227-233
• /
• 2010

Graph is applied to GIS, Network, AI and so on. We use graph concept in our daily life unconsciously. So this paper describe how graph concept is used when robot searches shortest path between two distinct vertices. It is performed in real world. For this, it consists of three step; maze traverse, graph generation, and shortest path search. Maze traverse steps is that robot navigates maze. It is most difficult step. Graph generation step is to represent structural information into graph. Shortest path search step is to that robot move between two vertices. It is not implemented yet. So we introduce process in design level.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.17 no.1
• /
• pp.50-57
• /
• 2009

Lane Keeping Assistant Systems (LKAS) require the cooperative operation between drivers and active steering angle/torque controllers. An LKAS is proposed in this study such that the desired reference path generation (DRPG) system generates the desired path to minimize the trajectory overshoot. Based on the reference path from the DRPG system, an optimal controller is designed to minimize the cost function. A HIL (Hardware In the Loop) simulator is constructed to evaluate the proposed LKAS system. The single camera is mounted on the simulator and acquires the monitor images to detect lane markers. The performance of the proposed system is evaluated by HIL system using the Carsim and the Matlab Simulink.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.6
• /
• pp.28-41
• /
• 1994

An efficient algorithm is proposed to select the proper tools and generate their paths for NC rough cutting of dies and molds with sculptured surfaces. Even though a milling process consists of roughing, semi-finishing, and finishing, most material is removed by a rough cutting process. Therfore it can be said that the rough cutting process occupy an important portion of the NC milling process, and accordingly, an efficient rough cutting method contributes to an efficient milling process. In order work, the following basic assumption is accepted for the efficient machining. That is, to machine a region bounded by a profile, larger tools should be used in the far inside and the region adjacent to relatively simple portion of the boundary while smaller tools are used in the regions adjacent to the relatively complex protion. Thus the tools are selected based on the complexity of the boundary profile adjacent to the region to be machined. An index called cutting path ratio is proposed in this work as a measure of the relative complexity of the profile with respect to a tool diameter. Once the tools are selected, their tool paths are calculated starting from the largest to the smallest tool.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.157-163
• /
• 1995

This paper presents an algorithm to deternine the tool path height for rough machining of sculptured surface. To minimize rough machining of sculptured surface, it is necessary to determine the tool path heights of contour planes. the proposed algorithm searches for the height at which maximum metal removal rate is obtained. This bisection method is accomplished until all shoulder heights are within roughing tolerance. The machining experiment demonstrates the superiority of the algorithm presented in this thesis.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2423-2425
• /
• 2003

This paper proposes a decision criteria for selecting the shortest path from Dubins set between the initial and final configurations of a car-like robot. The suggested scheme is a very simple and computational savings without explicitly calculating the candidate paths and having a complicated decision table. Equations for calculating the shortest path are derived in simple form with coordinate transform and defining standard forms.

• Proceedings of the KAIS Fall Conference
• /
• 2003.06a
• /
• pp.243-246
• /
• 2003

기존에 만들어진 미로 생성 알고리즘은 ‘Perfect 미로’를 지향하는 알고리즘이다. Perfect 미로는 두 점사이의 path가 유일하며, 순환되지 않고, 막힌공간이나, 접근할 수 없는 공간이 없는 미로를 말한다. 이런 미로 알고리즘을 사용하여 만든 미로는, 정형적인 형태를 띄게 된다. 이 알고리즘들을 아무런 수정 얼이, RPG/액션/시뮬레이션/전략게임 둥에 사용하게 되면, 게임 캐릭터는, 유일하면서 막힘이 빈번한 path 안에서 부자연스런 움직임을 가지게 될 것이다. 그래서 보다 넓은 면적을 탐험할 수 있고, 전진성을 높여주기 위하여 여러개의 path와 순환을 허용하는 알고리즘을 제안하게 되었다.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.723-726
• /
• 1998

Fault dropping is a very important part of test generation process. It is used to reduce test generation time. Test generation systems use fault simulation for the purpose of fault dropping by identifying detectable faults with generated test patterns. Two kinds of delay fault model is used in practice, path delay fault model and gate delay fault model. In this paper we propose an efficient method for gate delay test generation which shares second test vector.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.2
• /
• pp.211-217
• /
• 2014

This paper addresses an algorithm of path planning for autonomous driving of a ground vehicle in waypoint navigation. The proposed algorithm is flexible in utilization under a large GPS positioning error and generates collision-free multiple paths while pursuing minimum traveling time. An optimal path reduces inefficient steering by minimizing lateral changes in generated waypoints along a path. Simulation results compare the proposed algorithm with the A* algorithm by manipulation of the steering wheel and traveling time, and show that the proposed algorithm realizes real-time obstacle avoidance by quick processing of path generation, and minimum time traveling by producing paths with small lateral changes while overcoming the very irregular positioning error from the GPS.