• Title/Summary/Keyword: Location Estimation Algorithm

Search Result 329, Processing Time 0.028 seconds

A Numerical Algorithm for Fault Location Estimation Considering Long-Transmission Line (장거리 송전선로를 고려한 사고거리추정 수치해석 알고리즘)

  • Kim, Byeong-Man;Chae, Myeong-Suk;Kang, Yong-Cheol
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.12
    • /
    • pp.2139-2146
    • /
    • 2008
  • This paper presents a numerical algorithm for fault location estimation which used to data from both end of the transmission line. The proposed algorithm is also based on the synchronized voltage and current phasor measured from the PMUs(Phasor Measurement Units) in the time-domain. This paper has separated from two part of with/without shunt capacitance(short/long distance). Most fault was arc one-ground fault which is 75% over [1]. so most study focused with it. In this paper, the numerical algorithm has calculated to distance for ground fault and line-line fault. In this paper, the algorithm is given with/without shunt capacitance using II parameter line model, simple impedance model and estimated using DFT(Discrete Fourier Transform) and the LES(Least Error Squares Method). To verify the validity of the proposed algorithm, the EMTP(Electro- Magnetic Transient Program) and MATLAB did used.

Transmission Line Fault Location Algorithm Using Estimated Local Source Impedance (자기단 전원임피던스 추정을 이용한 송전선 고장점표정 알고리즘)

  • Kwon, Young-Jin;Kim, Su-Hwan;Kang, Sang-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.5
    • /
    • pp.885-890
    • /
    • 2009
  • A fault location algorithm using estimated local source impedance after a fault is proposed in this paper. The method uses after fault data only at the local end. It uses the negative sequence current distribution factor for more accurate estimation. The proposed algorithm can keep up with the variation of the local source impedance. Therefore, the proposed algorithm especially is valid for a transmission line interconnected to a wind farm that the equivalent source impedance changes continuously. The performance of the proposed algorithm was verified under various fault conditions using the Simpowersystem of MATLAB Simulink. The proposed algorithm is largely insensitive to the variation in fault distance and fault resistance. The test results show a very high accurate performance.

Delay Tolerant Packet Forwarding Algorithm Based on Location Estimation for Micro Aerial Vehicle Networks

  • Li, Shiji;Hu, Guyu;Ding, Youwei;Zhou, Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1377-1399
    • /
    • 2020
  • In search and rescue mission, micro aerial vehicles (MAVs) are typically used to capture image and video from an aerial perspective and transfer the data to the ground station. Because of the power limitation, a cluster of MAVs are required for a large search area, hence an ad-hoc wireless network must be maintained to transfer data more conveniently and fast. However, the unstable link and the intermittent connectivity between the MAVs caused by MAVs' movement may challenge the packet forwarding. This paper proposes a delay tolerant packet forwarding algorithm based on location estimation for MAV networks, called DTNest algorithm. In the algorithm, ferrying MAVs are used to transmit data between MAVs and the ground station, and the locations of both searching MAVs and ferrying MAVs are estimated to compute the distances between the MAVs and destination. The MAV that is closest to the destination is selected greedy to forward packet. If a MAV cannot find the next hop MAV using the greedy strategy, the packets will be stored and re-forwarded once again in the next time slot. The experiment results show that the proposed DTNest algorithm outperforms the typical DTNgeo algorithm in terms of packet delivery ratio and average routing hops.

Indoor Location and Pose Estimation Algorithm using Artificial Attached Marker (인공 부착 마커를 활용한 실내 위치 및 자세 추정 알고리즘)

  • Ahn, Byeoung Min;Ko, Yun-Ho;Lee, Ji Hong
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.2
    • /
    • pp.240-251
    • /
    • 2016
  • This paper presents a real-time indoor location and pose estimation method that utilizes simple artificial markers and image analysis techniques for the purpose of warehouse automation. The conventional indoor localization methods cannot work robustly in warehouses where severe environmental changes usually occur due to the movement of stocked goods. To overcome this problem, the proposed framework places artificial markers having different interior pattern on the predefined position of the warehouse floor. The proposed algorithm obtains marker candidate regions from a captured image by a simple binarization and labeling procedure. Then it extracts maker interior pattern information from each candidate region in order to decide whether the candidate region is a true marker or not. The extracted interior pattern information and the outer boundary of the marker are used to estimate location and heading angle of the localization system. Experimental results show that the proposed localization method can provide high performance which is almost equivalent to that of the conventional method using an expensive LIDAR sensor and AMCL algorithm.

Location Estimation for Multiple Targets Using Expanded DFS Algorithm (확장된 깊이-우선 탐색 알고리듬을 적용한 다중표적 위치 좌표 추정 기법)

  • Park, So Ryoung;Noh, Sanguk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.12
    • /
    • pp.1207-1215
    • /
    • 2013
  • This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots in consideration of obstacles. In order to match up targets with measured azimuths, to add to the depth-first search (DFS) algorithms in free-obstacle environment, we suggest the expanded DFS (EDS) algorithm including bypass path search, partial path search, middle level ending, and the supplementation of decision metric. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the error rate of estimated location, mean number of calculating nodes, and mean distance between real coordinates and estimated coordinates of the proposed algorithms.

