• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.831-833
• /
• 2004

In this paper, an obstacle avoidance algorithm is proposed for a network-based robot considering network delay by distribution. The proposed algorithm is based on the VFH(Vector Field Histogram) algorithm, and for the network-based robot system, in which it is assumed robot localization information is transmitted through network communication. In this paper, target vector for the VFH algorithm is estimated through the robot localization information and the measurement of its delay by distribution. The delay measurement is performed by time-stamp method. To synchronize all local clocks of the nodes distributed on the network, a global clock synchronization method is adopted. With the delay measurement, the robot localization estimation is performed by calculating the kinematics of the robot. The validation of the proposed algorithm is performed through the performance comparison of the obstacle avoidance between the proposed algorithm and the existing VFH algorithm on the network-based autonomous mobile robot.

• Korean Management Science Review
• /
• v.29 no.3
• /
• pp.1-11
• /
• 2012

This paper considers a localization problem in time difference of arrival (TDOA)-based radio frequency identification (RFID) systems. To estimate the position of a target tag, this paper suggests three localization algorithms that use benchmark tags. The benchmark tags are the same type as the target tag, but either the locations or distance of the benchmark tags are known. Two algorithms use the benchmarks for auxiliary information to improve the estimation accuracy of the other localization algorithms such as least squared estimator (LSE). The other one utilizes the benchmarks as essential tags to estimate the location. Numerical tests show that the localization accuracy can be improved by using benchmark tags especially when an algorithm using the LSE is applied to the localization problem. Furthermore, this paper shows that our benchmark algorithm is valuable when the measurement noise is large.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.87-107
• /
• 2015

Considering the localization estimation issue in mixed line-of-sight (LOS)/non-LOS(NLOS) environments based on received signal strength (RSS) measurements in wireless sensor networks, a grid-based correlation method based on the relationship between distance and RSS is proposed in this paper. The Maximum-Likelihood (ML) estimator is appended to further improve the localization accuracy. Furthermore, in order to reduce computation load and enhance performance, an improved recursively version with NLOS mitigation is also proposed. The most advantages of the proposed localization algorithm is that, it does not need any prior knowledge of the propagation model parameters and therefore does not need any offline calibration effort to calibrate the model parameters in harsh environments, which makes it more convenient for rapid implementation in practical applications. The simulation and experimental results evidence that the proposed localization algorithm exhibits good localization performance and flexibilities for different devices.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.61-80
• /
• 2018

Location information of individual nodes is important in the implementation of necessary network functions. While extensive studies focus on localization techniques in 2D space, few approaches have been proposed for 3D positioning, which brings the location closer to the reality with more complex calculation consumptions for high accuracy. In this paper, an effective range-free localization scheme is proposed for 3D space localization, and the sensitivity of parameters is evaluated. Firstly, we present an improved algorithm (MDV-Hop), that the average distance per hop of the anchor nodes is calculated by root-mean-square error (RMSE), and is dynamically corrected in groups with the weighted RMSE based on group hops. For more improvement in accuracy, we expand particle swarm optimization (PSO) of intelligent optimization algorithms to MDV-Hop localization algorithm, called PMDV-hop, in which the parameters (inertia weight and trust coefficient) in PSO are calculated dynamically. Secondly, the effect of various localization parameters affecting the PMDV-hop performance is also present. The simulation results show that PMDV-hop performs better in positioning accuracy with limited energy.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.4
• /
• pp.437-445
• /
• 2009

In this paper, we present the performance of the LOB(line of bearing) - based emitter localization algorithm. The linear LSE(least-squared error) algorithm, nonlinear LSE algorithm and Stansfield algorithm are considered. In addition, we focus on the performance improvement of the weighted estimation compared with the unweighted estimation. Each estimation algorithm is briefly introduced, and the performance of the algorithm is illustrated using the numerical results.

• Journal of Positioning, Navigation, and Timing
• /
• v.6 no.4
• /
• pp.141-147
• /
• 2017

