Bridging adaptive management and reinforcement learning for more robust decisions.

Philos Trans R Soc Lond B Biol Sci

Department of Environmental Science, Policy, and Management, University of California, Berkeley, CA 94720, USA.

Published: July 2023

From out-competing grandmasters in chess to informing high-stakes healthcare decisions, emerging methods from artificial intelligence are increasingly capable of making complex and strategic decisions in diverse, high-dimensional and uncertain situations. But can these methods help us devise robust strategies for managing environmental systems under great uncertainty? Here we explore how reinforcement learning (RL), a subfield of artificial intelligence, approaches decision problems through a lens similar to adaptive environmental management: learning through experience to gradually improve decisions with updated knowledge. We review where RL holds promise for improving evidence-informed adaptive management decisions even when classical optimization methods are intractable and discuss technical and social issues that arise when applying RL to adaptive management problems in the environmental domain. Our synthesis suggests that environmental management and computer science can learn from one another about the practices, promises and perils of experience-based decision-making. This article is part of the theme issue 'Detecting and attributing the causes of biodiversity change: needs, gaps and solutions'.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10225849PMC
http://dx.doi.org/10.1098/rstb.2022.0195DOI Listing

Publication Analysis

Top Keywords

adaptive management
12
reinforcement learning
8
artificial intelligence
8
environmental management
8
management
5
decisions
5
bridging adaptive
4
management reinforcement
4
learning robust
4
robust decisions
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!