• The Journal of Korea Robotics Society
• /
• v.16 no.4
• /
• pp.306-312
• /
• 2021

This paper describes localization of autonomous underwater vehicles(AUV), which can be used when some navigation sensor data are an outlier. In that situation, localization through existing navigation algorithms causes problems in long-range localization. Even if an outlier sensor data occurs once, problems of localization will continue. Also, if outlier sensor data is related to azimuth (direction of AUV), it causes bigger problems. Therefore, a parallel localization module, in which different algorithms are performed in a normal and abnormal situation should be designed. Before designing a parallel localization module, it is necessary to study an effective method in the abnormal situation. So, we propose a localization method through machine learning. For this method, a learning model consists of only Fully-Connected and trains through randomly contaminated real sea data. The ground truth of training is displacement between subsequent GPS data. As a result, average error in localization through the learning model is 0.4 times smaller than the average error in localization through the existing navigation algorithm. Through this result, we conclude that it is suitable for a component of the parallel localization module.

• The Journal of Korea Robotics Society
• /
• v.9 no.2
• /
• pp.117-123
• /
• 2014

Localization is one of the essential tasks necessary to achieve autonomous navigation of a mobile robot. One such localization technique, Monte Carlo Localization (MCL) is often applied to a digital surface model. However, there are differences between range data from laser rangefinders and the data predicted using a map. In this study, commonly observed from air and ground (COAG) features and candidate selection based on the shape of sensor data are incorporated to improve localization accuracy. COAG features are used to classify points consistent with both the range sensor data and the predicted data, and the sample candidates are classified according to their shape constructed from sensor data. Comparisons of local tracking and global localization accuracy show the improved accuracy of the proposed method over conventional methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.206-221
• /
• 2019

Source localization in three-dimensional (3-D) wireless sensor networks (WSNs) is becoming a major research focus. Due to the complicated air-ground environments in 3-D positioning, many of the traditional localization methods, such as received signal strength (RSS) may have relatively poor accuracy performance. Benefit from prior learning mechanisms, fingerprinting-based localization methods are less sensitive to complex conditions and can provide relatively accurate localization performance. However, fingerprinting-based methods require training data at each grid point for constructing the fingerprint database, the overhead of which is very high, particularly for 3-D localization. Also, some of measured data may be unavailable due to the interference of a complicated environment. In this paper, we propose an efficient kernel based 3-D localization algorithm via tensor completion. We first exploit the spatial correlation of the RSS data and demonstrate the low rank property of the RSS data matrix. Based on this, a new training scheme is proposed that uses tensor completion to recover the missing data of the fingerprint database. Finally, we propose a kernel based learning technique in the matching phase to improve the sensitivity and accuracy in the final source position estimation. Simulation results show that our new method can effectively eliminate the impairment caused by incomplete sensing data to improve the localization performance.

• The Journal of Korea Robotics Society
• /
• v.3 no.2
• /
• pp.117-122
• /
• 2008

This paper presents a multi-robot localization based on multidimensional scaling (MDS) in spite of the existence of incomplete and noisy data. While the traditional algorithms for MDS work on the full-rank distance matrix, there might be many missing data in the real world due to occlusions. Moreover, it has no considerations to dealing with the uncertainty due to noisy observations. We propose a robust MDS to handle both the incomplete and noisy data, which is applied to solve the multi-robot localization problem. To deal with the incomplete data, we use the Nystr$\ddot{o}$m approximation which approximates the full distance matrix. To deal with the uncertainty, we formulate a Bayesian framework for MDS which finds the posterior of coordinates of objects by means of statistical inference. We not only verify the performance of MDS-based multi-robot localization by computer simulations, but also implement a real world localization of multi-robot team. Using extensive empirical results, we show that the accuracy of the proposed method is almost similar to that of Monte Carlo Localization(MCL).

• Journal of Auto-vehicle Safety Association
• /
• v.9 no.3
• /
• pp.24-30
• /
• 2017

This paper presents the development of laser scanner based static obstacle detection algorithm for vehicle localization on lane lost section. On urban autonomous driving, vehicle localization is based on lane information, GPS and digital map is required to ensure. However, in actual urban roads, the lane data may not come in due to traffic jams, intersections, weather conditions, faint lanes and so on. For lane lost section, lane based localization is limited or impossible. The proposed algorithm is designed to determine the lane existence by using reliability of front vision data and can be utilized on lane lost section. For the localization, the laser scanner is used to distinguish the static object through estimation and fusion process based on the speed information on radar data. Then, the laser scanner data are clustered to determine if the object is a static obstacle such as a fence, pole, curb and traffic light. The road boundary is extracted and localization is performed to determine the location of the ego vehicle by comparing with digital map by detection algorithm. It is shown that the localization using the proposed algorithm can contribute effectively to safe autonomous driving.

