• Journal of Electrical Engineering and Technology
• /
• 제7권4호
• /
• pp.606-614
• /
• 2012

A practical recursive linear robust estimation scheme is proposed for target localization in the sensor network which provides range difference of arrival (RDOA) measurements. In order to radically solve the known practical difficulties such as sensitivity for initial guess and heavy computational burden caused by intrinsic nonlinearity of the RDOA based target localization problem, an uncertain linear measurement model is newly derived. In the suggested problem setting, the target localization performance of the conventional linear estimation schemes might be severely degraded under the low SNR condition and be affected by the target position in the sensor network. This motivates us to devise a new sensor network localization algorithm within the framework of the recently developed robust least squares estimation theory. Provided that the statistical information regarding RDOA measurements are available, the estimate of the proposition method shows the convergence in probability to the true target position. Through the computer simulations, the omnidirectional target localization performance and consistency of the proposed algorithm are compared to those of the existing ones. It is shown that the proposed method is more reliable than the total least squares method and the linear correction least squares method.

• 제어로봇시스템학회논문지
• /
• 제13권10호
• /
• pp.949-955
• /
• 2007

This paper proposes an efficient localization algorithm in the RFID sensor space for the precise localization of a mobile robot. The RFID sensor space consists of embedded sensors and a mobile robot. The embedded sensors, that is tags are holding the absolute position data and provide them to the robot which carries a reader and requests the absolute position fur localization. The reader, it is called as antenna usually, gets several tag data at the same time within its readable range. It takes time to read all the tags and to process the data to estimate the position, which is a major factor to deteriorate the localization accuracy. In this paper, an efficient algorithm to estimate the position and orientation of the mobile robot as quickly as possible has been proposed. Along with the algorithm, a new allocation of the tags in the RFID sensor space is also proposed to improve the localization accuracy. The proposed algorithms are demonstrated and verified through the real experiments.

• Journal of information and communication convergence engineering
• /
• 제12권1호
• /
• pp.8-13
• /
• 2014

We consider the sensor selection problem in large sensor networks where the goal is to find the best set of sensors that maximizes application objectives. Since sensor selection typically involves a large number of sensors, a low complexity should be maintained for practical applications. We propose a geometry-based sensor selection algorithm that utilizes only the information of sensor locations. In particular, by observing that sensors clustered together tend to have redundant information, we theorize that the redundancy is inversely proportional to the distance between sensors and seek to minimize this redundancy by searching for a set of sensors with the maximum average distance. To further reduce the computational complexity, we perform an iterative sequential search without losing optimality. We apply the proposed algorithm to an acoustic sensor network for source localization, and demonstrate using simulations that the proposed algorithm yields significant improvements in the localization performance with respect to the randomly generated sets of sensors.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.27-29
• /
• 2004

This paper presents a sensor model design based on Monte Carlo Localization method. First, we define the measurement error of each sample using a map matching method by 2-D laser scanners and a pre-constructed grid-map of the environment. Second, samples are assigned probabilities due to matching errors from the gaussian probability density function considered of the sample's convergence. Simulation using real environment data shows good localization results by the designed sensor model.

• 정보처리학회논문지A
• /
• 제17A권2호
• /
• pp.53-62
• /
• 2010

모바일 센서 네트워크(Mobile Sensor Network)의 노드(Node)인 모바일 센서 차량(Mobile Sensor Vehicles)들은 특정 지역에 관해 획득한 정보를 서로 교환하고 통합하는 과정을 거쳐 자신의 위치를 파악하게 되는데 이를 지역화(localization)라 한다. 이때 모바일 센서 차량은 탑재된 각종 센서를 이용하여 자신의 위치 정보를 파악한다. 본 연구에서는 데드-레코닝(Dead-Reckoning), 컴퓨터 비전 기법, 그리고 RSSI(Received Signal Strength Identification)를 사용한 모바일 센서 차량(MSV)의 지역화 정밀도를 향상시키는 방안을 제시하고, 각각의 방식들이 가진 장점을 융합하여 보다 정밀한 지역화를 할 수 있는지 살펴본다.

