Search: “task-planning”

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

The Last AI Built by Humans: Toward Genuine Recursive Self-Improvement

Position paper defines recursive self-improvement for AI, introduces the Headroom-Closed Index and an autonomy roadmap toward genuine recursive meta-improvement.

The paper uses the Headroom-Closed Index to diagnose limitations of existing LLMs and frames recursive self-improvement (RSI) as a staged roadmap: improvement-execution, improvement-strategy, experience-acquisition, and environment-adaptation autonomy, culminating in recursive meta-improvement. It examines RSI across scientific discovery, embodied intelligence, and software engineering, highlighting differing requirements and development speeds. Drawing on industry practices and preliminary empirical evidence, it connects RSI research with practical systems and identifies key challenges to achieving genuine RSI.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:44 UTC · 5d agoAI research 2 sources1

25

Memory as Plans: World-Action Modeling with Memory-Grounded Planning

Researchers introduce MaP-WAM, decomposing memory-dependent robot manipulation into memory-grounded planning and plan-conditioned execution, achieving 83.3% on RMBench and 78% on real robots.

MaP-WAM converts long-term multimodal episodic memory — segment records with language instructions and sparse visual context — into compact plans of next-segment language goals and visual guidance. A World-Action-Progress model jointly predicts action chunks and execution progress, calibrating predictions via plan-observation alignment for adaptive segment transitions and closed-loop context updates. Structured attention keeps the executor context length fixed and enables key-value caching, yielding state-of-the-art 83.3% success on RMBench, 78.0% on real-robot tasks, and roughly constant inference latency as task history grows.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research

32

The /wayfinder Skill: Navigating the “Fog of War” of Planning

Matt Pocock released the /wayfinder skill, an orchestrator layer that manages planning sessions, maps, and tickets for AFK coding agents.

Latent Space interviews Matt Pocock, whose AI Skills for Real Engineers project has 220,000+ GitHub stars, about his new /wayfinder skill. The skill manages agent context during ambiguous planning by splitting work into grilling, prototype, research, and task tickets organized under a shared map, enabling overnight AFK agent runs. It uses deliberate terminology like map, ticket, and session to steer agent behavior, and was tested on projects including a personal website rearchitecture.

Latent Space·Aug 20, 20:59 UTC · 26d agoAI tools & infra

32

Learning-Guided Planning in Large Dynamic Action Spaces: Budgeted Tree Search for One-to-Many Mobile Charging

LP-BTS uses graph proposal policies, learned critics, and budgeted PUCT search to plan mobile charging across dynamic action spaces up to 2,813 stops.

LP-BTS is a learning-guided planning architecture for one-to-many mobile charging, where N=250 sensors induce roughly 1,125 initial candidate charging stops. A graph proposal policy concentrates candidate support, a learned value critic evaluates leaves, and edge-budgeted PUCT compares simulated futures, letting a single frozen checkpoint cover action universes from 736 to 2,813 stops. On a sealed 30-scenario confirmatory bank it attains the highest observed survival (0.4545) and alive-AUC (0.8031), though its +0.0066 survival edge over the strongest engineered comparator is statistically unresolved.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 16:42 UTC · 21h agoAI research

13

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Researchers introduce Procedural Graphs, self-evolving (procedure, relation, procedure) structures guiding LLM agent tool use and planning.

Procedural Graphs organize procedural knowledge into (procedure, relation, procedure) triplets to guide LLM agent actions, addressing drift such as lost objectives, out-of-order tool calls, and repeated unproductive steps. At each decision step the framework localizes the active node and a guidance model translates the surrounding subgraph into step-level situational guidance. An LLM refiner edits graph topology by contrasting failed with successful trajectories, and across datasets, task types and LLMs the approach outperforms memory-based baselines and matches or surpasses hand-designed graphs.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:59 UTC · 7d agoAI research1

25

Misleading the Planner through Deceptive Resumes: Registration-Time Injection in Centralized Multi-Agent Systems