• Atmosphere
• /
• v.25 no.3
• /
• pp.529-541
• /
• 2015

Korea Institute of Atmospheric Prediction System (KIAPS) has been developing a global numerial prediction model and data assimilation system. We has implemented LETKF (Local Ensemble Transform Kalman Filter, Hunt et al., 2007) data assimilation system to NCAR CAM-SE (National Center for Atmospheric Research Community Atmosphere Model with Spectral Element dynamical core, Dennis et al., 2012) that has cubed-sphere grid, known as the same grid system of KIAPS Integrated Model (KIM) now developing. In this study, we have assimilated Global Positioning System Radio Occultation (GPS-RO) bending angle measurements in addition to conventional data within ensemble-based data assimilation system. Before assimilating bending angle data, we performed a vertical unit conversion. The information of vertical localization for GPS-RO data is given by the unit of meter, but the vertical localization method in the LETKF system is based on pressure unit. Therefore, with a clever conversion of the vertical information, we have conducted experiments to search for the best vertical localization scale on GPS-RO data under the Observing System Simulation Experiments (OSSEs). As a result, we found the optimal setting of vertical localization for the GPS-RO bending angle data assimilation. We plan to apply the selected localization strategy to the LETKF system implemented to KIM which is expected to give better analysis of GPS-RO data assimilation due to much higher model top.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2301-2306
• /
• 2005

Even if there are lots of researches on localization using 2D range finder in static environment, very few researches have been reported for robust real-time localization of mobile robot in uncertain and dynamic environment. In this paper, we present a new localization method based on ICP(Iterative Closest Point) algorithm for navigation of mobile robot under dynamic or uncertain environment. The ICP method is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. We use the method to align global map with 2D scanned data from range finder. The proposed algorithm accelerates the processing time by uniformly sampling the line fitted data from world map of mobile robot. A data filtering method is also used for threshold of occluded data from the range finder sensor. The effectiveness of the proposed method has been demonstrated through computer simulation and experiment in an office environment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.10
• /
• pp.995-1005
• /
• 2011

An efficient outdoor local localization method is suggested using multi-sensor fusion with MU-EKF (Multi-Update Extended Kalman Filter) for car-like mobile robots. In outdoor environments, where mobile robots are used for explorations or military services, accurate localization with multiple sensors is indispensable. In this paper, multi-sensor fusion outdoor local localization algorithm is proposed, which fuses sensor data from LRF (Laser Range Finder), Encoder, and GPS. First, encoder data is used for the prediction stage of MU-EKF. Then the LRF data obtained by scanning the environment is used to extract objects, and estimates the robot position and orientation by mapping with map objects, as the first update stage of MU-EKF. This estimation is finally fused with GPS as the second update stage of MU-EKF. This MU-EKF algorithm can also fuse more than three sensor data efficiently even with different sensor data sampling periods, and ensures high accuracy in localization. The validity of the proposed algorithm is revealed via experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2627-2647
• /
• 2022

The easy scalability and low cost of range-free localization algorithms have led to their wide attention and application in node localization of wireless sensor networks. However, the existing range-free localization algorithms still have problems, such as large cumulative errors and poor localization performance. To solve these problems, an incremental strategy-based residual regression network is proposed for node localization in wireless sensor networks. The algorithm predicts the coordinates of the nodes to be solved by building a deep learning model and fine-tunes the prediction results by regression based on the intersection of the communication range between the predicted and real coordinates and the loss function, which improves the localization performance of the algorithm. Moreover, a correction scheme is proposed to correct the augmented data in the incremental strategy, which reduces the cumulative error generated during the algorithm localization. The analysis through simulation experiments demonstrates that our proposed algorithm has strong robustness and has obvious advantages in localization performance compared with other algorithms.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.357-361
• /
• 2007

This paper presents a multi-robot localization based on Bayesian Multidimensional Scaling (BMDS). We propose a robust MDS to handle both the incomplete and noisy data, which is applied to solve the multi-robot localization problem. To deal with the incomplete data, we use the Nystr${\ddot{o}}$m approximation which approximates the full distance matrix. To deal with the uncertainty, we formulate a Bayesian framework for MDS which finds the posterior of coordinates of objects by means of statistical inference. We not only verify the performance of MDS-based multi-robot localization by computer simulations, but also implement a real world localization of multi-robot team. Using extensive empirical results, we show that the accuracy of the proposed method is almost similar to that of Monte Carlo Localization(MCL).