An algorithm for maximising covered area

DOI10.1080/00207170701881833zbMath1152.90511OpenAlexW2102864148MaRDI QIDQ3543082

Stéphane Lafortune, Weilin Wang

Publication date: 1 December 2008

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207170701881833

zbMATH Keywords

wireless networkcoveragemobility control

Mathematics Subject Classification ID

Continuous location (90B85) Communication networks in operations research (90B18)

Related Items (1)

Heterogeneous locational optimisation using a generalised Voronoi partition

Cites Work

• Dense packings of congruent circles in a circle
• Monte Carlo study of the sphere packing problem
• Optimization and the Geometry of Numbers: Packing and Covering
• Asymptotically dense spherical codes. I. Wrapped spherical codes
• Asymptotically dense spherical codes .II. laminated spherical codes
• On the covering radius of Z/sub 4/-codes and their lattices
• Gaussian source coding with spherical codes
• Maximum minimal distance partitioning of the Z/sup 2/ lattice
• The Global Optimization of Incoherent Phase Signals

This page was built for publication: An algorithm for maximising covered area