Researchers demonstrate registration-time prompt injection in centralized LLM multi-agent systems, dropping GAIA task success from 84.31% to 37.25%, and propose DescGuard defense.

The paper identifies a registration-time injection channel in centralized LLM multi-agent systems where third-party worker agent descriptions are trusted by the planner before any user instruction arrives. Analyzing 32,000 descriptions from three public agent marketplaces, at least 23.35% contain content outside the four defined description fields. Eight description-manipulation attack strategies targeting task decomposition, capability grounding, and subtask specification cut GAIA task success from 84.31% to 37.25% and increased token consumption or execution time by over 111%, persisting across two MAS implementations, six planner LLMs, and four evaluators. The proposed DescGuard defense filters descriptions to worker-scoped interface information and restores metrics toward baseline without modifying workers, planner, or orchestration logic.

arXiv cs.CR·Sep 14, 13:06 UTC · 2d agoAI safety & security

56

Not All Prompts Are Equal: Exploration-Guided Prompt Scaffolding for Multimodal Reinforcement Post-Training

Exploration-guided prompt scaffolding rewrites training prompts by Exploration Potential Score, boosting multimodal RL post-training accuracy up to 11.5%.

The paper proposes dynamically adapting the training prompt distribution during online RL post-training of multimodal LLMs using the Exploration Potential Score (EPS), a lightweight rollout-based proxy for prompt utility computed from on-policy statistics with no additional overhead. Rather than discarding low-utility prompts, a teacher model generates scaffolded rewrites that preserve task intent while making training more informative. Integrated with GRPO on Geo3K and MMK12, the method achieves up to 9.7% relative in-domain improvement plus 11.5% on MathVision and 11.1% on MMMU-Pro.

Hugging Face daily papers·Sep 13, 20:00 UTC · 2d agoAI research

35

Revisiting Complete Reasoning Traces for Post-Training

Researchers show full reasoning traces provide limited benefit in LLM post-training, with heavily truncated or endpoint-only trajectories performing comparably.

A pilot study plus attention-based analyses and controlled token-removal studies show intermediate tokens in reasoning trajectories contribute minimally to final reasoning quality. Partial trajectories remain effective even under heavy truncation, and training on endpoints alone leads to consistent changes in reasoning behavior. The finding also benefits reinforcement-learning and on-policy distillation post-training; code is released at github.com/naver-ai/revisiting-trace.

Hugging Face daily papers·Sep 6, 20:00 UTC · 9d agoAI research

32

Beneath the Surface of Chains-of-Thought: A Mechanistic Interpretation of Reasoning Operations in LLMs

Study shows LLM reasoning operations like planning and deduction are geometrically separable in hidden states, with separability peaking in middle layers.

Researchers investigate whether functional reasoning operations — problem formulation, goal decomposition, deduction — have corresponding geometric structure in LLM hidden representations. They find operations are separable in held-out representations with separability peaking in middle layers, ruling out lexical and positional confounds; token-wise operation alignment becomes more distributed across layers, and identical surface tokens are represented differently depending on their surrounding chunk. Attention-masking interventions show chunk-onset operation-aligned representations depend on preceding reasoning context; code is released on GitHub (naver-ai/beneath-cot).

Hugging Face daily papers·Sep 3, 20:00 UTC · 12d agoAI research1

40

EmbodiedSkills: A Unified Framework for Orchestrating, Training, and Deploying VLA Agents

Researchers introduce EmbodiedSkills, a framework treating VLA skill decisions as verified execution proposals, reaching 86.2% success on RoboTwin 2.0.

The EmbodiedSkills framework treats each vision-language-action skill decision as an execution proposal, checking prerequisites before execution and verifying outcomes afterward via a shared executable-skill interface. It connects high-level skill selection, bounded low-level VLA execution and post-action verification in a single agent loop, and logs structured trajectories for supervision and optional online adaptation. Instantiated with Qwen3-VL and OpenPI/pi0.5, task-adapted policies achieve 86.20% average success across 50 RoboTwin 2.0 tasks and 97.40% across the four LIBERO suites, with 12.5% on memory-dependent RMBench tasks.

