• 한국게임학회 논문지
• /
• 제13권6호
• /
• pp.43-52
• /
• 2013

경로 탐색은 인공지능의 매우 중요한 요소 중의 하나이며, 여러 분야에서 두루 쓰이는 과정이다. 경로 탐색은 매우 많은 연산이 필요하기 때문에 성능에 매우 중대한 영향을 미친다. 이를 해결하기 위해서 연산량을 줄이는 방식의 연구가 많이 진행되었고, 대표적으로 A* 알고리즘이 있으나 불필요한 연산이 있어 효율성이 떨어진다. 본 논문에서는 A* 알고리즘 중 연산 비용이 높은 노드 탐색 수 등 연산량을 줄이기 위해서 가중치 기반의 선수행 A* 알고리즘을 새롭게 제안한다. 제안한 알고리즘의 효율성을 측정하기 위해 시뮬레이션을 구현하였으며, 실험 결과 가중치를 이용하는 방법이 일반적인 방법보다 약 1~2배 높은 효율을 보였다.

• 전자공학회논문지S
• /
• 제34S권11호
• /
• pp.1-8
• /
• 1997

A prediction model is proposed to describe the path loss in propagation environment of indoor microcell. This model includes the lineal corridor for line--of-sight(LOS) and T-shaped corridor for non-line-of-sight(NLOS). In computation of receiving power the ray tracing technique based on image method is utilized and also reflected waves bounced on the walls and ceilings are considered. To check validity of the computed resuls cross checks between the predicted and measured are being made, which shows a close agreement for LOS case whereas somewhat disagreement for NLOS case. UTD technique is incorporated with propagation path determination algorithm in the treatment of NLOS case.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.1004-1008
• /
• 1990

This research focuses on developing a new and computationally efficient algorithm for free space structuring and planning collision free paths for an autonomous mobile robot working in an environment populated with polygonal obstacles. The algorithm constructs the available free space between obstacles in terms of free convex area. A collision free path can be efficiently generated based on a graph constructed using the midpoints of common free links between free convex area as passing points. These points correspond to nodes in a graph and the connection between them within each convex area as arcs in this graph. The complexity of the search for collision free path is greatly reduced by minimizing the size of the graph to be searched concerning the number of nodes and the number of arcs connecting them. The analysis of the proposed algorithm shows its efficiency in terms of computation ability, safety and optimality.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.616-619
• /
• 2002

The z-map structure is widely used for NC tool path verification as it is very simple and fast in calculation of Boolean operations. However, if the number of the x-y grid points in a z-map is increased to enhance its accuracy, the computation time for NC verification increases rapidly. To reduce this computation time, we proposed a NC verification method using 3-D graphic acceleration hardwares. In this method, the z-map of the resultant workpiece machined by a NC program is obtained by rendering tool swept volumes along tool pathos and reading the depth buffer of the graphic card. The experimental results show that this hardware-based method is faster than the conventional software-based method.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2013년도 춘계학술발표대회
• /
• pp.472-473
• /
• 2013

The growth in number and efficiency of smart devices such as GPS enabled smart phones and PDAs present an unparalleled opportunity for diverse areas of life. However extraction of GPS traces for provision of services demand a huge storage space as well as computation overhead. This is a challenging task especially for the applications which provide runtime services. In this paper we provide a simplified model to extract GPS traces of moving objects at runtime. Road segment partitioning and measure of deviation in angle of trajectory path is incorporated to identify the significant data points. The number of these data points is minimized by our proposed approach in an efficient manner to overwhelm the storage and computation overhead. Further, the competent reconstruction of complete itinerary based on gathered data, is also ensured by proposed method.

• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.434-438
• /
• 2008

Massive data are continuously produced with a data rate of over several terabytes every day. These applications need effective clustering algorithms to achieve an overall high performance computation. In this paper, we propose ancestor as cluster center based approach to clustering, the K-means algorithm using ancestor. We modify the K-means algorithm. We present a clustering architecture and a clustering algorithm that minimize of I/Os and show a performance with excellent. In our experimental performance evaluation, we present that our algorithm can improve the I/O speed and the query processing time.

