The paper introduces a system that automatically generates macro-operators—composite actions that compress recurring sequences of individual actions—by discovering causally linked action pairs in training data. It also prunes unused predicates from the symbolic state, reducing the number of predicates evaluated at each search node. These combined optimizations shorten the effective planning horizon and yield up to a 4.6× speedup, enabling the solution of long sequential tasks that baseline methods cannot solve.
arXiv:2505. 13372v2 Announce Type: replace Abstract: Recent work investigated the use of Reinforcement Learning (RL) for the synthesis of heuristic guidance to improve the performance of temporal planners when a domain is fixed and a set of training problems (not plans) is given.
arXiv:2606. 06877v1 Announce Type: cross Abstract: Task planning often suffers from severe efficiency bottlenecks when robots must reason over long-horizon action sequences under complex logical constraints, including object affordances, spatial relationships, and sequential action dependencies.
arXiv:2508. 08983v2 Announce Type: replace-cross Abstract: Humans can learn a new manipulation task from one or two demonstrations and then perform it in a new room, with new objects, under new constraints.
arXiv:2608. 19891v1 Announce Type: new Abstract: How to efficiently finetune robot policies to learn new tasks on the fly?
arXiv:2508. 14751v2 Announce Type: replace Abstract: We study goal-conditioned reinforcement learning in partially observable environments with sparse rewards and large, structured goal spaces.
The paper introduces a dual‑process architecture for nonlinear motion planning that blends fast, learning‑based intuition (System‑1) with slow, robust symbolic reasoning (System‑2). A metacognitive controller decides when to use each component, aiming to balance speed, precision, and adaptability. Experiments on diverse benchmark environments show consistent improvements in planning efficiency, accuracy, and generalization, highlighting the benefits of integrating learning with structured reasoning.
arXiv:2504. 17901v3 Announce Type: replace-cross Abstract: Task and motion planning (TAMP) is a well-established approach for solving long-horizon robot planning problems.
arXiv:2512. 00062v2 Announce Type: replace-cross Abstract: Robotic policy learning for complex real-world manipulation tasks has seen rapid recent progress, enabled in large part by the ability to collect demonstrations through human operation.
The paper introduces OHCAM, an online method for learning action models that include conditional and quantified effects from limited interactions. It maintains a belief over possible models and actively chooses actions that maximize disagreement among hypotheses to reduce uncertainty, while handling noisy observations. Starting with simple hypotheses, OHCAM expands complexity only when necessary, achieving sample‑efficient learning that outperforms baselines on benchmark domains and is validated on a Kinova Gen3 robot.
arXiv:2607. 17710v1 Announce Type: new Abstract: Large Language Models (LLMs) have had a remarkable impact across many areas of machine learning.
arXiv:2601. 19810v2 Announce Type: replace-cross Abstract: Unsupervised pre-training can equip reinforcement learning agents with prior knowledge and accelerate learning in downstream tasks.
arXiv:2606. 10507v1 Announce Type: new Abstract: While Large Language Models (LLMs) have demonstrated strong capabilities as autonomous agents across a wide range of tasks, their performance often degrades in multi-turn long-horizon agentic tasks.