• Corpus ID: 957682

Dynamic Resource Allocation in Conservation Planning

@inproceedings{Golovin2011DynamicRA,
  title={Dynamic Resource Allocation in Conservation Planning},
  author={Daniel Golovin and Andreas Krause and Beth Gardner and Sarah J. Converse and Steve Morey},
  booktitle={AAAI},
  year={2011}
}
Consider the problem of protecting endangered species by selecting patches of land to be used for conservation purposes. Typically, the availability of patches changes over time, and recommendations must be made dynamically. This is a challenging prototypical example of a sequential optimization problem under uncertainty in computational sustainability. Existing techniques do not scale to problems of realistic size. In this paper, we develop an efficient algorithm for adaptively making… 

Figures from this paper

Dynamic Resource Allocation for Optimizing Population Diffusion
TLDR
A new approach for computing HOP policies based on mixed-integer programming and dual decomposition is developed, which is eective and scalable compared to existing alternatives.
Sequential Decision Making in Computational Sustainability Through Adaptive Submodularity
TLDR
This work focuses on sequential decision making under uncertainty in conservation planning, where managers recommend patches of land in order to achieve long-term conservation of biodiversity.
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
TLDR
This work addresses the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land parcels within a given budget by exploiting the separable structure present in this problem and using Lagrangian relaxation techniques to gain scalability over the flat representation.
Scheduling Conservation Designs for Maximum Flexibility via Network Cascade Optimization
TLDR
This paper considers scheduling purchases in a way that achieves a population spread no less than desired but delays purchases as long as possible, and develops a primal-dual algorithm for the problem that computes both a feasible solution and a bound on the quality of an optimal solution.
Scheduling Conservation Designs via Network Cascade Optimization
TLDR
A primal-dual algorithm is given for the problem of scheduling land purchases to conserve an endangered species in a way that achieves maximum population spread but delays purchases as long as possible, so that conservation planners retain maximum flexibility and use available budgets in the most efficient way.
Stochastic Network Design for River Networks
TLDR
A novel approximate algorithm based on the sample average approximation (SAA) and mixed integer programming (MIP) is proposed to efficiently address the problem of using a limited budget to remove instream barriers, which prevent fish from accessing their natural habitat.
Incorporating dynamic distributions into spatial prioritization
TLDR
The need to consider dynamic movements in the conservation planning process to ensure that mobile species are adequately protected is highlighted, as a static approach to conservation planning may misdirect resources and lead to inadequate conservation for mobile species.
RESEARCH Incorporating dynamic distributions into spatial prioritization
Aim Species’ distributions are generally treated as static for the purposes of prioritization, but many species such as migrants and nomads have distributions that shift over time. Decisions about
Robust Decision Making for Stochastic Network Design
TLDR
This work is motivated by spatial conservation planning where the goal is to take management decisions within a fixed budget to maximize the expected spread of a population of species over a network of land parcels.
Sequential Decision Making in Computational Sustainability via Adaptive Submodularity
TLDR
The recently discovered notion of adaptive submodularity, an intuitive diminishing returns condition that generalizes the classical notion of submodular set functions to sequential decision problems, is reviewed.
...
1
2
3
4
...

References

SHOWING 1-10 OF 18 REFERENCES
Spatial conservation prioritization: Quantitative methods and computational tools
Habitat loss and deterioration, climate change, and economic pressures for resource extraction have all led to a global loss of biodiversity. The limited resources available for conservation need to
Maximizing the Spread of Cascades Using Network Design
TLDR
This work introduces a new optimization framework to maximize the expected spread of cascades in networks and proposes a mixed integer programming (MIP) formulation that combines elements from network design and stochastic optimization.
The Quantitative Incidence Function Model and Persistence of an Endangered Butterfly Metapopulation
The incidence function model is derived from a linear first-order Markov chain of the presence or absence of a species in a habitat patch. The model can be parameterized with “snapshot”
An Online Algorithm for Maximizing Submodular Functions
TLDR
An algorithm for solving a broad class of online resource allocation problems, applied in environments where abstract jobs arrive one at a time, and one can complete the jobs by investing time in a number of abstract activities, according to some schedule.
Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization
TLDR
It is proved that if a problem satisfies adaptive submodularity, a simple adaptive greedy algorithm is guaranteed to be competitive with the optimal policy, providing performance guarantees for both stochastic maximization and coverage.
Cost-effective outbreak detection in networks
TLDR
This work exploits submodularity to develop an efficient algorithm that scales to large problems, achieving near optimal placements, while being 700 times faster than a simple greedy algorithm and achieving speedups and savings in storage of several orders of magnitude.
Submodular secretary problem and extensions
TLDR
This article considers a very general setting of the classic secretary problem, in which the goal is to select k secretaries so as to maximize the expectation of a submodular function which defines efficiency of the selected secretarial group based on their overlapping skills, and presents the first constant-competitive algorithm for this case.
Revisiting the Greedy Approach to Submodular Set Function Maximization
TLDR
This work explores the performance of the greedy algorithm, and a related variant, the locally greedy algorithm in solving submodular function maximization problems, and reinterpret and improves various algorithmic results in the recent literature for problems that are specific instances of maximizing monotone sub modular functions in the presence of an approximate incremental oracle.
An analysis of approximations for maximizing submodular set functions—I
TLDR
It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.
Quantitative Risk Analysis: A Guide to Monte Carlo Simulation Modelling
Introduction to Monte Carlo Simulation Modelling Probability and Statistics Theory Review A Guide to Probability Distributions Building a Risk Analysis Model Determining Input Distributions from
...
1
2
...