Signal Number Estimation Algorithm Based on Uniform Circular Array Antenna

  • Heui-Seon, Park;Hongrae, Kim;Suk-seung, Hwang
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.12 no.1
    • /
    • pp.43-49
    • /
    • 2023
  • In modern wireless communication systems including beamformers or location-based services (LBS), which employ multiple antenna elements, estimating the number of signals is essential for accurately determining the quality of the communication service. Representative signal number estimation algorithms including the Akaike information criterion (AIC) and minimum description length (MDL) algorithms, which are information theoretical criterion models, determine the number of signals based on a reference value that minimizes each criterion. In general, increasing the number of elements mounted onto the array antenna enhances the performance of estimating the number of signals; however, it increases the computational complexity of the estimation algorithm. In addition, various configurations of array antennas for the increased number of antenna elements should be considered to efficiently utilize them in a limited location. In this paper, we introduce an efficient signal number estimation algorithm based on the beamspace based AIC and MDL techniques that reduce the computational complexity by reducing the dimension of a uniform circular array antenna. Since this algorithm is based on a uniform circular array antenna, it presents the advantages of a circular array antenna. The performance of the proposed signal number estimation algorithm is evaluated through computer simulation examples.

An Improved Technique for Fault Location Estimation Considering Shunt Capacitance on Transmission Line

  • Kim Hyun-Houng;Jeong Yun-Won;Lee Chan-Joo;Park Jong-Bae;Shin Joong-Rin
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.3
    • /
    • pp.295-301
    • /
    • 2006
  • This paper presents a new two-terminal numerical algorithm for fault location estimation using the synchronized phasor in time-domain. The proposed algorithm is also based on the synchronized voltage and current phasor measured from the PMUs (Phasor Measurement Units) installed at both ends of the transmission lines. In this paper, the algorithm is given without shunt capacitance and with shunt capacitance using II -model and estimated using DFT (Discrete Fourier Transform) and LES (Least Error Squares Method). The algorithm uses a very short data window and classification for real-time transmission line protection. To verify the validity of the proposed algorithm, the Electro-Magnetic Transient Program (EMTP) and MATLAB are used.

Extended Fault Location Algorithm Using the Estimated Remote Source Impedance for Parallel Transmission Lines

  • Ryu, Jeong-Hun;Kang, Sang-Hee
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.6
    • /
    • pp.2212-2219
    • /
    • 2018
  • This paper describes extended fault location algorithm using estimated remote source impedance. The method uses data only at the local end and the sequence current distribution factors for more accurate estimation. The proposed algorithm can respond to variation of the local and remote source impedance. Therefore, this method is especially useful for transmission lines interconnected to a wind farm that the source impedance varies continuously. The proposed algorithm is very insensitive to the variation in fault distance and fault resistance. The simulation results have shown the accuracy and effectiveness of the proposed algorithm.

Decoupled Location Parameter Estimation of 3-D Near-Field Sources in a Uniform Circular Array using the Rank Reduction Algorithm

  • Jung, Tae-Jin;Kwon, Bum-Soo;Lee, Kyun-Kyung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.3
    • /
    • pp.129-135
    • /
    • 2011
  • An algorithm is presented for estimating the 3-D location (i.e., azimuth angle, elevation angle, and range) of multiple sources with a uniform circular array (UCA) consisting of an even number of sensors. Recently the rank reduction (RARE) algorithm for partly-calibrated sensor arrays was developed. This algorithm is applicable to sensor arrays consisting of several identically oriented and calibrated linear subarrays. Assuming that a UCA consists of M sensors, it can be divided into M/2 identical linear subarrays composed of two facing sensors. Based on the structure of the subarrays, the steering vectors are decomposed into two parts: range-independent 2-D direction-of-arrival (DOA) parameters, and range-relevant 3-D location parameters. Using this property we can estimate range-independent 2-D DOAs by using the RARE algorithm. Once the 2-D DOAs are available, range estimation can be obtained for each source by defining the 1-D MUSIC spectrum. Despite its low computational complexity, the proposed algorithm can provide an estimation performance almost comparable to that of the 3-D MUSIC benchmark estimator.

Performance Analysis of Location Estimation Algorithm Considering an Extension of Searching Area (탐색범위 확장을 고려한 위치추정 알고리즘의 성능분석)

  • Jeong, Seung-Heui;Lee, Hyun-Jae;Oh, Chang-Heon
    • Journal of Advanced Navigation Technology
    • /
    • v.10 no.4
    • /
    • pp.385-393
    • /
    • 2006
  • In this paper, we proposed a location estimation algorithm considering an extension of searching area in 2.45GHz band RTLS and analyzed its performance in terms of an average estimation error distance. The extendable searching area was assumed to be square of $300m{\times}300m$ and 2 dimensions. The arrangement shape of available readers was considered circle, rectangle, and shrinkage rectangle for extendable searching area. Also, we assumed that propagation path was LOS (Line-Of-Sight) environment, and analyzed the estimation error performance as a function of the number of received sub-blink considering an arrangement shape of available readers in searching area. From the results, compared with rectangle shape, circle shape showed the higher estimation accuracy. Also, we confirmed that the proposed location estimation algorithm provided high estimation accuracy in the shrinkage rectangle shape that was suitable for extension of searching area.

  • PDF