IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0028993.html
   My bibliography  Save this article

Which States Matter? An Application of an Intelligent Discretization Method to Solve a Continuous POMDP in Conservation Biology

Author

Listed:
  • Sam Nicol
  • Iadine Chadès

Abstract

When managing populations of threatened species, conservation managers seek to make the best conservation decisions to avoid extinction. Making the best decision is difficult because the true population size and the effects of management are uncertain. Managers must allocate limited resources between actively protecting the species and monitoring. Resources spent on monitoring reduce expenditure on management that could be used to directly improve species persistence. However monitoring may prevent sub-optimal management actions being taken as a result of observation error. Partially observable Markov decision processes (POMDPs) can optimize management for populations with partial detectability, but the solution methods can only be applied when there are few discrete states. We use the Continuous U-Tree (CU-Tree) algorithm to discretely represent a continuous state space by using only the states that are necessary to maintain an optimal management policy. We exploit the compact discretization created by CU-Tree to solve a POMDP on the original continuous state space. We apply our method to a population of sea otters and explore the trade-off between allocating resources to management and monitoring. We show that accurately discovering the population size is less important than management for the long term survival of our otter population.

Suggested Citation

  • Sam Nicol & Iadine Chadès, 2012. "Which States Matter? An Application of an Intelligent Discretization Method to Solve a Continuous POMDP in Conservation Biology," PLOS ONE, Public Library of Science, vol. 7(2), pages 1-8, February.
  • Handle: RePEc:plo:pone00:0028993
    DOI: 10.1371/journal.pone.0028993
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0028993
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0028993&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0028993?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Christos H. Papadimitriou & John N. Tsitsiklis, 1987. "The Complexity of Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 12(3), pages 441-450, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kirk A. Yost & Alan R. Washburn, 2000. "The LP/POMDP marriage: Optimization with imperfect information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 607-619, December.
    2. Daniel S. Bernstein & Robert Givan & Neil Immerman & Shlomo Zilberstein, 2002. "The Complexity of Decentralized Control of Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 819-840, November.
    3. Héctor Jasso-Fuentes & Carlos G. Pacheco & Gladys D. Salgado-Suárez, 2023. "A discrete-time optimal execution problem with market prices subject to random environments," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(3), pages 562-583, October.
    4. Hao Zhang, 2010. "Partially Observable Markov Decision Processes: A Geometric Technique and Analysis," Operations Research, INFORMS, vol. 58(1), pages 214-228, February.
    5. Martin Mundhenk, 2000. "The Complexity of Optimal Small Policies," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 118-129, February.
    6. Yu Wu & Bo Zeng & Siming Huang, 2019. "A Dynamic Strategy for Home Pick-Up Service with Uncertain Customer Requests and Its Implementation," Sustainability, MDPI, vol. 11(7), pages 1-21, April.
    7. Bismut, Elizabeth & Straub, Daniel, 2021. "Optimal adaptive inspection and maintenance planning for deteriorating structural systems," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    8. Bren, Austin & Saghafian, Soroush, 2018. "Data-Driven Percentile Optimization for Multi-Class Queueing Systems with Model Ambiguity: Theory and Application," Working Paper Series rwp18-008, Harvard University, John F. Kennedy School of Government.
    9. Özgür-Ünlüakın, Demet & Bilgiç, Taner, 2017. "Performance analysis of an aggregation and disaggregation solution procedure to obtain a maintenance plan for a partially observable multi-component system," Reliability Engineering and System Safety, Elsevier, vol. 167(C), pages 652-662.
    10. Kling, David M. & Sanchirico, James N. & Fackler, Paul L., 2017. "Optimal monitoring and control under state uncertainty: Application to lionfish management," Journal of Environmental Economics and Management, Elsevier, vol. 84(C), pages 223-245.
    11. David A. Goldberg & Martin I. Reiman & Qiong Wang, 2021. "A Survey of Recent Progress in the Asymptotic Analysis of Inventory Systems," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1718-1750, June.
    12. Michael Jong Kim, 2016. "Robust Control of Partially Observable Failing Systems," Operations Research, INFORMS, vol. 64(4), pages 999-1014, August.
    13. Boloori, Alireza & Saghafian, Soroush & Chakkera, Harini A. A. & Cook, Curtiss B., 2017. "Data-Driven Management of Post-transplant Medications: An APOMDP Approach," Working Paper Series rwp17-036, Harvard University, John F. Kennedy School of Government.
    14. Declan Mungovan & Enda Howley & Jim Duggan, 2011. "The influence of random interactions and decision heuristics on norm evolution in social networks," Computational and Mathematical Organization Theory, Springer, vol. 17(2), pages 152-178, May.
    15. Michael O’Sullivan & Arthur F. Veinott, Jr., 2017. "Polynomial-Time Computation of Strong and n -Present-Value Optimal Policies in Markov Decision Chains," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 577-598, August.
    16. Jan Hązła & Ali Jadbabaie & Elchanan Mossel & M. Amin Rahimian, 2021. "Bayesian Decision Making in Groups is Hard," Operations Research, INFORMS, vol. 69(2), pages 632-654, March.
    17. Vassilios Christopoulos & Paul R Schrater, 2015. "Dynamic Integration of Value Information into a Common Probability Currency as a Theory for Flexible Decision Making," PLOS Computational Biology, Public Library of Science, vol. 11(9), pages 1-26, September.
    18. Peter Buchholz & Dimitri Scheftelowitsch, 2019. "Computation of weighted sums of rewards for concurrent MDPs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 1-42, February.
    19. Ian Post & Yinyu Ye, 2015. "The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 859-868, October.
    20. Guo, Xianping & Ye, Liuer & Yin, George, 2012. "A mean–variance optimization problem for discounted Markov decision processes," European Journal of Operational Research, Elsevier, vol. 220(2), pages 423-429.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0028993. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.