• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.1354-1356
• /
• 2012

최근 ITS(Intelligent Transportation Systems)의 개발과 함께 차량용 내비게이션의 사용이 급증하면서 경로탐색의 중요성이 더욱 가속화되고 있다. 현재 차량용 내비게이션은 멀티미디어 및 정보통신 기술의 결합과 함께 다양한 기능 및 정보를 사용자에게 제공하고 있으며 이러한 기능과 정보를 사용해서 목적지점까지의 최단경로를 탐색하는 것이 내비게이션 시스템의 핵심기능이다. 이러한 경로탐색 알고리즘은 교통시스템, 통신 네트워크, 운송 시스템은 물론 이동 로봇의 경로 설정 등 다양한 분야에 사용되고 있다. 개미 집단 최적화(Ant Colony Optimization, ACO) 알고리즘은 메타 휴리스틱 탐색 방법으로 그리디 탐색(Greedy Search)뿐만 아니라 긍정적 반응의 탐색을 사용한 모집단에 근거한 접근법으로 순환 판매원 문제(Traveling Salesman Problem, TSP)를 풀기 위해 처음으로 제안되었다. 본 논문에서는 개미 집단 최적화(ACO) 알고리즘이 기존의 경로 탐색 알고리즘으로 알려진 Dijkstra 보다 최단경로 탐색에 있어서 더 적합한 알고리즘이라는 것을 설명하고자 한다.

• Science of Emotion and Sensibility
• /
• v.17 no.2
• /
• pp.111-122
• /
• 2014

This study has analyzed the scanning path algorithm shown at the process of exploring spatial information through an observation experiment with the object of lobby in subway station. In the estimation of observation time by section, the frequency of scanning type was found to increase as the observation time got longer, which makes it possible that the longer the observation lasts the more the observation interruptions occur. In addition, the observation slipped out of the range of imaging when any fatigue was caused from the observation or the more active exploration took place. Furthermore, when the trend line was employed for the examination of the changes to the scanning type by time section, "concentration" "diagonal or vertical" showed a sharp and a gentle increases along with the increase of time section respectively, while "circulation. combination, horizontal" showed a reduction. The observation data of the subjects observing a space include various visual information. The analysis of the scanning type found at "attention concentration" enabled to draw this significant conclusion. The features of increase and decrease of scanning types can be a fundamental data for understanding the scanning tendency by time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.412-421
• /
• 2011

An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and many such systems have been recently developed. Most of them assume that sailing is carried out with a constraint like a fixed output of engine-power or a fixed sailing speed. However, if the output of engine-power is controlled, it is possible to reduce the fuel consumption by sailing a ship under a relatively good weather condition. In this paper, we propose a novel economic ship routing system which can search optimal outputs of the engine-power for each part of a path by employing an evolutionary strategy. In addition, we develope an $A^*$ algorithm to find the shortest path and a method to enhance the degree of curve representation. These make the proposed system applicable to an arbitrary pair of departure and destination points. We compared our proposed system with another existing system not controlling output of the engine-power over 36 scenarios in total, and observed that the former reduced the estimated fuel consumption than the latter by 1.3% on average and the maximum 5.6% with little difference of estimated time of arrival.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.9-16
• /
• 2008

In this paper, we present an algorithm for synthesizing intermediate view image from a stereoscopic pair of images. An image of multiview is need for people in order to easily recognize 3D image. However, if many cameras are use for that, not only does system get more complicated but also transmission rating cause a big trouble. Hence, stereo images are photograph and issue on the sending side and algorithm to generate several intermediate view image is able to be use on the receiving side. The proposed method is based on disparity space image. First of all, disparity space image that is depicted by the gap of pixel followed by disparity of stereo image is generated. Disparity map is made by utilizing disparity space image for searching for optimal disparity path then eventual intermediate view image is generated after occlusion region which does not match is processed. Experimental results illustrate the performance of the proposed technique and we obtained a high quality image of more than 30 dB PSNR.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.661-667
• /
• 2005

In this paper, we propose a new hybrid genetic algorithm for sequential ordering problem (SOP). In the proposed genetic algorithm, the Voronoi quantized crossover (VQX) is used as a crossover operator and the path-preserving 3-Opt is used as a local search heuristic. VQX is a crossotver operator that uses the epistasis information of given problem instance. Since it is a crossover proposed originally for the traveling salesman problem (TSP), its application to SOP requires considerable modification. In this study, we appropriately modify VQX for SOP, and develop three algorithms, required in the modified VQX, named Feasible solution Generation Algorithm, Precedence Cycle Decomposition Algorithm, and Genic Distance Assignment Method. The results of the tests on SOP instances obtained from TSPLIB and ZIB-MP-Testdata show that the proposed genetic algorithm outperforms other genetic algorithms in stability and solution quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.848-856
• /
• 2004