Hugging Face daily papers·Aug 31, 20:00 UTC · 15d agoAI research1

46

RoboSPA: Can VLA Models Go Beyond Simple Scenes and Short-Horizon Tasks?

RoboSPA introduces a 527K-trajectory robotic benchmark with 280 task variants exposing VLA model weaknesses in spatial reasoning and long-horizon planning.

RoboSPA is a large-scale robotic manipulation dataset and benchmark for diagnosing embodied reasoning in vision-language-action models, spanning fine-grained spatial reasoning and long-horizon procedural planning. It covers 10 task categories and 56 base tasks instantiated across five difficulty levels for 280 variants, with 527K trajectories collected across multiple embodiments. Experiments on representative VLA models show current systems struggle with complex spatial relations, precise low-level execution, and memory-intensive planning.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 16:19 UTC · 11d agoAI research

25

Agent as Policy for Robotic Manipulation

Agent as Policy lets a general-purpose agent drive a physical robot via runtime reasoning and program generation, reaching 100% success on manipulation tasks.

The paper introduces Agent as Policy (AGP), which puts task planning and execution for a physical robot under a general-purpose agent's control with no task-specific or environment-specific training. The agent interprets visual evidence, writes executable programs, issues motion commands, and revises actions based on physical outcomes. AGP was evaluated on real-world manipulation tasks including assembly from human videos, block construction from goal images, die reorientation, targeted throwing, and bimanual towel folding. It achieved success rates of 100%, 100%, and 80% on three block construction configurations.

Hugging Face daily papers·Sep 10, 20:00 UTC · 5d agoAI research

40

Studying Without a Syllabus: Task-Agnostic Environment Preprocessing

Paper formalizes task-agnostic environment preprocessing, where agents study unfamiliar environments under a budget to build reusable artifacts for a frozen solver.

The paper formalizes task-agnostic environment preprocessing, where a studying system explores an environment under a budget and produces artifacts like indices, scripts, or procedural guidance for a frozen solver, without task examples or evaluation feedback. The authors compare unaided and archive-equipped meta-agents against fixed synthetic-practice and corpus-processing methods across six heterogeneous benchmarks. A meta-agent variant achieves the highest Avg@3 reward on five benchmarks, while fixed corpus processing remains best on the largest corpus benchmark. Studied artifacts reduce the test-time sampling needed to reach a given score, shifting computation from repeated test-time attempts to a pre-task study phase.

Hugging Face daily papers·Sep 8, 20:00 UTC · 7d agoAI research

20

PlannerForge: LLM Agents for Scenario-Based Testing of Motion Planners in Autonomous Driving

PlannerForge unifies scenario-based testing of autonomous driving motion planners in one LLM-agent framework, outperforming prior baselines.

PlannerForge is an LLM-agent framework that covers the full scenario-based testing pipeline for autonomous driving systems, spanning scenario generation, selection, modification, routing, planner testing, plus new enhancement and benchmarking stages. In evaluations with 10 off-the-shelf LLMs, best-per-task scores range from 0.88 to 1.00, and open-source 20-35B backends such as Qwen3.6:35B match commercial APIs on most tasks. End-to-end chaining retains 83% (commercial) and 78% (open) of seed queries, beats Scenario Factory 2.0 on executable generation, and cost-tuning lifts planner success from 50.4% to 70.2% while cutting collisions from 19.0% to 8.4%.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research

28

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Procedural Graph framework stores procedural knowledge as triplets and self-evolves via LLM refinement, beating memory-based baselines across datasets, tasks, and LLMs.

