{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T20:08:24Z","timestamp":1694117304993},"reference-count":35,"publisher":"ASME International","issue":"2","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,1]]},"abstract":"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.<\/jats:p>","DOI":"10.1115\/1.4039901","type":"journal-article","created":{"date-parts":[[2018,7,21]],"date-time":"2018-07-21T03:35:31Z","timestamp":1532144131000},"update-policy":"http:\/\/dx.doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":0,"title":["A Sequential Sampling Algorithm for Multistage Static Coverage Problems"],"prefix":"10.1115","volume":"18","author":[{"given":"Binbin","family":"Zhang","sequence":"first","affiliation":[{"name":"MAD LAB, Mechanical and Aerospace Engineering, University at Buffalo, SUNY, Buffalo, NY 14260 e-mail:"}]},{"given":"Jida","family":"Huang","sequence":"additional","affiliation":[{"name":"Industrial and Systems Engineering, University at Buffalo, SUNY, Buffalo, NY 14260 e-mail:"}]},{"given":"Rahul","family":"Rai","sequence":"additional","affiliation":[{"name":"MAD LAB, Mechanical and Aerospace Engineering, University at Buffalo, SUNY, Buffalo, NY 14260 e-mail:"}]},{"given":"Hemanth","family":"Manjunatha","sequence":"additional","affiliation":[{"name":"Mechanical and Aerospace Engineering, University at Buffalo, SUNY, Buffalo, NY 14260 e-mail:"}]}],"member":"33","published-online":{"date-parts":[[2018,4,30]]},"reference":[{"issue":"2","key":"2019100601374305600_bib1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/S0377-2217(97)00262-2","article-title":"A Multicriteria Decision-Making Approach to University Resource Allocations and Information Infrastructure Planning","volume":"110","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"2019100601374305600_bib2","doi-asserted-by":"crossref","unstructured":"Mainwaring, A., Culler, D., Polastre, J., Szewczyk, R., and Anderson, J., 2002, \u201cWireless Sensor Networks for Habitat Monitoring,\u201d First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), Atlanta, GA, Sept. 28, pp. 88\u201397.10.1145\/570738.570751","DOI":"10.1145\/570748.570751"},{"issue":"2","key":"2019100601374305600_bib3","first-page":"705","article-title":"Evaluation of Network Resilience, Survivability, and Disruption Tolerance: Analysis, Topology Generation, Simulation, and Experimentation","volume":"52","year":"2013","journal-title":"Telecommun. Syst."},{"issue":"3","key":"2019100601374305600_bib4","doi-asserted-by":"publisher","first-page":"031403","DOI":"10.1115\/1.4032395","article-title":"A Novel Sampling Technique for Probabilistic Static Coverage Problems","volume":"138","year":"2016","journal-title":"ASME J. Mech. Des."},{"key":"2019100601374305600_bib5","doi-asserted-by":"crossref","unstructured":"Mathew, G., and Surana, A., 2012, \u201cA Static Coverage Algorithm for Locational Optimization,\u201d IEEE 51st Annual Conference on Decision and Control (CDC), Maui, HI, Dec. 10\u201313, pp. 806\u2013811.10.1109\/CDC.2012.6426561","DOI":"10.1109\/CDC.2012.6426561"},{"key":"2019100601374305600_bib6","doi-asserted-by":"crossref","unstructured":"Berry, J., Hart, W. E., Phillips, C. A., Uber, J. G., and Watson, J.-P., 2006, \u201cSensor Placement in Municipal Water Networks With Temporal Integer Programming Models,\u201d J. Water Resour. Plann. Manage., 132(4), pp. 218\u2013224.10.1061\/(ASCE)0733-9496(2006)132:4(218)","DOI":"10.1061\/(ASCE)0733-9496(2006)132:4(218)"},{"key":"2019100601374305600_bib7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-319-13111-5_5","article-title":"Covering Location Problems","volume-title":"Location Science","year":"2015"},{"key":"2019100601374305600_bib8","volume-title":"Discrete Location Theory","year":"1990"},{"key":"2019100601374305600_bib9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-319-13111-5_2","article-title":"The p-Median Problem","volume-title":"Location Science","year":"2015"},{"key":"2019100601374305600_bib10","unstructured":"Huang, W. H., 2001, \u201cOptimal Line-Sweep-Based Decompositions for Coverage Algorithms,\u201d IEEE International Conference on Robotics and Automation (ICRA), Seoul, South Korea, May 21\u201326, pp. 27\u201332.10.1109\/ROBOT.2001.932525"},{"key":"2019100601374305600_bib11","unstructured":"Heo, N., and Varshney, P. K., 2003, \u201cA Distributed Self Spreading Algorithm for Mobile Wireless Sensor Networks,\u201d Wireless Communications and Networking (WCNC), New Orleans, LA, Mar. 16\u201320, pp. 1597\u20131602.10.1109\/WCNC.2003.1200625"},{"key":"2019100601374305600_bib12","doi-asserted-by":"crossref","unstructured":"Maza, I., and Ollero, A., 2007, \u201cMultiple Uav Cooperative Searching Operation Using Polygon Area Decomposition and Efficient Coverage Algorithms,\u201d Distributed Autonomous Robotic Systems 6, Springer, Tokyo, Japan, pp. 221\u2013230.","DOI":"10.1007\/978-4-431-35873-2_22"},{"key":"2019100601374305600_bib13","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., and Imai, H., 1994, \u201cApplications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering,\u201d Tenth Annual Symposium on Computational Geometry (SCG), Stony Brook, NY, June 6\u20138, pp. 332\u2013339.10.1145\/177424.178042","DOI":"10.1145\/177424.178042"},{"key":"2019100601374305600_bib14","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","year":"2009"},{"key":"2019100601374305600_bib15","first-page":"7","article-title":"Voronoi Diagram-Based Research on Spatial Distribution Characteristics of Rural Settlements and Its Affecting Factors\u2014A Case Study of Changping District","volume":"2","year":"2009","journal-title":"J. Ecol. Rural Environ."},{"key":"2019100601374305600_bib16","doi-asserted-by":"crossref","unstructured":"Patil, P., and Gokhale, A., 2013, \u201cVoronoi-Based Placement of Road-Side Units to Improve Dynamic Resource Management in Vehicular Ad Hoc Networks,\u201d International Conference on Collaboration Technologies and Systems (CTS), San Diego, CA, May 20\u201324, pp. 389\u2013396.10.1109\/CTS.2013.6567260","DOI":"10.1109\/CTS.2013.6567260"},{"key":"2019100601374305600_bib17","doi-asserted-by":"crossref","unstructured":"Breitenmoser, A., Schwager, M., Metzger, J.-C., Siegwart, R., and Rus, D., 2010, \u201cVoronoi Coverage of Non-Convex Environments With a Group of Networked Robots,\u201d IEEE International Conference on Robotics and Automation (ICRA), Anchorage, AK, May 3\u20137, pp. 4982\u20134989.10.1109\/ROBOT.2010.5509696","DOI":"10.1109\/ROBOT.2010.5509696"},{"issue":"1","key":"2019100601374305600_bib18","first-page":"42","article-title":"Path Planning for Mobile Robot Navigation Using Voronoi Diagram and Fast Marching","volume":"2","year":"2011","journal-title":"Int. J. Rob. Autom."},{"key":"2019100601374305600_bib19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.14198\/JoPha.2007.1.1.05","article-title":"Voronoi-Based Space Partitioning for Coordinated Multi-Robot Exploration","volume-title":"J. Phys. Agents","year":"2007"},{"key":"2019100601374305600_bib20","article-title":"Analysis of Multi-Robot Cooperation Using Voronoi Diagrams","year":"2005"},{"issue":"4","key":"2019100601374305600_bib21","first-page":"1714","article-title":"Spatial Resource Allocation: Multi Task, Multi Competences Case","volume":"8","year":"2014","journal-title":"Int. J. Innovation Appl. Stud."},{"key":"2019100601374305600_bib22","doi-asserted-by":"crossref","unstructured":"Hiatt, L. M., and Simmons, R., 2007, \u201cPre-Positioning Assets to Increase Execution Efficiency,\u201d IEEE International Conference on Robotics and Automation (ICRA). Rome, Italy, Apr. 10\u201314, pp. 324\u2013329.10.1109\/ROBOT.2007.363807","DOI":"10.1109\/ROBOT.2007.363807"},{"issue":"12","key":"2019100601374305600_bib23","doi-asserted-by":"publisher","first-page":"624","DOI":"10.2514\/1.41159","article-title":"Airspace Sector Redesign Based on Voronoi Diagrams","volume":"6","year":"2009","journal-title":"J. Aerosp. Comput., Inf., Commun."},{"issue":"36\u201338","key":"2019100601374305600_bib24","doi-asserted-by":"publisher","first-page":"3902","DOI":"10.1016\/j.cma.2004.09.007","article-title":"A New Meta-Heuristic Algorithm for Continuous Engineering Optimization: Harmony Search Theory and Practice","volume":"194","year":"2005","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"2\/3","key":"2019100601374305600_bib25","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","article-title":"Genetic Algorithms and Machine Learning","volume":"3","year":"1988","journal-title":"Mach. Learning"},{"key":"2019100601374305600_bib26","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1007\/978-0-387-30164-8_630","article-title":"Particle Swarm Optimization","volume-title":"Encyclopedia of Machine Learning","year":"2011"},{"key":"2019100601374305600_bib27","article-title":"An Idea Based on Honey Bee Swarm for Numerical Optimization","volume-title":"TR06","year":"2005"},{"issue":"2","key":"2019100601374305600_bib28","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","article-title":"A New Heuristic Optimization Algorithm: Harmony Search","volume":"76","year":"2001","journal-title":"Simulation"},{"issue":"4","key":"2019100601374305600_bib29","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential Evolution\u2014A Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces","volume":"11","year":"1997","journal-title":"J. Global Optim."},{"key":"2019100601374305600_bib30","article-title":"Pattern Search Methods for Nonlinear Optimization","volume-title":"SIAG\/OPT Views and News","year":"1995"},{"key":"2019100601374305600_bib31","article-title":"Robust Parameter Design for Automatically Controlled Systems and Nanostructure Synthesis","volume-title":"Ph.D. thesis","year":"2007"},{"key":"2019100601374305600_bib32","article-title":"A Matlab Kriging Toolbox, Version 2.0","year":"2002"},{"key":"2019100601374305600_bib33","article-title":"Support Vector Regression","year":"2004"},{"issue":"9","key":"2019100601374305600_bib34","doi-asserted-by":"publisher","first-page":"3853","DOI":"10.1016\/j.asoc.2013.05.004","article-title":"Free Pattern Search for Global Optimization","volume":"13","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"2019100601374305600_bib35","article-title":"Ncep\/Ncar Reanalysis 1: Pressure Uwind","year":"2015"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4039901\/6103109\/jcise_018_02_021016.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/doi\/10.1115\/1.4039901\/6103109\/jcise_018_02_021016.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T22:00:12Z","timestamp":1693778412000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/doi\/10.1115\/1.4039901\/371587\/A-Sequential-Sampling-Algorithm-for-Multistage"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,30]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.4039901","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"value":"1530-9827","type":"print"},{"value":"1944-7078","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,30]]}}}