In this paper, a fast stereo matching algorithm based on pixel-wise matching strategy, which can get a stable and accurate disparity map, is proposed. Since a stereo image pair has small differences each other and the differences between left and right images are just caused by horizontal shifts with some order, the matching using a large window will not be needed within a given search range. However, disparity results of conventional pixel-based matching methods are somewhat unstable and wrinkled, the principal direction of disparities is checked by the accumulated cost along a path on array with the dynamic programming method. Experimental results showed that the proposed method could remove almost all disparity noise and set a good quality disparity map in very short time.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.4
• /
• pp.227-238
• /
• 2008

In this paper we extend primal-dual interior point algorithm for linear optimization (LO) problems to $P_*({\kappa})$ linear complementarity problems(LCPs) ([1]). We define proximity functions and search directions based on kernel functions, ${\psi}(t)=\frac{t^{p+1}-1}{p+1}-{\log}\;t$, $p{\in}$[0, 1], which is a generalized form of the one in [16]. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*({\kappa})$ LCPs. We show that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*({\kappa})$ LCPs have $O((1+2{\kappa})nlog{\frac{n}{\varepsilon}})$ complexity which is similar to the one in [16]. For small-update methods, we have $O((1+2{\kappa})\sqrt{n}{\log}{\frac{n}{\varepsilon}})$ which is the best known complexity so far.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.371-378
• /
• 2010

In this paper, we propose a new energy-efficient routing algorithm for sensor networks that selects a least energy consuming path among the paths formed by node with highest remaining energy and provides long network lifetime and uniform energy consumption by nodes. The pair distribution of the energy consumption over all the possible routes to the base station is one of the design objectives. Also, an alternate route search mechanism is proposed to cope with the situation in which no routing information is available due to lack of remaining energy of the neighboring nodes. Simulation results show that our algorithm extends the network lifetime and enhances the network reliability by maintaining relatively uniform remaining energy distribution among sensor nodes.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.537-540
• /
• 2000

The Distribution System consist of many tie-line switches and sectionalizing switches, operated a radial type. When an outage occurs in Distribution System, outage areas are isolated by system switches, has to restored as soon as possible. At this time, system operator have to get a information about network topology for service restoration of outage areas. Therefore, the searching result of restorative topology has to fast computation time and reliable result topology for to restore a electric service to outage areas, equal to optimal switching operation problem. So, the problem can be defined as combinatorial optimization problem. The service restoration problem is so important problem which have outage area minimization, outage loss minimization. Many researcher is applying to the service restoration problem with various techniques. In this paper, advanced Dijkstra algorithm is applied to searching a restoration topology, is so efficient to searching a shortest path in graph type network. Additionally, fuzzy rules and operator are applied to overcome a fuzziness of correlation with input data. The present technique has superior results which are fast computation time and searching results than previous researches, demonstrated by example distribution model system which has 3 feeders, 26 buses. For a application capability to real distribution system, additionally demonstrated by real distribution system of KEPCO(Korea Electric Power Corporation) which has 8 feeders and 140 buses.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.9
• /
• pp.903-909
• /
• 2007

Mobile Robots are increasingly being used to perform tasks in unknown environment. The potential of robots to undertake such tasks lies in their ability to intelligently and efficiently search in an environment. To achieve autonomous mobile robot navigation, efficient path planner and accurate localization technique are the fundamental issues that should be addressed. This paper presents mobile robot localization using IRID(InfraRed IDentification) as artificial landmarks. IRID has highly deterministic characteristics, different from RFID. By putting several IRID emitters on the ceiling, the floor is divided into many different sectors and each sector is set to have a unique identification. Dead-reckoning provides the estimated robot configuration but the error becomes accumulated as the robot travels. IRID information tells the sector the robot is in, but the size of the uncertainty is too large if only the IRID information is used. This paper presents an algorithm which combines both the encoder and the IRID information so that the size of the uncertainty becomes smaller. It also introduces a framework which can be used with other types of the artificial landmarks. The characteristics of the developed IRID and the proposed algorithm are verified from the simulation results and experiments.