The Procedural Graph organizes procedural knowledge into (procedure, relation, procedure) triplets; at each decision step the framework localizes the agent's active node and a guidance model translates the surrounding subgraph into step-level guidance that biases the solver's next action. An LLM refiner contrasts failed with successful trajectories and edits the graph's topology and attributes, retaining rejected edits to discourage repetition. Starting from a minimal skeleton, the loop builds graphs that match or surpass hand-designed ones and can repair flawed expert priors, delivering consistent gains over memory-based baselines across multiple datasets, task types, and LLMs.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research1

36

Context Engineering Inside the Harness: 4 Mechanisms That Beat Context Overflow and Goal Loss on Long-Horizon Tasks

Survey of four harness mechanisms—context budgeting, compaction, todo-state, and memory—that keep long-horizon LLM agents on task across 200+ tool calls.

The article details how agent harnesses, not larger context windows, solve context overflow and goal loss on long-horizon tasks, citing Chroma's Context Rot report showing 18 LLMs (GPT-4.1, Claude 4, Gemini 2.5, Qwen3) degrade on long inputs. Concrete implementations include LangChain Deep Agents offloading tool responses over 20,000 tokens to the filesystem and truncating old tool calls at 85% window usage, and Claude Code capping auto memory at 25KB while re-reading the 5 most recently modified files after compaction. OpenAI's Responses API now offers server-side compaction via context_management with a standalone /responses/compact endpoint, which Codex uses for long-running coding tasks. Manus reports a roughly 100:1 input-to-output token ratio per ~50-tool-call task, motivating todo.md state recitation to prevent goal drift.

MarkTechPost·Sep 13, 05:56 UTC · 3d agoAI research1

52

Show HN: Ordewell – turn one goal into an ordered plan of coding-agent tasks

Ordewell is an open-source tool that decomposes a single goal into an ordered plan of coding-agent tasks, posted on Hacker News.

Ordewell, shared as a Show HN project on GitHub, converts one high-level goal into an ordered plan of tasks for coding agents to execute. The post received 40 points and 29 comments on Hacker News. It focuses on task planning and orchestration for autonomous coding agents.

Hacker News · AI·Sep 15, 13:31 UTC · 1d agoAI tools & infraHN 40↑ · 29 comments

15

Empirical Evaluation of Task-Based Permission Scoping Architecture for AI Agents

Fine-tuned RoBERTa-large task permission classifier matches Claude Haiku 4.5 on access scoping for AI agents, cutting severity-weighted attack surface by 84.4%.

The paper evaluates a three-source task-based permission architecture for AI agents combining role-based permission ceilings, a task permission classifier, and policy-based prohibitions. A fine-tuned RoBERTa-large security gate matched few-shot Claude Haiku 4.5 on a 600-prompt dataset, with macro-F1 0.881 versus 0.886, precision 0.897 versus 0.842, and lower severity-weighted residual risk (0.63 versus 1.12). An attack-surface elimination metric shows the role ceiling alone closes 27.9% of the severity-weighted surface while adding the task classifier closes 84.4%. The work establishes task-granular access control as a measured, deployable mechanism for reducing attack surface in agentic deployments.

arXiv cs.CR·Sep 14, 11:48 UTC · 2d agoAI safety & security

48

ASTRIL-MPC: Autonomous Traversal Framework of Articulated Tracked Robots with Language-Guided Neural-Kinematic MPC

ASTRIL-MPC combines learned kinematics, NMPC, and LLM-guided safety-checked retuning for articulated tracked robot traversal in search-and-rescue.

ASTRIL-MPC is a language-guided neural-kinematic model predictive control framework for autonomous traversal of articulated tracked robots in urban search and rescue. A learned kinematics model predicts short-horizon task-state increments, NMPC plans with feasibility constraints, and an LLM proposes bounded, safety-checked updates to weights and bounds. The compiled predictor enables a full control cycle within 100 ms, improving traversal-quality scores by up to 71% over non-adaptive NMPC and 67% over a PPO baseline while eliminating measurable collision impacts.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 17:17 UTC · 4d agoAI research

