Hostname: page-component-5db58dd55d-h5th4 Total loading time: 0 Render date: 2026-07-08T02:03:34.352Z Has data issue: false hasContentIssue false

Crafting desirable climate trajectories with reinforcement learning explored socio-environmental simulations

Published online by Cambridge University Press:  26 August 2025

James Rudd-Jones*
Affiliation:
UCL Centre for Artificial Intelligence, Department of Computer Science, University College London , London, UK
Fiona Thendean
Affiliation:
UCL Centre for Artificial Intelligence, Department of Computer Science, University College London , London, UK
María Pérez-Ortiz
Affiliation:
UCL Centre for Artificial Intelligence, Department of Computer Science, University College London , London, UK
*
Corresponding author: James Rudd-Jones; Email: james.rudd-jones.22@ucl.ac.uk

Abstract

Climate change poses an existential threat, necessitating effective climate policies to enact impactful change. Decisions in this domain are incredibly complex, involving conflicting entities and evidence. In the last decades, policymakers increasingly use simulations and computational methods to guide some of their decisions. Integrated Assessment Models (IAMs) are one of such methods, which combine social, economic, and environmental simulations to forecast potential policy effects. For example, the UN uses outputs of IAMs for their recent Intergovernmental Panel on Climate Change (IPCC) reports. Traditionally these have been solved using recursive equation solvers, but have several shortcomings, e.g. struggling at decision making under uncertainty. Recent preliminary work using Reinforcement Learning (RL) as an alternative to traditional solvers shows promising results in decision making in uncertain and noisy scenarios. We extend on this work by introducing multiple interacting RL agents as a preliminary analysis on modelling the complex interplay of socio-interactions between various stakeholders or nations that drives much of the current climate crisis. Our findings show that cooperative agents in this framework can consistently chart pathways towards more desirable futures in terms of reduced carbon emissions and improved economy. However, upon introducing competition between agents, for instance by using opposing reward functions, desirable climate futures are rarely reached. Modelling competition is key to increased realism in these simulations, as such we employ policy interpretation by visualizing what states lead to more uncertain behavior, to understand algorithm failure. Finally, we highlight the current limitations and avenues for further work to ensure future technology uptake for policy derivation.

Information

Type
Application Paper
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press
Figure 0

Figure 1. The AYS model state space from Kittel et al. (2021). Translucent grey planes signify the two PBs, and the green and black points denote the fixed point end conditions for a single agent. Whisker lines indicate flow forces within the model that tend towards either of the two fixed points. The colors show the flow to the respective fixed points.

Figure 1

Figure 2. Multi-agent AYS interaction cycle (diagram adapted from Kittel et al., 2021). Block arrows are positive interactions, dashed arrows are negative interactions.

Figure 2

Figure 3. Homogeneous agent’s win rates. Each experiment is run over six seeds with the line corresponding to mean win rate with translucent standard error bounds. Num agents relates to the number of agents in the simulation.

Figure 3

Figure 4. Homogeneous agent’s win rates for a longer range of training steps. These experiments are only run over two seeds due to computational constraints.

Figure 4

Figure 5. Heterogeneous agent’s win rates. We have omitted the single agent scenario as these results match between homogeneous and heterogeneous starting points. Each experiment is run over six seeds with the line corresponding to mean win rate with translucent standard error bounds.

Figure 5

Figure 6. Heterogeneous agent’s win rates for a longer range of training steps. These experiments are only run over two seeds due to computational constraints.

Figure 6

Figure 7. Returns for each agent for the climate damages parameter $ {\xi}_i $ experiments. Agent $ 1 $ episode returns are on the left, which always has $ {\xi}_1=0 $. Agent $ 2 $ episode returns are on the right where $ {\xi}_2 $ varies between $ 0 $ and $ 1 $ as per the figure legend.

Figure 7

Figure 8. Overall win rates for a two agent scenario in which both agents follow the $ {R}_{PB} $ reward function, but have different climate damage parameters $ {\xi}_i $ for each experiment. Six combinations of $ {\xi}_i $ are tested.

Figure 8

Figure 9. Trajectory plots for two cooperative agents, both following the $ {R}_{PB} $ reward function. Agent $ 1 $ has red trajectories, and Agent $ 2 $ has green. The variation in color for each agent signifies trajectories from different episodes. We have visualised a sample of $ 1000 $ episodes (trajectories) to indicate the distribution of trajectories. The grid row relates to experiments that contain both agents together. In the upper row both the agents experience the same climate damages, with $ {\xi}_i=1 $ for each. In the lower row Agent $ 1 $ has $ {\xi}_1=1 $ and Agent $ 2 $ has $ {\xi}_2=0.25 $. The green fixed point is situated on the lowest vertex of the Figures, where $ E=0 $, $ Y=\infty $, and $ A=0 $. The distribution of starting states is near the middle of the Figures, where $ E\approx 10 $, $ Y\approx 60 $, and $ A\approx 250 $.

Figure 9

Figure 10. Experiments combining reward types for a two-agent scenario, the first agent always follows the $ {R}_{PB} $ reward function. Each run has two agents relating to the respective labeled reward type.

Figure 10

Figure 11. Experiments combining reward types for a three-agent scenario, the first agent always follows the $ {R}_{PB} $ reward function. Each run has three agents relating to the respective labeled reward type.

Figure 11

Figure 12. Critical state plots for two cooperative agents, both following the $ {R}_{PB} $ reward function. Figures on the left-hand side represent the actions taken at certain points along the trajectory. Reference List 2.1 that details all potential actions. Figures on the right-hand side indicate scales of logit difference in the agent’s policy action distribution, defined as the Logit Diff. Darker colors relate to lower logit difference, with the color gradation normalised over agents.

Figure 12

Figure 13. Critical states for two competitive agents, where the agents follow the $ {R}_{PB} $ and $ {R}_{maxY} $ reward functions, respectively.

Figure 13

Table A1. AYS numerical parameters (Kittel et al. 2021)

Figure 14

Table B1. Table of training hyperparameters