Automated planning algorithms require an action model specifying the preconditions and effects of each action, but obtaining such a model is often hard. Learning action models from observations is feasible, but existing algorithms for numeric domains are offline, requiring expert traces as input. We propose the Reinforcement learning, Action Model learning, and Planning (RAMP) strategy for learning numeric planning action models online via interactions with the environment. RAMP simultaneously trains a Deep Reinforcement Learning (DRL) policy, learns a numeric action model from past interactions, and uses that model to plan future actions when possible. These components form a positive feedback loop: the RL policy gathers data to refine the action model, while the planner generates plans to continue training the RL policy. To facilitate this integration of RL and numeric planning, we developed Numeric PDDLGym, an automated framework for converting numeric planning problems to Gym environments. Experimental results on standard IPC numeric domains show that RAMP significantly outperforms PPO, a well-known DRL algorithm, in terms of solvability and plan quality.
Figures & tables
Input
Numeric
Stochastic
NS
Noisy
Obs.
Online/Offline
FAMA ( Aineto et al., 2019 )
symbolic
No
No
No
No
Partial
Offline
LOCM ( Cresswell et al., 2013 )
symbolic
No
No
No
No
Only action
Offline
Framer ( Lindsay et al., 2017 )
text
No
No
No
-
Only action
Offline
OLAM ( Lamanna et al., 2021 )
symbolic
No
No
No
No
Yes
Online
NOLAM ( Lamanna and Serafini, 2024 )
symbolic
No
No
No
Yes
Yes
Offline
ILM ( Ng and Petrick, 2019 )
symbolic
No
Yes
Yes
Yes
Yes
Online
Table 1. Comparison of various action model learning algorithms, based on their support of given problem - numeric inputs, stochasticity, non-stationarity, noisy, observability, and online/offline learning capability.
Figure 1. A high-level diagram of the RAMP strategy.
Figure 2. The Numeric PDDLGym observation encoding.
Domain
small
large
∣obs∣
∣action∣
∣obs∣
∣action∣
Counters
10
12
13
16
Sailing
6
9
12
22
Depot
62
256
80
450
Pogo
150
42
406
106
Table 2. Grounded statistics of the domains.
Figure 3. (Left) Rolling average success rate with 95% confidence intervals. (Right) Cumulative solution length with 95% confidence intervals. Top row: Small instances; bottom row: Large instances; columns: different domains.
Test
Train
Domain
Size
Recall
Solved
Timeout
counters
small
0.960
97.4
1.2
counters
large
0.990
96.6
2.0
sailing
small
0.696
87.4
0.8
sailing
large
0.849
85.2
7.0
depot
small
0.128
995.8
2.6
Table 3. Performance of NSAM in RAMP across domains and sizes. Precondition recall is measured on a held-out test set, while solved and timeout statistics are collected during online training.
Humans solve complex problems by constructing plans and mentally simulating their outcomes with an internal model of the world. Machine learning has made substantial progress in learning world models that predict the consequences of action sequences, yet the procedures used to plan with these models remain largely hand-designed. Most planners rely on fixed search or optimization rules; approaches that learn aspects of search typically imitate a predefined optimizer or use planning to inform an amortized policy, rather improving multi-step plans. We introduce Reinforced Planning, a method that learns the plan-update itself by reinforcing update rules that produce better plans, using gradients propagated through a differentiable world model. We instantiate Reinforced Planning in RP1, which learns a critic over imagined outcomes via temporal-difference learning and a neural plan-improvement operator trained via imagined rollouts with a pretrained world model. RP1 can be trained fully offline without environment interaction; environment episodes are used only for checkpoint selection. Across visual navigation, arm reaching, and robotic manipulation on two world-model backbones, RP1 matches or exceeds existing planners, achieving near-perfect success in several settings while using 1,000× fewer world-model rollouts than the strongest alternative (CEM) and planning up to 67× faster under concurrent planners inference.
Reinforcement Learning (RL) policies often degrade in unfamiliar environments because they lack explicit deliberation. We propose Plan, Align, Commit, Think (PACT), a hybrid architecture that combines a fast, reactive RL policy with a slow, deliberative Small Language Model (SLM) planner. PACT invokes the SLM asynchronously to generate and validate candidate action plans. Once a plan is verified through simulation as safe, feasible, and complete, it is executed directly, bypassing the RL policy without retraining or modifying it. Evaluated on three FrozenLake configurations of increasing difficulty, PACT outperforms all baselines while relying on a 2B-parameter SLM backbone, suggesting that deliberative planning and reactive execution are more powerful in concert than either is alone in these settings.
Nathan Gavenski, Juarez Monteiro, Francisco Galuppo +2
Department of Informatics, King’s College London, London, United Kingdom · Kunumi Institute, Belo Horizonte, Brazil
Accurate action models are critical for effective planning. Existing action-model learning methods largely assume simple action representations or become computationally intractable when learning conditional and quantified effects. We present Online Hypothesis-Driven Conditional Action Model Learning (OHCAM), an online approach for learning action models with conditional and quantified effects from limited interactions with the environment. OHCAM maintains a belief over hypothesized action models and actively selects informative actions to reduce uncertainty by maximizing disagreement among competing hypotheses, while being robust to noisy observations. To enable scalability, OHCAM begins with a small set of simple action model hypotheses and expands to more complex conditions only when the current hypotheses become inconsistent with the data. Experiments on six benchmark planning domains demonstrate that OHCAM is sample efficient in learning action models that solve substantially more tasks than baselines, even with observation noise. We validate OHCAM on two tasks using a Kinova Gen3 robot, demonstrating the real-world applicability of our approach.
Jeffrey Jewett, William Solow, Sandhya Saisubramanian