Potential-based reward shaping for finite horizon online POMDP planning

Adam Eck, Leen Kiat Soh, Sam Devlin, Daniel Kudenko

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


In this paper, we address the problem of suboptimal behavior during online partially observable Markov decision process (POMDP) planning caused by time constraints on planning. Taking inspiration from the related field of reinforcement learning (RL), our solution is to shape the agent’s reward function in order to lead the agent to large future rewards without having to spend as much time explicitly estimating cumulative future rewards, enabling the agent to save time to improve the breadth planning and build higher quality plans. Specifically, we extend potential-based reward shaping (PBRS) from RL to online POMDP planning. In our extension, information about belief states is added to the function optimized by the agent during planning. This information provides hints of where the agent might find high future rewards beyond its planning horizon, and thus achieve greater cumulative rewards. We develop novel potential functions measuring information useful to agent metareasoning in POMDPs (reflecting on agent knowledge and/or histories of experience with the environment), theoretically prove several important properties and benefits of using PBRS for online POMDP planning, and empirically demonstrate these results in a range of classic benchmark POMDP planning problems.

Original languageEnglish (US)
Pages (from-to)403-445
Number of pages43
JournalAutonomous Agents and Multi-Agent Systems
Issue number3
StatePublished - May 1 2016


  • Online planning
  • Potential-based reward shaping

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'Potential-based reward shaping for finite horizon online POMDP planning'. Together they form a unique fingerprint.

Cite this