Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Settings


  • Rushang Karia Arizona State University
  • Pulkit Verma Arizona State University
  • Alberto Speranzon Lockheed Martin
  • Siddharth Srivastava Arizona State University




This paper introduces a new approach for continual planning and model learning in relational, non-stationary stochastic environments. Such capabilities are essential for the deployment of sequential decision-making systems in the uncertain and constantly evolving real world. Working in such practical settings with unknown (and non-stationary) transition systems and changing tasks, the proposed framework models gaps in the agent's current state of knowledge and uses them to conduct focused, investigative explorations. Data collected using these explorations is used for learning generalizable probabilistic models for solving the current task despite continual changes in the environment dynamics. Empirical evaluations on several non-stationary benchmark domains show that this approach significantly outperforms planning and RL baselines in terms of sample complexity. Theoretical results show that the system exhibits desirable convergence properties when stationarity holds.




How to Cite

Karia, R., Verma, P., Speranzon, A., & Srivastava, S. (2024). Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Settings. Proceedings of the International Conference on Automated Planning and Scheduling, 34(1), 310-318. https://doi.org/10.1609/icaps.v34i1.31489