Dynamic Resource Allocation in Conservation Planning
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.
Additional Information
© 2011 Association for the Advancement of Artificial Intelligence. This research was partially supported by ONR grant N00014-09-1-1044, NSF grants CNS-0932392 and IIS-0953413, the Caltech Center for the Mathematics of Information, and by the US Fish and Wildlife Service. We thank J. Bakker, J. Bush, M. Jensen, T. Kaye, J. Kenagy, C. Langston, S. Pearson, M. Singer, D. Stinson, D. Stokes, and T. Thomas for their contributions.Attached Files
Published - 3617-16512-1-PB.pdf
Files
Name | Size | Download all |
---|---|---|
md5:bca38fe8b15fe88232c79f75f9af5801
|
1.6 MB | Preview Download |
Additional details
- Eprint ID
- 24896
- Resolver ID
- CaltechAUTHORS:20110816-145003751
- Office of Naval Research (ONR)
- N00014-09-1-1044
- NSF
- CNS-0932392
- NSF
- IIS-0953413
- Caltech Center for the Mathematics of Information
- US Fish and Wildlife Service
- Created
-
2011-08-16Created from EPrint's datestamp field
- Updated
-
2020-03-09Created from EPrint's last_modified field