• Title/Summary/Keyword: Absolute distance estimation

Search Result 29, Processing Time 0.029 seconds

Design and Implementation of RSSI-based Intelligent Location Estimation System (RSSI기반 지능형 위치 추정 시스템 설계 및 구현)

  • Lim, Chang Gyoon;Kang, O Seong Andrew;Lee, Chang Young;Kim, Kang Chul
    • Journal of Internet Computing and Services
    • /
    • v.14 no.6
    • /
    • pp.9-18
    • /
    • 2013
  • In this paper, we design and implement an intelligent system for finding objects with RFID(Radio Frequency IDentification) tag in which an mobile robot can do. The system we developed is a learning system of artificial neural network that uses RSSI(Received Signal Strength Indicator) value as input and absolute coordination value as target. Although a passive RFID is used for location estimation, we consider an active RFID for expansion of recognition distance. We design the proposed system and construct the environment for indoor location estimation. The designed system is implemented with software and the result related learning is shown at test bed. We show various experiment results with similar environment of real one from earning data generation to real time location estimation. The accuracy of location estimation is verified by simulating the proposed method with allowable error. We prepare local test bed for indoor experiments and build a mobile robot that can find the objects user want.

Self-organized Learning in Complexity Growing of Radial Basis Function Networks

  • Arisariyawong, Somwang;Charoenseang, Siam
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.30-33
    • /
    • 2002
  • To obtain good performance of radial basis function (RBF) neural networks, it needs very careful consideration in design. The selection of several parameters such as the number of centers and widths of the radial basis functions must be considered carefully since they critically affect the network's performance. We propose a learning algorithm for growing of complexity of RBF neural networks which is adapted automatically according to the complexity of tasks. The algorithm generates a new basis function based on the errors of network, the percentage of decreasing rate of errors and the nearest distance from input data to the center of hidden unit. The RBF's center is located at the point where the maximum of absolute interference error occurs in the input space. The width is calculated based on the standard deviation of distance between the center and inputs data. The steepest descent method is also applied for adjusting the weights, centers, and widths. To demonstrate the performance of the proposed algorithm, general problem of function estimation is evaluated. The results obtained from the simulation show that the proposed algorithm for RBF neural networks yields good performance in terms of convergence and accuracy compared with those obtained by conventional multilayer feedforward networks.

  • PDF

Coefficient Allocated DV-Hop algorithm for Wireless Sensor Networks localization (무선 센서 네트워크를 위한 DV-Hop 기반 계수 할당을 통한 위치 인식 알고리즘)

  • Ekale, Etinge Martin;Lee, Chaewoo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.837-840
    • /
    • 2010
  • Wireless Sensor Networks have been proposed for several location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point to point distance estimates. Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. In this paper, we proposed a Coefficient Allocated DV-Hop (CA DV-Hop) algorithm which reduces node's location error by awarding a credit value with respect to number of hops of each anchor to an unknown node. Simulation results have verified the high estimation accuracy with our approach which outperforms the classical DV-Hop.

A Spatial Interpolation Model for Daily Minimum Temperature over Mountainous Regions (산악지대의 일 최저기온 공간내삽모형)

  • Yun Jin-Il;Choi Jae-Yeon;Yoon Young-Kwan;Chung Uran
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.2 no.4
    • /
    • pp.175-182
    • /
    • 2000
  • Spatial interpolation of daily temperature forecasts and observations issued by public weather services is frequently required to make them applicable to agricultural activities and modeling tasks. In contrast to the long term averages like monthly normals, terrain effects are not considered in most spatial interpolations for short term temperatures. This may cause erroneous results in mountainous regions where the observation network hardly covers full features of the complicated terrain. We developed a spatial interpolation model for daily minimum temperature which combines inverse distance squared weighting and elevation difference correction. This model uses a time dependent function for 'mountain slope lapse rate', which can be derived from regression analyses of the station observations with respect to the geographical and topographical features of the surroundings including the station elevation. We applied this model to interpolation of daily minimum temperature over the mountainous Korean Peninsula using 63 standard weather station data. For the first step, a primitive temperature surface was interpolated by inverse distance squared weighting of the 63 point data. Next, a virtual elevation surface was reconstructed by spatially interpolating the 63 station elevation data and subtracted from the elevation surface of a digital elevation model with 1 km grid spacing to obtain the elevation difference at each grid cell. Final estimates of daily minimum temperature at all the grid cells were obtained by applying the calculated daily lapse rate to the elevation difference and adjusting the inverse distance weighted estimates. Independent, measured data sets from 267 automated weather station locations were used to calculate the estimation errors on 12 dates, randomly selected one for each month in 1999. Analysis of 3 terms of estimation errors (mean error, mean absolute error, and root mean squared error) indicates a substantial improvement over the inverse distance squared weighting.

  • PDF