12

One Symptom, Three Levers: A Critical Review of On-Policy Self-Distillation

A review paper frames on-policy self-distillation collapse as governed by three levers: token weighting, privileged information, and guidance decay.

The paper critically reviews On-Policy Self-Distillation (OPSD), where a language model trains on its own generations scored token-by-token by a teacher conditioned on privileged information such as reference solutions or environment feedback. It identifies collapse, the progressive narrowing of producible reasoning paths, as the dominant failure mode and analyzes it through three levers: signal weighting, the nature of privileged information, and teacher dynamics. The review is restricted to mathematical reasoning, reports no new experiments, and offers a shared vocabulary separating settled findings from disputed ones.

Hugging Face daily papers·Aug 25, 20:00 UTC · 21d agoAI research

45

MOONWALK: Mediating Operations with Intent-Evidence-Action Alignment Across Junior-Supervisor Review Workflows in Animation/VFX Pre-Production

MOONWALK introduces an intent-evidence-action alignment workflow for animation/VFX reviews where AI handles administrative coordination while artists keep creative authority.

MOONWALK is a pre-production review system that articulates creative intent into a shared project record, anchors review judgments to grounded evidence, and converts authorized decisions into concrete revision tasks. AI components handle administrative coordination such as flagging missing context and organizing notes, not creative direction. An in-studio study against a chat-only AI interface showed stronger intent alignment, decision traceability, and checklist executability.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:10 UTC · 6d agoAI research

15

Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization

Researchers release OR-Clarify, a benchmark testing whether LLM agents ask clarifying questions before formulating optimization models from incomplete requests.

OR-Clarify evaluates pre-formulation clarification in operations research: each task gives a partial problem description, withholds structured hidden slots, and scores agents via bounded interaction with a simulated user, measuring slot recovery, stopping behavior, silent assumptions, and interaction cost. The authors also propose InterOPT, a two-stage framework that identifies formulation-critical gaps to decide when to ask or stop. In choice-based experiments InterOPT substantially outperforms all baselines in exact slot recovery and remains competitive in the open-ended setting.

Hugging Face daily papers·Sep 3, 20:00 UTC · 12d agoAI research1

35

RoboSPA: Can VLA Models Go Beyond Simple Scenes and Short-Horizon Tasks?

RoboSPA introduces a 527K-trajectory benchmark with 280 task variants showing current VLA models struggle with spatial reasoning and long-horizon planning.

RoboSPA is a large-scale robotic manipulation dataset and benchmark for diagnosing embodied reasoning in vision-language-action models, covering fine-grained spatial reasoning and long-horizon procedural planning. It spans 10 task categories and 56 base tasks instantiated across five difficulty levels for 280 variants, with 527K trajectories collected across multiple embodiments and diverse scenes. Diagnostic metrics go beyond binary success rates, and experiments show current VLA models struggle with complex spatial relations, precise low-level execution, and memory-intensive planning.

Hugging Face daily papers·Sep 3, 20:00 UTC · 12d agoAI research

28

What Matters, When? Diagnosing and Improving Conditional Visual Grounding in Visuomotor Imitation Policies

Researchers diagnose conditional visual grounding failures in visuomotor imitation policies and show targeted interventions substantially improve distractor robustness.

The paper studies why ACT-based visuomotor imitation policies fail when visually similar distractor objects or receptacles are introduced, finding sensitivity depends on both distractor type and manipulation stage. Interventions including distractor augmentation, phase-dependent attention regularization, and appearance-based visual prompting improve target selection while preserving spatial control information, with gains in simulation and on a physical UR3e. The same failure pattern is confirmed in a pretrained vision-language-action policy on a state-conditioned medical instrument-handling task.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:27 UTC · 11d agoAI research

18

Same Trajectory, Contradictory Rewards (ROBORMBENCH): Paraphrase Fragility in Vision Language Reward Models