• 한국통신학회논문지
• /
• 제37C권12호
• /
• pp.1195-1210
• /
• 2012

본 논문에서는 Generalized-Multiprotocol Label Switching(GMPLS) Path computation element(PCE) 표준 프로토콜을 확장하여 캐리어 이더넷 망을 제어하기 위해 새로운 시그널링 프로토콜을 정의한다. 제안된 프로토콜은 표준 GMPLS PCE 프로토콜과 호환성을 가지면서도 표준 프로토콜에서 경로 정보만을 제공하는 것을 확장하여 계산된 경로를 망에 자동 구성이 가능하도록 확장된 하이브리드 형 프로토콜이다. 또한 제안한 프로토콜을 직접 구현하여 실제 상용 장비에 적용하고 시험을 통해 제안된 프로토콜의 정확성과 상호 운용성을 검증하였으며 시뮬레이션을 통하여 프로토콜의 성능도 분석하였다.

• 인터넷정보학회논문지
• /
• 제19권2호
• /
• pp.33-41
• /
• 2018

In recent years, technology is rapidly changing to support new service consumption and distribution models in multimedia service systems and hybrid delivery of media services is a key factor for enabling next generation multimedia services. This phenomenon can lead to rapidly increasing network traffic and ultimately has a direct and aggravating effect on the user's quality of service (QOS). To address the issue, we propose a novel system architecture to provide smart hybrid media services efficiently. The architecture is designed to apply the software-defined networking (SDN) method, detect changes in traffic, and combine the data, including user data, service features, and computation node status, to provide a service schedule that is suitable for the current state. To this end, the proposed architecture is based on 2-level scheduling, where Level-1 scheduling is responsible for the best network path and a computation node for processing the user request, whereas Level-2 scheduling deals with individual service requests that arrived at the computation node. This paper describes the overall concept of the architecture, as well as the functions of each component. In addition, this paper describes potential scenarios that demonstrate how this architecture could provide services more efficiently than current media-service architectures.

• 해양환경안전학회지
• /
• 제19권3호
• /
• pp.264-269
• /
• 2013

This paper is to investigate propagation path characteristics of GPS potential jamming signal. To do this, the spherical ground diffraction model is applied to the potential jamming scenario referred to the GPS jamming events occurred in recent years. The fundamental theory on the propagation path loss is discussed and a specific model is applied to several vehicles types which have own heights of antennas in order to compare their propagation path loss values at same 2-D location. The transmitting powers are appropriately given as the ordinary GPS jamming events. And then the received powers in dBW are obtained with given transmitting powers and the estimated total loss. The result of received jamming power at various locations due to the given scenario was distinct. For example, propagation loss values were estimated as -147 ~ -142dBW and -167 ~ -162dBW in $10^6W$ and $10^4W$, respectively. This computation result of the loss can be seriously considered with the tolerable jammer power against L1- C/A GPS receiver under any real jamming situations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권8호
• /
• pp.3270-3294
• /
• 2020

Some things come easily to humans, one of them is the ability to navigate around. This capability of navigation suffers significantly in case of partial or complete blindness, restricting life activity. Advances in the technological landscape have given way to new solutions aiding navigation for the visually impaired. In this paper, we analyze the existing works and identify the challenges of path selection, context awareness, obstacle detection/identification and integration of visual and nonvisual information associated with real-time assisted mobility. In the process, we explore machine learning approaches for robotic path planning, multi constrained optimal path computation and sensor based wearable assistive devices for the visually impaired. It is observed that the solution to problem is complex and computationally intensive and significant effort is required towards the development of richer and comfortable paths for safe and smooth navigation of visually impaired people. We cannot overlook to explore more effective strategies of acquiring surrounding information towards autonomous mobility.