In many system-engineering problems, such as surveillance, environmental monitoring, and cooperative task performance, it is critical to allocate limited resources within a restricted area optimally. Static coverage problem (SCP) is an important class of the resource allocation problem. SCP focuses on covering an area of interest so that the activities in that area can be detected with high probabilities. In many practical settings, primarily due to financial constraints, a system designer has to allocate resources in multiple stages. In each stage, the system designer can assign a fixed number of resources, i.e., agents. In the multistage formulation, agent locations for the next stage are dependent on previous-stage agent locations. Such multistage static coverage problems are nontrivial to solve. In this paper, we propose an efficient sequential sampling algorithm to solve the multistage static coverage problem (MSCP) in the presence of resource intensity allocation maps (RIAMs) distribution functions that abstract the event that we want to detect/monitor in a given area. The agent's location in the successive stage is determined by formulating it as an optimization problem. Three different objective functions have been developed and proposed in this paper: (1) L2 difference, (2) sequential minimum energy design (SMED), and (3) the weighted L2 and SMED. Pattern search (PS), an efficient heuristic algorithm has been used as optimization algorithm to arrive at the solutions for the formulated optimization problems. The developed approach has been tested on two- and higher dimensional functions. The results analyzing real-life applications of windmill placement inside a wind farm in multiple stages are also presented.

References