The study on rapid magnitude estimation using first arrival (초동 P파를 이용한 조기 규모추정에 관한 연구)

  • Hwang, Eui-Hong;Jo, Bong-Gon;Ryou, Yong-Gyu;Sheen, Dong-Hoon;Kim, Su-Kyoung;Youn, Yong-Hoon
    • Proceedings of the Earthquake Engineering Society of Korea Conference
    • /
    • 2006.03a
    • /
    • pp.41-48
    • /
    • 2006
  • We have been conducting several studies on providing information to the public promptly as soon as earthquake occurs. Recently, JMA proposed a method for warning big earthquakes by observing the first 2 seconds after the first arrival. In this study, the envelope of the absolute value of the first 2 seconds after the first arrival is calculated, and then the relation of epicentral distance and slope of envelope, parameter B, is obtained. This result is applied to local magnitude equation of KMA, which then gives us a new magnitude equation from which can estimate the magnitude using maximum amplitude of P wave. We applied the method to two recent earthquakes; Uljin and Daegu. The results using only the vertical components show that the magnitudes are lower than those calculated by the local magnitude equation of KMA. However, when we apply the method to the 3 components of maximum displacements, the results corresponds with those obtained from the local magnitude equation.

  • PDF

Comparison of Estimation Methods for the Missing Rainfall data in a Urban Sub-drainage Area (도시하천 소배수구역의 결측 강우량 산정 방법 비교)

  • Kim, Chung-Soo;Kim, Hyoung-Seop
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2006.05a
    • /
    • pp.701-705
    • /
    • 2006
  • 강우자료는 수문 모델링 작업에서 가장 기초적인 수문학적 입력자료로 시간과 공간에 따른 변동성이 크므로 규명하기 복잡한 수문현상 중의 하나이다. 산악지역이 많은 우리나라의 지형학적 특성과 태풍, 장마 및 특히, 최근의 게릴라성 집중호우 등으로 인하여 이러한 변동성이 더욱 커지고 있는 실정이다. 장기간 실측된 수문기상 기초 자료가 부족한 우리나라의 실정상 홍수예보 및 수공구조물 설계를 위해 정확한 강우량 자료의 취득이 선행돼야 한다. 따라서 적절한 장소에 수문관측소 설치 및 관리를 통해 양호한 강우량 자료를 획득해야 하지만, 현장 여건상 등의 이유로 미계측 및 결측, 이상자료가 발생하고 있다. 따라서 이러한 미계측 혹은 결측지점의 우량을 추정할 수 있는 방법을 비교, 분석하여 적절한 보정과정을 수행할 필요가 있다. 그간의 연구에서는 미계측 지점 혹은 산악지역에서의 점 강우량 보정방법에 대한 연구가 진행되었지만, 본 연구에서는 '도시홍수재해관리기술연구사업단'에서 운영 중인 도시하천 유역 특히 소배수구역에서의 결측 자료에 대해 여러 추정 방법을 비교, 분석하여 적절한 방안을 찾고자 한다. 이를 위하여 중랑천 유역의 3개 소배수 구역(월계1 배수구역, 군자 배수구역, 어린이대공원 배수구역)에 설치된 3개 우량관측소와 건설교통부 관할 우량관측소 2개소의 우량자료를 사용하였다. 본 연구에서는 결측치 보간을 위하여 널리 이용되고 있는 산술평균법(Arithmetic Average method), 역거리법(Reciprocal Distance Squared method), 거리고도비율법(Ratio of Distance and Elevation method), 인근관측소와의 관계식 이용, 크리깅방법(Simple Kriging method)을 비교, 검토 적용하였다. 중랑천 유역의 소배수구역을 대상으로 연중 발생하는 큰 호우사상에 대해 임의의 강우관측소를 결측지점으로 가정하고 주변의 강우관측소로부터 각각의 방법을 이용해 가중치들을 산정하여 결측지점의 강우량 값을 보정하고자 하였다. 또한 각각의 방법을 이용하여 얻어진 결과에 대해 실측값과 보정값의 오차정도를 평균절대오차법(Mean Absolute Error)과 제곱평균제곱근오차법(Root Mean Squared Error)에 의해 산정하여 보정 방법간의 효율성을 검토하고자 하였다.

  • PDF

