Finding the Optimal Path in 3D Spaces Using EDAs --- The Wireless Sensor Networks Scenario

Authors:
Bo Yuan;Maria Orlowska;Shazia Sadiq
Affiliations:
School of Information Technology and Electrical Engineering, The University of Queensland, QLD 4072, Australia;School of Information Technology and Electrical Engineering, The University of Queensland, QLD 4072, Australia;School of Information Technology and Electrical Engineering, The University of Queensland, QLD 4072, Australia
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 9
Cited 1

Approximation algorithms for the geometric covering salesman problem

Discrete Applied Mathematics
Approximation algorithms for geometric tour and network design problems (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
A fast approximation algorithm for TSP with neighborhoods

Nordic Journal of Computing
Approximation algorithms for TSP with neighborhoods in the plane

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On the importance of diversity maintenance in estimation of distribution algorithms

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the complexity of approximating tsp with neighborhoods and related problems

Computational Complexity
TSP with neighborhoods of varying size

Journal of Algorithms
Approximation algorithms for euclidean group TSP

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Visiting convex regions in a polygonal map

Robotics and Autonomous Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The effective communication ranges of sensors are represented by spheres with varying diameters. The task of finding the shortest travelling path in this scenario can be regarded as an instance of a class of problems called Travelling Salesman Problem with Neighbourhoods (TSPN), which is known to be NP-hard. In this paper, we propose a novel approach to this problem using Estimation of Distribution Algorithms (EDAs), which can produce significantly improved results compared to an approximation algorithm.