New ROBORMBENCH benchmark shows vision-language reward models can flip robot success/failure judgments when goal instructions are paraphrased.

The authors show that paraphrasing the instruction alone can substantially change progress scores from VLM reward models, even flipping identical robot trajectories between failure and success. ROBORMBENCH comprises 2,390 real-robot trajectories with ground-truth progress labels and 21,673 verified paraphrases covering lexical, syntactic, and action-goal rewrites. Instability is widespread across proprietary and open-source VLMs, grows with more divergent rewrites, and is not reliably reduced by scale or explicit reasoning, while trajectory-grounded dedicated reward models are markedly more stable.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:47 UTC · 11d agoAI research1

35

Embodied-BenchForge: A Closed-Loop Agentic Workflow for Embodied Benchmark Construction

Embodied-BenchForge automates embodied benchmark construction via closed-loop synthesis with verification and repair, yielding seven benchmarks for MLLM evaluation.

Embodied-BenchForge is an agentic framework that transforms user-specified evaluation intents into complete embodied benchmark artifacts via Closed-Loop Benchmark Synthesis. Skill-Orchestrated Artifact Synthesis composes typed reusable skills while an artifact dependency graph records intermediate outputs; Requirement-Guided Verification and Repair triggers local re-execution or upstream rollback on failures. It constructs six Offline EQA benchmarks plus one interactive benchmark with 220 executable tasks, distinguishing MLLM and embodied agent capabilities in observation-based understanding and closed-loop execution.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 17:16 UTC · 4d agoAI research

18

Curriculum Learning as Transport: Understanding Curricula with Wasserstein Geodesics

Researchers model curriculum learning as Wasserstein transport over difficulty distributions, finding curriculum benefits are strongly task- and budget-dependent with no dominant strategy.

The framework represents curricula as trajectories of training distributions over discrete difficulty levels, decoupling ordering, matched exposure, endpoint smoothness, and pacing. Across a calibrated suite of 12 tasks and 33 difficulty axes under fixed training budgets, no single strategy dominates, though easy-to-hard ordering improves hard-level performance relative to exposure-matched static sampling. Endpoint smoothness and pacing substantially affect where along the difficulty spectrum a curriculum is effective, and the transport view supports extensions to learned pacing and structured difficulty spaces.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:39 UTC · 7d agoAI research1

28

Enabling Creative Exploration for Vibe Design Agents

Separating design-direction exploration from code generation via structured specifications broadens UI alternatives without destabilizing output.

The paper proposes an inference architecture for vibe design agents that makes design direction an explicit intermediate decision: a Verbalized Sampling-inspired pre-pass proposes structured design specifications with typicality scores, an external selector samples one, and a downstream generator realizes it under fixed settings. Across 168 prompts with 1,255 paired comparisons per temperature, theme sampling broadens selection coverage and screenshot variation, with LLM-judge preferences varying across interventions and prompt complexity. An online experiment with over 300,000 tasks found the code-export increase statistically uncertain, though negative feedback events decreased alongside modest operational costs.

Hugging Face daily papers·Sep 13, 20:00 UTC · 2d agoAI research

28

CanvasAnneal: Curriculum Reinforcement Learning for Diffusion Language Models

CanvasAnneal injects teacher reasoning traces into diffusion canvases during curriculum RL, improving diffusion LLMs on MATH500, Countdown, and Tau2.

CanvasAnneal is a curriculum-guided reinforcement learning framework for diffusion language models that addresses exploration bottlenecks in standard RL. It warm-starts exploration by injecting teacher-generated reasoning traces into the initial diffusion canvas, then gradually removes this guidance so the model generates reasoning trajectories independently. Across mathematical reasoning and tool-use benchmarks, it improves over standard diffu-GRPO on MATH500, Countdown, and Tau2 and accelerates reward improvement, though gains are task-dependent.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:59 UTC · 4d agoAI research1

28