• Title/Summary/Keyword: Starting algorithm

Search Result 399, Processing Time 0.024 seconds

Design and Implementation of The Efficient Andong Bus Route System using a Location Information (위치정보를 이용한 효율적인 안동 시내버스 노선 검색 시스템의 설계 및 구현)

  • Jang, Soo-Young;Lim, Yang-Won;Lim, Han-Kyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.16 no.5
    • /
    • pp.45-54
    • /
    • 2011
  • Currently various applications related to bus route are used on smart devices to obtain bus arrival times, and route information. However, applications are unable to provide various ways for users to provide their destination. This study has designed an algorithm based on user's six patterns. An Android application and a server that communicate with each other have been based on the algorithm. The applications and the server use the Google Maps service and location-based information to provide users with possible routes from the starting place to the destination. They also provide user's with users' current position and any transfer information. They provide practical and efficient information, and are easy to use.

NEW COMPLEXITY ANALYSIS OF IPM FOR $P_*({\kappa})$ LCP BASED ON KERNEL FUNCTIONS

  • Cho, Gyeong-Mi;Kim, Min-Kyung;Lee, Yong-Hoon
    • 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.

  • PDF

Sensorless Algorithm of Brushless DC Motors Using Terminal Voltage of the One Phase (한상의 단자전압을 이용한 BLDC 전동기 센서리스 알고리즘)

  • Yoon, Yong-Ho;Won, Chung-Yuen
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.59 no.2
    • /
    • pp.135-140
    • /
    • 2010
  • This paper presents a sensorless speed control of BLDC Motor using terminal voltage of the one phase. Rotor position information is extracted by indirectly sensing the back EMF from only one of the three terminal voltages for a three-phase BLDC motor. Depending on the terminal voltage sensing rotor position, active filter is used for position information. This leads to a significant reduction in the component device of the sensorless circuit. Therefore this is a advantage for the cost saving and size reduction. With indirect sensing methods based on detection of the terminal voltage that require active filtering, the position information needs the six divider section by PLL circuit, the binary counter and johnson counter by the EPLD. Finally, this algorithm can estimate the rotor position information similar to Hall-sensor sticked the three-phase BLDC motor. As a result, the method described that it is not sensitive to filtering delays, allowing the motor to achieve a good performance over a wide speed range. In addition, a simple starting method and a speed estimation approach are also proposed. Experimental and simulation results are included to verify the proposed scheme.

Finding a Second Best Coverage Path (차선거리유지 경로찾기)

  • Na, Hyeon-Suk;Kim, Jung-Hee
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.8
    • /
    • pp.385-393
    • /
    • 2008
  • The best coverage problem is finding a path whose worst distance to the sensor-set is the best among all paths. Instead, if the user stays close to its nearest two sensors, then the stability of the wireless connection may be guaranteed. So we consider the problem of finding a second best coverage path; given the sensor set U, a starting point s and a target point t, find a path whose worst distance to the second closest sensor is minimized. This paper presents an O(n logn) -time algorithm to find such a path. We also give experimental evidence showing that the connection to the sensor-set along a second best coverage path is more stable than that along the best coverage path.

Sensorless Control of High-Speed BLDC (고속 BLDC 전동기의 센서리스 제어)

  • Cho, Heung-Hyeon;Kim, Won-Bae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.3
    • /
    • pp.503-512
    • /
    • 2020
  • The products using blowers include hand dryers, automatic car washers, dryers, and vacuum cleaners. The features of these products require a structure and control algorithm so that a strong wind is blown out at the moment. Electric motors according to the existing excitation method include a direct winding type, a decentralized type, a lottery type, and a permanent magnet type. Conventional electric motors have a disadvantage when the starting current is large during high-speed rotation and the number of rotations is irregular. In order to improve this, research on high-speed BLDC motor control has designed 800W-class high-speed BLDC motor control and circuit through driving circuit design, sensorless control algorithm, simulation, experiment, etc., and more than 95% high efficiency evaluation method of driving performance of controller, prototype experiments and verification were studied.

Lane detection method using the Retinex algorithm in foggy roads (Retinex 알고리즘을 사용한 안개 구간에서의 차선 검출 방법)

  • Kang, ji-hun;Choi, seo-hyuk;Kim, chang-dae;Ryu, sung-pil;Kim, dong-woo;Ahn, jae-hyeong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.376-380
    • /
    • 2015
  • This paper proposes new recognition method of road lanes misty day. The method enables autonomous-driving of cars and the safety of the drivers while driving with bad visibility in foggy roads. The proposed method, firstly, determines whether the foggy or not according to pixel number distributions and starting point of the fog period from input images. If it is foggy then the median filter's size of the Retinex algorithm is set to 1000 or more and it performs histogram equalization and normalization. The computer simulation results show that the proposed method can recognize better long distances and fine detection than earlier methods.

  • PDF

