It is critical in many system-engineering problems (such as surveillance, environmental monitoring, and cooperative task performance) to optimally allocate resources in the presence of limited resources. Static coverage problem is an important class of the resource allocation problems that focuses on covering an area of interest so that the activities in the area of interest can be detected/monitored with higher probability. 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 (agents). In the multi-stage formulation, the agents locations for the next stage are dependent on all the agents location in the previous stages. Such multi-stage static coverage problems are non-trivial to solve. In this paper, we propose a robust and efficient sequential sampling algorithm to solve the multi-stage static coverage problem in the presence of probabilistic resource intensity allocation maps (RIAMs). The agents locations are determined by formulating this problem as an optimization problem in the successive stage . Three different objective functions are compared and discussed from the aspects of decreasing L2 difference and Sequential Minimum Energy Design (SMED). It is shown that utilizing SMED objective function leads to a better approximation of the RIAMs. Two heuristic algorithms, i.e. cuckoo search, and pattern search, are used as optimization algorithms. Numerical functions and real-life applications are provided to demonstrate the robustness and efficiency of the proposed approach.
Skip Nav Destination
ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference
August 21–24, 2016
Charlotte, North Carolina, USA
Conference Sponsors:
- Design Engineering Division
- Computers and Information in Engineering Division
ISBN:
978-0-7918-5011-4
PROCEEDINGS PAPER
A Sequential Sampling Algorithm for Multi-Stage Static Coverage Problems
Hemanth Manjunatha,
Hemanth Manjunatha
University at Buffalo SUNY, Buffalo, NY
Search for other works by this author on:
Jida Huang,
Jida Huang
University at Buffalo SUNY, Buffalo, NY
Search for other works by this author on:
Binbin Zhang,
Binbin Zhang
University at Buffalo SUNY, Buffalo, NY
Search for other works by this author on:
Rahul Rai
Rahul Rai
University at Buffalo SUNY, Buffalo, NY
Search for other works by this author on:
Hemanth Manjunatha
University at Buffalo SUNY, Buffalo, NY
Jida Huang
University at Buffalo SUNY, Buffalo, NY
Binbin Zhang
University at Buffalo SUNY, Buffalo, NY
Rahul Rai
University at Buffalo SUNY, Buffalo, NY
Paper No:
DETC2016-60305, V02BT03A029; 12 pages
Published Online:
December 5, 2016
Citation
Manjunatha, H, Huang, J, Zhang, B, & Rai, R. "A Sequential Sampling Algorithm for Multi-Stage Static Coverage Problems." Proceedings of the ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. Volume 2B: 42nd Design Automation Conference. Charlotte, North Carolina, USA. August 21–24, 2016. V02BT03A029. ASME. https://doi.org/10.1115/DETC2016-60305
Download citation file:
15
Views
Related Proceedings Papers
Related Articles
Parameter Identification for Electrochemical Models of Lithium-Ion Batteries Using Sensitivity Analysis
Letters Dyn. Sys. Control (October,2021)
Risk-Based Resource Allocation for Collaborative System Design in a Distributed Environment
J. Mech. Des (June,2008)
Related Chapters
Enhancements to Optimizers
Engineering Optimization: Applications, Methods, and Analysis
Model-Building for Robust Reinforcement Learning
Intelligent Engineering Systems through Artificial Neural Networks, Volume 20
Virtualization of Data Centers and Optimization of Resource Allocation in It, by Extra Innovative Algorithms
International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3