References
1.
Kwak
,
N.
, and
Lee
,
C.
,
1998
, “
A Multicriteria Decision-Making Approach to University Resource Allocations and Information Infrastructure Planning
,”
Eur. J. Oper. Res.
,
110
(
2
), pp.
234
242
.
2.
Mainwaring
,
A.
,
Culler
,
D.
,
Polastre
,
J.
,
Szewczyk
,
R.
, and
Anderson
,
J.
,
2002
, “
Wireless Sensor Networks for Habitat Monitoring
,”
First ACM International Workshop on Wireless Sensor Networks and Applications
(
WSNA
), Atlanta, GA, Sept. 28, pp.
88
97
.
3.
Sterbenz
,
J. P.
,
Cetinkaya
,
E. K.
,
Hameed
,
M. A.
,
Jabbar
,
A.
,
Qian
,
S.
, and
Rohrer
,
J. P.
,
2013
, “
Evaluation of Network Resilience, Survivability, and Disruption Tolerance: Analysis, Topology Generation, Simulation, and Experimentation
,”
Telecommun. Syst.
,
52
(
2
), pp.
705
736
.
4.
Zhang
,
B.
,
Adurthi
,
N.
,
Rai
,
R.
, and
Singla
,
P.
,
2016
, “
A Novel Sampling Technique for Probabilistic Static Coverage Problems
,”
ASME J. Mech. Des.
,
138
(
3
), p.
031403
.
5.
Mathew
,
G.
, and
Surana
,
A.
,
2012
, “
A Static Coverage Algorithm for Locational Optimization
,” IEEE 51st Annual Conference on Decision and Control (
CDC
), Maui, HI, Dec. 10–13, pp.
806
811
.
6.
Berry
,
J.
,
Hart
,
W. E.
,
Phillips
,
C. A.
,
Uber
,
J. G.
, and
Watson
,
J.-P.
,
2006
, “
Sensor Placement in Municipal Water Networks With Temporal Integer Programming Models
,”
J. Water Resour. Plann. Manage.
,
132
(
4
), pp.
218
224
.
7.
García
,
S.
, and
Marín
,
A.
,
2015
, “
Covering Location Problems
,”
Location Science
,
Springer
, Cham, Switzerland, pp.
93
114
.
8.
Mirchandani
,
P.
, and
Francis
,
R.
,
1990
,
Discrete Location Theory
,
Wiley
,
New York
.
9.
Daskin
,
M. S.
, and
Maass
,
K. L.
,
2015
, “
The p-Median Problem
,”
Location Science
,
Springer
,
Cham, Switzerland
, pp.
21
45
.
10.
Huang
,
W. H.
,
2001
, “
Optimal Line-Sweep-Based Decompositions for Coverage Algorithms
,”
IEEE International Conference on Robotics and Automation
(
ICRA
), Seoul, South Korea, May 21–26, pp.
27
32
.
11.
Heo
,
N.
, and
Varshney
,
P. K.
,
2003
, “
A Distributed Self Spreading Algorithm for Mobile Wireless Sensor Networks
,”
Wireless Communications and Networking
(
WCNC
), New Orleans, LA, Mar. 16–20, pp.
1597
1602
.
12.
Maza
,
I.
, and
Ollero
,
A.
,
2007
, “
Multiple Uav Cooperative Searching Operation Using Polygon Area Decomposition and Efficient Coverage Algorithms
,”
Distributed Autonomous Robotic Systems 6
,
Springer
,
Tokyo, Japan
, pp.
221
230
.
13.
Inaba
,
M.
,
Katoh
,
N.
, and
Imai
,
H.
,
1994
, “
Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering
,”
Tenth Annual Symposium on Computational Geometry
(
SCG
), Stony Brook, NY, June 6–8, pp.
332
339
.
14.
Okabe
,
A.
,
Boots
,
B.
,
Sugihara
,
K.
, and
Chiu
,
S. N.
,
2009
,
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
, Vol.
501
,
Wiley
,
Hoboken, NJ
.
15.
Liu
,
X.
,
Zheng
,
X.
, and
Li
,
D.
,
2009
, “
Voronoi Diagram-Based Research on Spatial Distribution Characteristics of Rural Settlements and Its Affecting Factors—A Case Study of Changping District
,”
J. Ecol. Rural Environ.
,
2
, p.
7
.
16.
Patil
,
P.
, and
Gokhale
,
A.
,
2013
, “
Voronoi-Based Placement of Road-Side Units to Improve Dynamic Resource Management in Vehicular Ad Hoc Networks
,”
International Conference on Collaboration Technologies and Systems
(
CTS
), San Diego, CA, May 20–24, pp.
389
396
.
17.
Breitenmoser
,
A.
,
Schwager
,
M.
,
Metzger
,
J.-C.
,
Siegwart
,
R.
, and
Rus
,
D.
,
2010
, “
Voronoi Coverage of Non-Convex Environments With a Group of Networked Robots
,”
IEEE International Conference on Robotics and Automation
(
ICRA
), Anchorage, AK, May 3–7, pp.
4982
4989
.
18.
Garrido
,
S.
,
Moreno
,
L.
,
Blanco
,
D.
, and
Jurewicz
,
P.
,
2011
, “
Path Planning for Mobile Robot Navigation Using Voronoi Diagram and Fast Marching
,”
Int. J. Rob. Autom.
,
2
(
1
), pp.
42
64
.
19.
Wu
,
L.
,
García
,
M. Á.
,
Puig Valls
,
D.
, and
Solé Ribalta
,
A.
,
2007
, “
Voronoi-Based Space Partitioning for Coordinated Multi-Robot Exploration
,”
J. Phys. Agents
,
1
(
1
), pp.
37
44
.
20.
Law
,
J.
,
2005
, “
Analysis of Multi-Robot Cooperation Using Voronoi Diagrams
,” Pace Pacing and Clinical Electrophysiology.
21.
Ouardouz
,
M.
, and
Bernoussi
,
A. S.
,
2014
, “
Spatial Resource Allocation: Multi Task, Multi Competences Case
,”
Int. J. Innovation Appl. Stud.
,
8
(
4
), p.
1714
.
22.
Hiatt
,
L. M.
, and
Simmons
,
R.
,
2007
, “
Pre-Positioning Assets to Increase Execution Efficiency
,”
IEEE International Conference on Robotics and Automation
(
ICRA
). Rome, Italy, Apr. 10–14, pp.
324
329
.
23.
Xue
,
M.
,
2009
, “
Airspace Sector Redesign Based on Voronoi Diagrams
,”
J. Aerosp. Comput., Inf., Commun.
,
6
(
12
), pp.
624
634
.
24.
Lee
,
K. S.
, and
Geem
,
Z. W.
,
2005
, “
A New Meta-Heuristic Algorithm for Continuous Engineering Optimization: Harmony Search Theory and Practice
,”
Comput. Methods Appl. Mech. Eng.
,
194
(
36–38
), pp.
3902
3933
.
25.
Goldberg
,
D. E.
, and
Holland
,
J. H.
,
1988
, “
Genetic Algorithms and Machine Learning
,”
Mach. Learning
,
3
(
2/3
), pp.
95
99
.
26.
Kennedy
,
J.
,
2011
, “
Particle Swarm Optimization
,”
Encyclopedia of Machine Learning
,
Springer
,
New York
, pp.
760
766
.
27.
Karaboga
,
D.
,
2005
, “
An Idea Based on Honey Bee Swarm for Numerical Optimization
,” Erciyes University, Kayseri, Turkiye, Technical Report No.
TR06
.
28.
Geem
,
Z. W.
,
Kim
,
J. H.
, and
Loganathan
,
G.
,
2001
, “
A New Heuristic Optimization Algorithm: Harmony Search
,”
Simulation
,
76
(
2
), pp.
60
68
.
29.
Storn
,
R.
, and
Price
,
K.
,
1997
, “
Differential Evolution—A Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces
,”
J. Global Optim.
,
11
(
4
), pp.
341
359
.
30.
Torczon
,
V.
,
1995
, “
Pattern Search Methods for Nonlinear Optimization
,”
SIAG/OPT Views and News
, Society for Industrial and Applied Mathematics, Philadelphia, PA.
31.
Dasgupta
,
T.
,
2007
, “
Robust Parameter Design for Automatically Controlled Systems and Nanostructure Synthesis
,”
Ph.D. thesis
, Georgia Institute of Technology, Atlanta, GA.
32.
Lophaven
,
S. N.
,
Nielsen
,
H. B.
, and
Søndergaard
,
J.
,
2002
, “
A Matlab Kriging Toolbox, Version 2.0
,” Technical University of Denmark, Kgs Lyngby, Denmark.
33.
Welling
,
M.
,
2004
, “
Support Vector Regression
,” University of Toronto, Toronto, Canada.
34.
Wen
,
L.
,
Gao
,
L.
,
Li
,
X.
, and
Zhang
,
L.
,
2013
, “
Free Pattern Search for Global Optimization
,”
Appl. Soft Comput.
,
13
(
9
), pp.
3853
3863
.
35.
NOAA Research,
2015
, “
Ncep/Ncar Reanalysis 1: Pressure Uwind
,” The Office of Oceanic and Atmospheric Research (OAR), Silver Spring, MD, accessed Feb. 13, 2017, http://www.esrl.noaa.gov/psd/data/gridded/data.ncep.reanalysis.pressure.html
You do not currently have access to this content.