In this paper, an efficient and robust localization algorithm using Receiver Signal Strength Difference (RSSD) for a non-cooperative RF emitter is given. The proposed algorithm firstly calculate the center point and radius of Apollonius's circles and then estimate the intersection point of the circles based on Time of Arrival concept. And this paper also compares the performance of RSSD localization algorithms such as Non-linear Least Squares and Linearized Least Squares by Lines of Position (LOP) with the proposed algorithm. And some conclusions have been reached regarding the relative accuracy, robustness and computational cost of these algorithms.

• The Journal of Korea Robotics Society
• /
• v.1 no.2
• /
• pp.117-124
• /
• 2006

In this paper, we develope the navigation system for patrol robots in indoor environment. The proposed system consists of PDA map modelling, a localization algorithm based on a global position sensor and an automatic charging station. For the practical use in security system, the PDA is used to build object map on the given indoor map. And the builded map is downloaded to the mobile robot and used in path planning. The global path planning is performed with a localization sensor and the downloaded map. As a main controller, we use PXA270 based hardware platform in which embedded linux 2.6 is developed. Data handling for various sensors and the localization algorithm are performed in the linux platform. Also, we implemented a local path planning algorithm for object avoidance with ultra sonar sensors. Finally, for the automatic charging, we use an infrared ray system and develop a docking algorithm. The navigation system is experimented with the two-wheeled mobile robot using North-Star localization system.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.5
• /
• pp.67-72
• /
• 2019

The self-driving cars identify appropriate navigation paths and obstacles to arrive at their destinations without human control. The autonomous cars are capable of sensing driving environments to improve driver and pedestrian safety by sharing with neighbor traffic infrastructure. In this paper, we have focused on pedestrian protection and have designed an improved localization algorithm to track mobile users on roads by interacting with smart traffic lights in vehicle environments. We developed smart traffic lights with the RSSI sensor and built the proposed method by improving the Kalman filter algorithm to localize mobile users accurately. We successfully evaluated the proposed algorithm to improve the mobile user localization with deployed five smart traffic lights.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4940-4957
• /
• 2019

Compared with the localization methods in the static sensor networks, node localization in dynamic sensor networks is more complicated due to the mobility of the nodes. Dynamic Sampling Localization Algorithm Based on Virtual Anchor (DSLA) is proposed in this paper to localize the unknown nodes in dynamic sensor networks. Firstly, DSLA algorithm predicts the speed and movement direction of nodes to determine a sector sampling area. Secondly, a method of calculating the sampling quantity with the size of the sampling area dynamically changing is proposed in this paper. Lastly, the virtual anchor node, i.e., the unknown node that got the preliminary possible area (PLA), assists the other unknown nodes to reduce their PLAs. The last PLA is regarded as a filtering condition to filter out the conflicting sample points quickly. In this way, the filtered sample is close to its real coordinates. The simulation results show that the DSLA algorithm can greatly improve the positioning performance when ensuring the execution time is shorter and the localization coverage rate is higher. The localization error of the DSLA algorithm can be dropped to about 20%.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1084-1093
• /
• 2013

problem of pedestrian localization using mobile nodes containing impulse radio ultra wideband (IR-UWB) is considered. IEEE 802.15.4a-based IR-UWB can achieve accurate ranging. However, the coverage is as short as 30 m, owing to the restricted transmit power. This factor may cause a poor geometric relationship among the mobile nodes and anchor nodes in certain environments. To localize a group of pedestrians accurately, an enhanced cooperative localization method is proposed. We describe a sequential algorithm and define problems that may occur in the implementation of the algorithm. To solve these problems, a batch algorithm is proposed. The batch algorithm can be carried out after performing the sequential algorithm to linearize the nonlinear range equation. When a sequential algorithm cannot be performed due to a poor geometric relationship among nodes, a batch algorithm can be carried out directly. Herein, Monte Carlo simulations are presented to illustrate the proposed method and verify its performance.