Title :
On the Optimal Robot Routing Problem in Wireless Sensor Networks
Author :
Yuan, Bo ; Orlowska, Maria ; Sadiq, Shazia
Author_Institution :
Univ. of Queensland, Queensland
Abstract :
Given a set of sparsely distributed sensors in the Euclidean plane, a mobile robot is required to visit all sensors to download the data and finally return to its base. The effective range of each sensor is specified by a disk, and the robot must at least reach the boundary to start communication. The primary goal of optimization in this scenario is to minimize the traveling distance by the robot. This problem can be regarded as a special case of the traveling salesman problem with neighborhoods (TSPN), which is known to be NP-hard. In this paper, we present a novel TSPN algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.
Keywords :
mobile robots; travelling salesman problems; wireless sensor networks; Euclidean plane; NP-hard problem; mobile robot; optimal robot routing problem; sparsely distributed sensors; traveling salesman problem with neighborhoods; wireless sensor networks; Approximation algorithms; Heuristic algorithms; Mobile communication; Mobile robots; Polynomials; Robot kinematics; Robot sensing systems; Routing; Traveling salesman problems; Wireless sensor networks; Global Optimization; Heuristic Algorithms; Wireless Sensor Networks;
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
DOI :
10.1109/TKDE.2007.1062
