• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.1
• /
• pp.47-53
• /
• 2006

Localization is a essential technology for mobile robot to work well. Until now expensive sensors such as laser sensors have been used for mobile robot localization. We suggest RFID tag based localization system. RFID tag devices, antennas and tags are cheap and will be cheaper in the future. The RFID tag system is one of the most important elements in the ubiquitous system and RFID tag will be attached to all sorts of goods. Then, we can use this tags for mobile robot localization without additional costs. So, in this paper, the smart floor using passive RFID tags is proposed and, passive RFID tags are mainly used for identifying mobile robot's location and pose in the smart floor. We discuss a number of challenges related to this approach, such as tag distribution (density and structure), typing and clustering. When a mobile robot localizes in this smart floor, the localization error mainly results from the sensing range of the RFID reader, because the reader just ran know whether a tag is in the sensing range of the sensor. So, in this paper, we suggest two algorithms to reduce this error. We apply the particle filter based Monte Carlo localization algorithm to reduce the localization error. And with simulations and experiments, we show the possibility of our particle filter based Monte Carlo localization in the RFID tag based localization system.

• 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.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.429-437
• /
• 2005

Sensor localization has become an essential requirement for realistic applications over wireless sensor networks (WSN). In this paper we propose an ad hoc localization algorithm that is infrastructure-free, anchor-free, and computationally efficient with reduced communication. A novel combination of distance and direction estimation technique is introduced to detect and estimate ranges between neighbors. Using this information we construct unidirectional coordinate systems to avoid the reflection ambiguity. We then compute node positions using a transformation matrix [T], which reduces the computational complexity of the localization algorithm while computing positions relative to the fixed coordinate system. Simulation results have shown that at a node degree of 9 we get $90\%$ localization with $20\%$ average localization error without using any error refining schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.2
• /
• pp.133-140
• /
• 2016

In active sonar field, a target detection and localization based on a distributed sensor network has been much studied for the underwater surveillance of the coast. Zhou et al. proposed a target localization method utilizing the positions of target-detected sensors in distributed sensor network which consists of detection-only sensors. In contrast with a conventional method, Zhou's method dose not require to estimate the propagation model parameters of detection signal. Also it needs the lower computational complexity, and to transmit less data between network nodes. However, it has large target localization error. So it has been modified for reducing localization error by Ryu. Modified Zhou's method has better estimation performance than Zhou's method, but still relatively large estimation error. In this paper, a target localization method based on modified Zhou's method is proposed for reducing the localization error. The proposed method utilizes the geometry of the positions of target-detected sensors and a line that represents the bearing of target, a line can be found by modified Zhou's method. This paper shows that the proposed method has better target position estimation performance than Zhou's and modified Zhou's method by computer simulations.

• Journal of Positioning, Navigation, and Timing
• /
• v.9 no.3
• /
• pp.221-227
• /
• 2020

In this paper, the Iterated Consider Extended Kalman Filter (ICEKF) is proposed for bearing-only localization of GNSS interference to improve the estimation performance and filter consistency. The ICEKF is an extended version of Consider KF (CKF) for Iterated EKF (IEKF) to consider an effect of bearing measurement bias error to filter covariance. The ICEKF can mitigate the EKF divergence problem which can occur when linearizing the nonlinear bearing measurement by a large initial state error. Also, it can mitigate filter inconsistency problem of EKF and IEKF which can occur when a weakly observable bearing measurement bias error state is not included in filter state vector. The simulation result shows that the localization error of the ICEKF is smaller than the EKF and IEKF, and the Root Mean Square (RMS) estimation error of ICEKF matches the covariance of filter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.670-691
• /
• 2013

In RSSI-based RFID(Radio Frequency IDentification) indoor localization system, the signal path loss model of each sub-region is different from others in the whole localization area due to the influence of the multi-path phenomenon and other environmental factors. Therefore, this paper divides the localization area into many sub-regions and constructs separately the signal path loss model of each sub-region. Then an improved LANDMARC method is proposed. Firstly, the deployment principle of RFID readers and tags is presented for constructing localization sub-region. Secondly, the virtual reference tags are introduced to create a virtual signal strength space with RFID readers and real reference tags in every sub-region. Lastly, k nearest neighbor (KNN) algorithm is used to locate the target object and an error compensating algorithm is proposed for correcting localization result. The results in real application show that the new method enhances the positioning accuracy to 18.2% and reduces the time cost to 30% of the original LANDMARC method without additional tags and readers.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.10
• /
• pp.1874-1881
• /
• 2010

A recursive linear stochastic error compensation algorithm is newly proposed for target localization in sensor network which provides range difference of arrival(RDOA) measurements. Target localization with RDOA is a well-known nonlinear estimation problem. Since it can not solve with a closed-form solution, the numerical methods sensitive to initial guess are often used before. As an alternative solution, a pseudo-linear estimation scheme has been used but the auto-correlation of measurement noise still causes unacceptable estimation errors under low SNR conditions. To overcome these problems, a stochastic error compensation method is applied for the target localization problem under the assumption that a priori stochastic information of RDOA measurement noise is available. Apart from the existing methods, the proposed linear target localization scheme can recursively compute the target position estimate which converges to true position in probability. In addition, it is remarked that the suggested algorithm has a structural reconciliation with the existing one such as linear correction least squares(LCLS) estimator. Through the computer simulations, it is demonstrated that the proposed method shows better performance than the LCLS method and guarantees fast and reliable convergence characteristic compared to the nonlinear method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.9-17
• /
• 2014

This paper proposes a binary particle swarm optimization (BPSO) algorithm for distributed node localization in wireless sensor networks (WSNs). Each unknown node performs localization using the value of the measured distances from three or more neighboring anchors, i.e., nodes that know their location information. The node that is localized during the localization process is then used as another anchor for remaining nodes. The performances of particle swarm optimization (PSO) and BPSO in terms of localization error and computation time are compared by using simulations in Matlab. The simulation results indicate that PSO-based localization is more accurate. In contrast, BPSO algorithm performs faster for finding the location of unknown nodes for distributed localization. In addition, the effects of transmission range and number of anchor nodes on the localization error and computation time are investigated.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.24-33
• /
• 2009

In patch-and-stitch localization algorithms, a flip error refers to the kind of error in which a patch is stitched to the map as being wrongly reflected. In this paper, we present an anchor-free localization algorithm which tries to detect and prevent flip errors. The flip error prevention is achieved by two filtering mechanisms: the flip-ambiguity test and the flip-conflict detection. We evaluate the performances of proposed techniques though simulations and show that they achieve significant performance improvements.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.597-599
• /
• 2005

To make the autonomous mobile robot move in the unknown space, we have to know the information of current location of the robot. So far, the location information that was obtained using Encoder always includes Dead Reckoning Error, which is accumulated continuously and gets bigger as the distance of movement increases. In this paper, we analyse the effect of the size of the two wheels of the mobile robot and the wheel track of them among the factors of Dead Reckoning Error. And after this, we compensate this Dead Reckoning Error by Kalman filter using Gyro Sensors. To accomplish this, we develop the controller to analyse the error components of Gyro Sensor and to minimize the error values. We employ the numerical approach to analyse the error components by linearizing them because each error component is nonlinear. And we compare the improved result through simulation.