• 센서학회지
• /
• 제19권4호
• /
• pp.278-284
• /
• 2010

Indoor localization for pedestrian is the key technology for caring the elderly, the visually impaired and the handicapped in health care districts. It also becomes essential for the emergency responders where the GPS signal is not available. This paper presents newly developed pedestrian localization system using the gyro sensors, the magnetic compass and pressure sensors. Instead of using the accelerometer, the pedestrian gait is estimated from the gyro sensor measurements and the travel distance is estimated based on the gait kinematics. Fusing the gyro information and the magnetic compass information for heading angle estimation is presented with the error covariance analysis. A pressure sensor is used to identify the floor the pedestrian is walking on. A complete ambulatory system is implemented which estimates the pedestrian's 3D position and the heading.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1162-1167
• /
• 2003

This paper presents a simple sensor network consists of a group of sensors, RF components, and microprocessors, to perform a distributed sensing and information transmission using wireless links. In the proposed sensor network, though each sensor node has a limited capability and a simple signal-processing engine, a group of sensor nodes can perform a various tasks through coordinated information sharing and wireless communication in a large working area. Using the capability of self-localization and tracking, we show the sensor network can be applied to localization and navigation of mobile robot in which the robot has to be coordinated effectively to perform given task in real time.

• 전기전자학회논문지
• /
• 제11권4호
• /
• pp.297-306
• /
• 2007

A sensor network is composed of a large number of sensor nodes that are densely deployed in a field. Each sensor performs a sensing task for detection specific events. After detecting this event, location information of the sensor node is very important. Range-based scheme of the proposed approaches typically achieve high accuracy on either node-to-node distances or angles, but this scheme have a drawback because all sensor nodes have the special hardware. On the other hand, range-free scheme provides economic advantage because of no needed hardware even if that leads to coarse positioning accuracy. In this paper, we propose a range-free localization algorithm without range information in wireless sensor networks. This is a range-free approach and uses a small number of anchor nodes and known sensor nodes. This paper develops a localization mechanism using the geometry conjecture (perpendicular bisector of a chord). The conjecture states that a perpendicular bisector of a chord passes through the center of the circle.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.215-236
• /
• 2017

Obtaining accurate location information is important in practical applications of wireless sensor networks (WSNs). The distance vector hop (DV-Hop) is a frequently-used range-free localization algorithm in WSNs, but it has low localization accuracy. Moreover, despite various improvements to DV-Hop-based localization algorithms, maintaining a balance between high localization accuracy and good stability and convergence is still a challenge. To overcome these shortcomings, we proposed an improved DV-Hop localization algorithm based on the bat algorithm (IBDV-Hop) for WSNs. The IBDV-Hop algorithm incorporates optimization methods that enhance the accuracy of the average hop distance and fitness function. We also introduce a nonlinear dynamic inertial weight strategy to extend the global search scope and increase the local search accuracy. Moreover, we develop an updated solutions strategy that avoids premature convergence by the IBDV-Hop algorithm. Both theoretical analysis and simulation results show that the IBDV-Hop algorithm achieves higher localization accuracy than the original DV-Hop algorithm and other improved algorithms. The IBDV-Hop algorithm also exhibits good stability, search capability and convergence, and it requires little additional time complexity and energy consumption.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.709-715
• /
• 2010

This paper represents a map building and localization system for mobile robot. Map building and navigation is a complex problem because map integrity cannot be sustained by odometry alone due to errors introduced by wheel slippage, distortion and simple linealized odometry equation. For accurate localization, we propose sensor fusion system using encoder sensor and indoor GPS module as relative sensor and absolute sensor, respectively. To build a map, we developed a sensor based navigation algorithm and grid based map building algorithm based on Embedded Linux O.S. A wall following decision engine like an expert system was proposed for map building navigation. We proved this system's validity through field test.