Finding the Optimal Path in 3D Spaces Using EDAs – The Wireless Sensor Networks Scenario
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.
KeywordsWireless Sensor Network Approximation Algorithm Mobile Robot Optimal Path Distribution Algorithm
Unable to display preview. Download preview PDF.
- 5.Elbassioni, K.M., Fishkin, A.V., Mustafa, N.H., Sitters, R.A.: Approximation Algorithms for Euclidean Group TSP. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1115–1126. Springer, Heidelberg (2005)Google Scholar
- 8.Larrañaga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
- 9.Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In: The eleventh annual symposium on computational geometry, pp. 360–369 (1995)Google Scholar
- 12.Yuan, B., Gallagher, M.: On the Importance of Diversity Maintenance in Estimation of Distribution Algorithms. In: The 2005 Genetic and Evolutionary Computation Conference, pp. 719–726 (2005)Google Scholar