Learning Effective Abstractions for Planning (LEAP)

CoRL 2026 · Nov 12, 2026 · Austin, TX, USA

Overview

Complex long-horizon and sparse reward robotics tasks are challenging for scaling end-to-end learning methods. By contrast, planning approaches have shown great potential to handle such complex tasks effectively. One of the major criticisms of planning-based approaches has been the lack of availability of accurate world models (aka abstractions) to utilize.

There has been a renewed interest in using learning-based approaches to learn symbolic representations that support planning. However, this research is often fragmented into disjoint sub-communities such as task and motion planning, reinforcement learning (hierarchical, model-based), planning with formal logic, planning with natural language (language models), and neuro-symbolic AI. As in previous years, LEAP will bring together researchers from disparate subfields to discuss how we can combine learning, planning, and abstractions to solve increasingly complex long-horizon and sparse-reward robotics tasks.

As in prior editions, the workshop continues to engage with the foundational questions that have defined LEAP since its inception:

What is the right objective for abstraction learning for robotic planning? To what extent should we account for soundness, completeness, the target planner and its planning efficiency, and the task distribution?
What level of abstraction is necessary for effective robot decision-making? How general-purpose or specific must these abstractions be for long-term autonomy, and do learned abstractions need to be hierarchical?
When, where, and from what data should abstractions be learned? Should they be priors built in the robot factory, derived from expert demonstrations, or discovered "in the wild" through interaction between the robot and its environment? What are the trade-offs between top-down operator construction and bottom-up operator discovery, and how do they impact planning efficiency and generalization?

Focal Themes of LEAP 2026

While the questions above ground the workshop, our key attention this year is deliberately focused on two specific, concrete, and timely challenges in learning abstractions for planning.

💻 Theme #1: Code as Abstractions

Programs and code offer a uniquely powerful substrate for abstraction in robot planning. They are compositional, verifiable, reusable, and directly executable, and they interface naturally with modern foundation models that can read, write, and edit code. We are eager to explore and discuss when and how code is the right abstraction for robot decision-making, as well as to identify its limitations:

When is code (viz., programs, policies-as-code, reward and constraint specifications, and skill libraries) the right abstraction for robot planning? When does it break down? What soundness, completeness, and verifiability guarantees can code-based abstractions provide that other representations cannot?
How can pre-trained foundation models (LLMs, VLMs, VLAs) be used to write, refine, and repair code-based abstractions? How can we incorporate cost-sensitive reasoning, plan quality, and executability such that generated programs produce efficient, safe plans for embodied agents?
How should code-based abstractions be grounded in perception and action, learned and reused across tasks, and combined with bottom-up skill discovery, so that they facilitate imitation and reinforcement learning and remain reliable in open-world settings?

🌐 Theme #2: World Models as Abstractions

Learned world models promise abstractions of environment dynamics that can be searched, simulated, and planned over. We want to examine what makes a world model a good abstraction for planning (rather than merely for prediction), and how planning can be performed in, on top of, or adjacent to such models:

What makes a world model a good abstraction for planning rather than merely for prediction? At what level of abstraction (state, latent, object-centric, symbolic) should world models operate, and do they need to be hierarchical?
How can we plan within, on top of, or adjacent to learned world models? What are the trade-offs between planning directly within a learned model, distilling it into a planner-friendly abstraction, and using it to guide reinforcement or imitation learning?
When, where, and from what data should world-model abstractions be learned (priors built in the factory, expert demonstrations, or "in the wild" interaction), and how do we ensure the resulting plans are safe, cost-effective, and robust to model error?

Areas of Interest

We solicit papers on the following topics:

Generalizable & composable representations
Task and motion planning (TAMP)
State & action abstractions
Natural language for planning
Knowledge representations for planning
Hierarchical planning
LTL-based planning
Neuro-symbolic TAMP
Hierarchical reinforcement learning

Submission Guidelines

We solicit workshop paper submissions relevant to the above call of the following types:

Long papers — up to 8 pages plus unlimited references / appendices
Short papers — up to 4 pages plus unlimited references / appendices

Please format submissions in CoRL or IEEE conference (ICRA or IROS) styles. Submissions do not need to be anonymized. To authors submitting papers rejected from other conferences: please ensure that comments given by the reviewers are addressed prior to submission.

Note: Please feel free to submit work under review or accepted for presentation at other workshops and/or conferences as we will not require copyright transfer.

📄 Submit on OpenReview →

Note: The CoRL workshop organizers have requested that we do not accept submissions that are already accepted at the main CoRL conference. We kindly ask authors to respect this policy when submitting to our workshop.

Important Dates

Early Paper Submission Deadline

Sep 18, 2026
Late Paper Submission Deadline

Oct 7, 2026
Author Notification

Oct 24, 2026
Camera-ready Version Due

Nov 12, 2026
Workshop

Nov 12, 2026

Schedule

Time	Session
8:30 – 8:35	Opening Remarks
8:35 – 9:05	Invited Talk 1 (25 min + 5 min Q&A) Fabio Ramos (Nvidia & U. Sydney) Talk Title: “Generalizing Task and Motion Planning for Agentic Systems”
9:05 – 9:35	Invited Talk 2 (25 min + 5 min Q&A) Dieter Fox (Ai2 & UW) Talk Title: “ToyBlocks: Enabling Controlled Experiments on Robot Foundation Models”
9:35 – 9:45	Sponsor Talk
9:45 – 11:00	Poster Session (overlaps with coffee break, 10:30 – 11:00)
11:00 – 11:30	Invited Talk 3 (25 min + 5 min Q&A) Panpan Cai (Shanghai Jiao Tong U.) Talk Title: “Learning Abstractions for Robot Planning in a Big World”
11:30 – 12:00	Invited Talk 4 (25 min + 5 min Q&A) Tomás Lozano-Pérez (MIT) Talk Title: “Robot Programming”
12:00 – 12:25	Panel Discussion & Introspection
12:25 – 12:30	Closing Remarks / Best Paper Awards