Performance Improvement Algorithm for Wireless Localization Based on RSSI at Indoor Environment (RSSI의 거리 추정 방식에 바탕을 둔 실내 무선 측위 성능 향상 알고리즘)

  • Park, Joo-Hyun;Lee, Jung-Kyu;Kim, Seong-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4C
    • /
    • pp.254-264
    • /
    • 2011
  • In this paper, we propose two algorithm for improving the performance of wireless localization(Trilateration and Least Square) based on the range based approach method in indoor environment using RSSI for ranging distance. we propose a method to discriminate the case that has relatively large estimation errors in trilateration using Heron''s formula for the volume of a tetrahedron. And we propose the algorithm to process the discriminated types of distance using the absolute value calculated by Heron''s formula. In addition, we propose another algorithm for the case of which the number of anchor nodes larger than three. In this case, Residual Weighting Factor(RWGH) improves the performance of Least Square. However, RWGH requires many number of calculations. In this paper, we propose Iterative Weighted Centroid Algorithm(IWCA) that has better performance and less calculation than RWGH. We show the improvement of performance for two algorithms and the combination of these algorithm by using simulation results.

Enhancement of UAV-based Spatial Positioning Using the Triangular Center Method with Multiple GPS

  • Joo, Yongjin;Ahn, Yushin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.5
    • /
    • pp.379-388
    • /
    • 2019
  • Recently, a technique for acquiring spatial information data using UAV (Unmanned Aerial Vehicle) has been greatly developed. It is a very crucial issue of the GIS (Geographic Information System) mapping system that passes way point in the unmanned airframe and finally measures the accurate image and stable localization to the desired destination. Though positioning using DGPS (Differential Global Navigation System) or RTK-GPS (Real Time Kinematic-GPS) guarantee highly accurate, they are more expensive than the construction of a single positioning system using a single GPS. In the case of a low-priced single GPS system, the stability of the positioning data deteriorates. Therefore, it is necessary to supplement the uncertainty of the absolute position data of the UAV and to improve the accuracy of the current position data economically in the operating state of the UAV. The aim of this study was to present an algorithm enhancing the stability of position data in a single GPS mode of UAV with multiple GPS. First, the arrangement of multiple GPS receivers through the center of gravity of the UAV were examined. Next, MD (Mahalanobis Distance) is applied to detect instantaneous errors of GPS data in advance and eliminate outliers to increase the accuracy of previously collected multiple GPS data. Processing procedure for multiple GPS reception data by applying the center of the triangular method were presented to improve the position accuracy. Second, UAV navigation systems integrated multiple GPS through configuration of the UAV specifications were implemented. Using the unmanned airframe equipped with multiple GPS receivers, GPS data is measured with the TCM (Triangular Center Method). In addition, UAV equipped with multiple GPS were operated in study area and locational accuracy of multiple GPS of UAV with VRS (Virtual Reference Station) GNSS surveying were compared. The result showed that the error factors are compensated, and the error range are reduced, resulting in the reliability of the corrected value. In conclusion, the result in this paper is expected to realize high-precision position estimation at low cost in UAV using multiple low-cost GPS receivers.

K-Means Clustering Algorithm and CPA based Collinear Multiple Static Obstacle Collision Avoidance for UAVs (K-평균 군집화 알고리즘 및 최근접점 기반 무인항공기용 공선상의 다중 정적 장애물 충돌 회피)

  • Hyeji Kim;Hyeok Kang;Seongbong Lee;Hyeongseok Kim;Dongjin Lee
    • Journal of Advanced Navigation Technology
    • /
    • v.26 no.6
    • /
    • pp.427-433
    • /
    • 2022
  • Obstacle detection, collision recognition, and avoidance technologies are required the collision avoidance technology for UAVs. In this paper, considering collinear multiple static obstacle, we propose an obstacle detection algorithm using LiDAR and a collision recognition and avoidance algorithm based on CPA. Preprocessing is performed to remove the ground from the LiDAR measurement data before obstacle detection. And we detect and classify obstacles in the preprocessed data using the K-means clustering algorithm. Also, we estimate the absolute positions of detected obstacles using relative navigation and correct the estimated positions using a low-pass filter. For collision avoidance with the detected multiple static obstacle, we use a collision recognition and avoidance algorithm based on CPA. Information of obstacles to be avoided is updated using distance between each obstacle, and collision recognition and avoidance are performed through the updated obstacles information. Finally, through obstacle location estimation, collision recognition, and collision avoidance result analysis in the Gazebo simulation environment, we verified that collision avoidance is performed successfully.