Image de couverture de livre

Efficient Lookahead Encoding and Abstracted Width for Learning General Policies in Classical Planning

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aichmüller, Michael, Ståhlberg, Simon, Funkquist, Martin, Geffner, Hector
Format:	Preprint
Publié:	2026
Sujets:	Artificial Intelligence
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning to Ground Existentially Quantified Goals
par: Funkquist, Martin, et autres
Publié: (2024)

Sketch Decompositions for Classical Planning via Deep Reinforcement Learning
par: Aichmüller, Michael, et autres
Publié: (2024)

Learning More Expressive General Policies for Classical Planning Domains
par: Ståhlberg, Simon, et autres
Publié: (2024)

Learning to Search and Searching to Learn for Generalization in Planning
par: Aichmüller, Michael, et autres
Publié: (2026)

Learning General Policies with Policy Gradient Methods
par: Ståhlberg, Simon, et autres
Publié: (2025)

Symmetries and Expressive Requirements for Learning General Policies
par: Drexler, Dominik, et autres
Publié: (2024)

First-Order Representation Languages for Goal-Conditioned RL
par: Ståhlberg, Simon, et autres
Publié: (2025)

Learning Generalized Policies for Fully Observable Non-Deterministic Planning Domains
par: Hofmann, Till, et autres
Publié: (2024)

Learning General Policies From Examples
par: Bonet, Blai, et autres
Publié: (2025)

Differentiable Learning of Lifted Action Schemas for Classical Planning
par: Reiter, Jonas, et autres
Publié: (2026)

On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies
par: Bonet, Blai, et autres
Publié: (2024)

Learning Lifted STRIPS Models from Action Traces Alone: A Simple, General, and Scalable Solution
par: Gösgens, Jonas, et autres
Publié: (2024)

Learning Lifted Action Models From Traces of Incomplete Actions and States
par: Jansen, Niklas, et autres
Publié: (2025)

Learning Lifted Action Models from Traces with Minimal Information About Actions and States
par: Gösgens, Jonas, et autres
Publié: (2026)

Policy Mirror Descent with Lookahead
par: Protopapas, Kimon, et autres
Publié: (2024)

POrTAL: Plan-Orchestrated Tree Assembly for Lookahead
par: Conway, Evan, et autres
Publié: (2025)

Imagine-then-Plan: Agent Learning from Adaptive Lookahead with World Models
par: Liu, Youwei, et autres
Publié: (2026)

Encoding Reusable Multi-Robot Planning Strategies as Abstract Hypergraphs
par: Elimelech, Khen, et autres
Publié: (2024)

Learning with Foresight: Enhancing Neural Routing Policy via Multi-Node Lookahead Prediction
par: Jiang, Xia, et autres
Publié: (2026)

Policy Gradient with Tree Search: Avoiding Local Optimas through Lookahead
par: Koren, Uri, et autres
Publié: (2025)

Lookahead Counterfactual Fairness
par: Zuo, Zhiqun, et autres
Publié: (2024)

Constrained Decoding with Speculative Lookaheads
par: Nakshatri, Nishanth, et autres
Publié: (2024)

Learning and Reusing Policy Decompositions for Hierarchical Generalized Planning with LLM Agents
par: Sohrabi, Shirin, et autres
Publié: (2026)

ProAct: Agentic Lookahead in Interactive Environments
par: Yu, Yangbin, et autres
Publié: (2026)

Pseudo-Boolean Proof Logging for Optimal Classical Planning
par: Dold, Simon, et autres
Publié: (2025)

LLM-Evolved Pattern Generators for Optimal Classical Planning
par: Phung, Windy, et autres
Publié: (2026)

Lookahead Drifting Model
par: Zhang, Guoqiang, et autres
Publié: (2026)

Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning
par: Bettker, R. V., et autres
Publié: (2022)

Lookahead Pathology in Monte-Carlo Tree Search
par: Nguyen, Khoi P. N., et autres
Publié: (2022)

Dynamic-Width Speculative Beam Decoding for Efficient LLM Inference
par: Qin, Zongyue, et autres
Publié: (2024)

LookaheadKV: Fast and Accurate KV Cache Eviction by Glimpsing into the Future without Generation
par: Ahn, Jinwoo, et autres
Publié: (2026)

From Next Token Prediction to (STRIPS) World Models
par: Núñez-Molina, Carlos, et autres
Publié: (2025)

Learning to Plan Before Answering: Self-Teaching LLMs to Learn Abstract Plans for Problem Solving
par: Zhang, Jin, et autres
Publié: (2025)

OledFL: Unleashing the Potential of Decentralized Federated Learning via Opposite Lookahead Enhancement
par: Li, Qinglun, et autres
Publié: (2024)

Learning Abstract World Model for Value-preserving Planning with Options
par: Rodriguez-Sanchez, Rafael, et autres
Publié: (2024)

On the Diminishing Returns of Width for Continual Learning
par: Guha, Etash, et autres
Publié: (2024)

On Sample-Efficient Generalized Planning via Learned Transition Models
par: Gupta, Nitin, et autres
Publié: (2026)

Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracy
par: Zhao, Yao, et autres
Publié: (2023)

Lookahead Unmasking Elicits Accurate Decoding in Diffusion Language Models
par: Lee, Sanghyun, et autres
Publié: (2025)

Dynamic Lookahead Distance via Reinforcement Learning-Based Pure Pursuit for Autonomous Racing
par: Elgouhary, Mohamed, et autres
Publié: (2026)