Extraction of Passive Device Model Parameters Using Genetic Algorithms

  • Yun, Il-Gu;Carastro, Lawrence A.;Poddar, Ravi;Brooke, Martin A.;May, Gary S.;Hyun, Kyung-Sook;Pyun, Kwang-Eui
    • ETRI Journal
    • /
    • v.22 no.1
    • /
    • pp.38-46
    • /
    • 2000
  • The extraction of model parameters for embedded passive components is crucial for designing and characterizing the performance of multichip module (MCM) substrates. In this paper, a method for optimizing the extraction of these parameters using genetic algorithms is presented. The results of this method are compared with optimization using the Levenberg-Marquardt (LM) algorithm used in the HSPICE circuit modeling tool. A set of integrated resistor structures are fabricated, and their scattering parameters are measured for a range of frequencies from 45 MHz to 5 GHz. Optimal equivalent circuit models for these structures are derived from the s-parameter measurements using each algorithm. Predicted s-parameters for the optimized equivalent circuit are then obtained from HSPICE. The difference between the measured and predicted s-parameters in the frequency range of interest is used as a measure of the accuracy of the two optimization algorithms. It is determined that the LM method is extremely dependent upon the initial starting point of the parameter search and is thus prone to become trapped in local minima. This drawback is alleviated and the accuracy of the parameter values obtained is improved using genetic algorithms.

  • PDF

A Heuristic Approach for Grading Operation of Hydraulic Excavator Systems using SMISMO Valve Configuration (SMISMO 밸브 구조를 채용한 유압식 굴삭기의 평탄화 작업을 위한 휴리스틱 접근)

  • Joh, Joongseon;Hwang, Cheol Min
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.30 no.11
    • /
    • pp.1153-1160
    • /
    • 2013
  • SMISMO valve configuration is now starting to draw attention of the researchers of the construction equipment industry to increase the fuel efficiency of their equipment like excavators and wheel-loaders. An open-loop control strategy for grading operation of hydraulic excavator systems using SMISMO valve configuration is investigated in this paper. Tabor's algorithm for 1 d.o.f. SMISMO system under the assumption of quasi-static operation is revealed as not adequate for multi d.o.f. system with large moment of inertia even though the motion of the system is slow. New parameters are proposed in this paper. It modifies Tabor's open-loop control strategy for the grading operation of hydraulic excavators using SMISMO valve configuration. A simulation-based parameter tuning method is also proposed. It uses GA (Genetic Algorithm) to find the best parameter values. Simulation study for a practical hydraulic excavator shows the validity of the proposed open-loop control strategy.

Design of Tapped Coupled-Line Filters Using a New Equivalent Circuit Model of Tapped lines (탭 선로의 등가회로를 이용한 여파기 설계)

  • Han, Sung-Jin;Kim, Kang-Wook
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2003.11a
    • /
    • pp.371-375
    • /
    • 2003
  • In this paper, a new design method for coupled-line filters with tapped input/output has been developed. The design equations for this tapped filter have been obtained using a new equivalent circuit model of tapped lines. From an edge coupled-line filter, tapped lines replaces the input/output coupled lines which tend to have very narrow gaps (few mils). Therefore, tapped coupled-line filters tend to be less sensitive to filter fabrication tolerances and to be easily fabricated using milling tools. The new filter design algorithm allows very accurate filter design for frequencies less than 20 GHz and bandwidth less than 20%. Above 20 GHz, the filter performance can be optimized starting from the filter design algorithm in this paper. Simulation problems with 2-D EM tools to characterize filter performance at high frequencies have shown to be solved by providing a channel for the filter to eliminate higher order modes.

  • PDF

An Adaptive Hexagon Based Search for Fast Motion Estimation (고속 움직임 추정을 위한 적응형 육각 탐색 방법)

  • 전병태;김병천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.828-835
    • /
    • 2004
  • An adaptive hexagon based search(AHBS) algorithm is proposed in this paper to perform block motion estimation in video coding. The AHBS evaluates the value of a given objective function starting from a diamond-shaped checking block and then continues its process using two hexagon-shaped checking blocks until the minimum value is found at the center of checking blocks. Also, the determination of which checking block is used depends on the position of minimum value occurred in previous searching step. The AHBS is compared with other fast searching algorithms including full search(FS). Experimental results show that the proposed algorithm provides competitive performance with slightly reduced computational complexity.