Robot assisted localization of sensor networks guided by rigidity
نویسندگان
چکیده
In this paper, we propose a robot assisted localization guided by rigidity checking. For a network to be localizable, it must be rigid, which means given the existing edge constraints, there is only one location for each node in it. Many networks, however, are not rigid. To localize these nonrigid network, a robot can be used to add additional distance measure between nodes so that the network becomes rigid and localizable. To facilitate the localization and reduce the travel cost of the robot, the rigid subregions of the network are first identified. The identification of rigid subregions provides a guide for the movement of robots. A brief introduction to rigidity theory is presented in this paper. Experiments that evaluate the performance of the proposed approach are presented. The experimental results prove that the proposed approach is sound and gives excellent results compared to previous approaches for localization.
منابع مشابه
Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملRigidity guided localisation for mobile robotic sensor networks
This paper introduces a rigidity-guided localisation approach for mobile robotic sensor networks. The localisation uses a distance graph composed of both the robot-to-robot ranging data and the motion trajectories from robot odometry. The motion of a robot depends on the result of the rigidity test of its local distance graph: if the graph is not uniquely localisable, the robot moves around in ...
متن کاملA multi-hop PSO based localization algorithm for wireless sensor networks
A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...
متن کاملImprove range-free localization accuracy in wireless sensor network using DV-hop and zoning
In recent years, wireless sensor networks have drawn great attention. This type of network is composed of a large number of sensor nodes which are able to sense, process and communicate. Besides, they are used in various fields such as emergency relief in disasters, monitoring the environment, military affairs and etc. Sensor nodes collect environmental data by using their sensors and send them...
متن کاملTrilateration Technique for Localization in Wireless Sensor Networks
The localization of wireless sensor networks is an important problem where the location of wireless sensors is determined using the distance between sensors. Trilateration is a geometric technique used to find location of points in 2D using distances. Using geometry, one can find the location of a point uniquely in 2D given its distance to three other points in 2D. The problem of finding the tr...
متن کامل