Dynamic Resource Allocation in Conservation Planning

Authors

  • Daniel Golovin Caltech
  • Andreas Krause ETH Zurich
  • Beth Gardner North Carolina State University
  • Sarah Converse US Geological Survey Patuxent Wildlife Research Center
  • Steve Morey US Fish and Wildlife Service

Abstract

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 recommendations for dynamic conservation planning, and prove that it obtains near-optimal performance. We further evaluate our approach on a detailed reserve design case study of conservation planning for three rare species in the Pacific Northwest of the United States.

Downloads

Published

2011-08-04

How to Cite

Golovin, D., Krause, A., Gardner, B., Converse, S., & Morey, S. (2011). Dynamic Resource Allocation in Conservation Planning. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 1331-1336. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/7795

Issue

Section

Special Track on Computational Sustainability and AI