ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Candidate-based planners”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.ROcs.CVEmpiricalRecentOct 16, 2026

Expand-and-Prune: Test-Time Candidate-Space Adaptation for End-to-End Autonomous Driving

Fabian Schmidt, Karol Fedurko, Markus Enzweiler, Abhinav Valada

Introduces Expand-and-Prune, a test-time framework that adapts candidate support and capacity for end-to-end driving planners.

View →
cs.AIRecentMay 28, 2026

LLM-Evolved Domain-Independent Heuristics for Symbolic AI Planning

Elliot Gestrin, Jendrik Seipp

This paper introduces the first LLM-generated, domain-independent heuristics for symbolic AI planning, using evolutionary search to surpass the performance of hand-engineered state-of-the-art methods.

View →
cs.CLcs.AIcs.LGRecentMay 28, 2026

Does The Way You Plan Matter? An Empirical Study of Planning Representations for LLM Web Agents

Alejandra Zambrano, Sara Vera Marjanovic, Imene Kerboua, Xing Han Lù +1 more

This paper empirically demonstrates that the choice of plan representation (e.g., checklist vs. narrative) significantly impacts the robustness and success rate of LLM-based web agents.

View →
cs.AIRecentJun 1, 2026

LLM-Evolved Pattern Generators for Optimal Classical Planning

Windy Phung, Dominik Drexler, Arnaud Lequen, Jendrik Seipp

The paper introduces a novel LLM-driven evolutionary framework to synthesize admissible, domain-specific pattern generators, enabling optimal classical planning with high performance and interpretabil…

View →
cs.AIRecentMay 30, 2026

Efficient Test-time Inference for Generative Planning Models

Robert Gieselmann, Mihai Samson, Federico Pecora, Jeremy L. Wyatt

The paper proposes an efficient inference procedure for generative planning models by modifying the Open-Closed List (OCL) search, achieving superior performance over existing baselines.

View →
cs.MAEmpiricalRecentJun 17, 2026

PersonalPlan: Planning Multi-Agent Systems for Personalized Programming Learning

Zhiyuan Wen, Jiannong Cao, Peng Gao, Haochen Shi +3 more

The paper introduces MAP-PPL, a profile-conditioned multi-agent planning dataset, and PersonalPlan, a two-stage MAS planner that generates personalized and pedagogically scaffolded plans for programmi…

View →
cs.CLRecentMay 31, 2026

Robust Asynchronous Planning via Auto-Formalization

Jiayi Zhang, Jianing Yin, Ben Zhou, Li Zhang

The paper introduces new benchmarks for complex asynchronous planning and demonstrates that general constraint satisfaction formalizers (like CP-SAT) significantly outperform direct LLM planning or tr…

View →
cs.AIRecentMay 27, 2026

An LLM-Based Assistance System for Intuitive and Flexible Capability-Based Planning

Luis Miguel Vieira da Silva, Nicolas König, Felix Gehlhoff

The paper proposes a hybrid LLM-based assistance system that enhances traditional capability-based planning by providing natural language interaction, interpretability, and flexible knowledge model ad…

View →
cs.AIRecentMay 27, 2026

GONDOR to the Rescue: Satisficing Planning with Low Memory

Yonatan Vernik, Alexander Tuisov, Alexander Shleyfman

The paper introduces GONDOR, a memory-efficient extension of Greedy Best-First Search (GBFS) that enables search continuation under strict memory constraints by periodically compressing the search tre…

View →
cs.AIRecentMay 29, 2026

Planner-Centric Reinforcement Learning for Deep Research with Structure-Aware Reward

Mustafa Anis Hussain, Xinle Wu, Yao Lu

The paper proposes DecomposeR, a planner-centric framework that structures deep research into typed Directed Acyclic Graphs (DAGs) to explicitly improve the planning and execution of large language mo…

View →
cs.CLcs.AIcs.LGEmpiricalRecentJul 27, 2026

The Physics of Multi-Turn Long-Horizon Planning: From Pre-training to Post-training via Single- and Multi-Teacher On-Policy Agentic Distillation

Tianyi Men, Zhuoran Jin, Kang Liu, Jun Zhao

This paper introduces a controlled environment to study multi-turn long-horizon planning ability acquisition, shaping, and integration in foundation model agents.

View →
cs.AIEmpiricalRecentOct 19, 2026

AnyGoal: On World Model Generalization Beyond Expert Rollouts

Heejeong Nam, Divyat Mahajan, Quentin Le Lidec, Randall Balestriero +1 more

The paper introduces a benchmark and framework to evaluate the generalization of world models in planning tasks.

View →
cs.ROcs.AIEmpiricalRecentSep 24, 2026

Coding Agents for Generalized Task and Motion Planning Problems

Matteo Merler, Bowen Li, Josh Roy, Yichao Liang +3 more

This paper evaluates the effectiveness of coding agents in solving generalized task and motion planning problems.

View →
cs.AIEmpiricalRecentNov 4, 2026

On Turn-Level Best-of-N Sampling for Scaling LLM Agents

Jalaj Bhandari, Dhawal Gupta, Hongli Zhan, Zhenting Wang +4 more

This paper evaluates a simple inference-time scaling approach for large language model agents on complex tasks.

View →
cs.AIRecentMay 28, 2026

Structure-Induced Information for Rerooting Levin Tree Search

Jake Tuero, Michael Buro, Laurent Orseau, Levi H. S. Lelis

The paper introduces a learned 'rerooter' mechanism to improve subgoal-based policy tree search, allowing scalable search in complex environments without the overhead of explicit subgoal generation.

View →
cs.DSTheoreticalRecentAug 11, 2026

Graphic Matroid Secretary without the Graph

Paul Dütting, Renato Paes Leme, Martin Pál, Neel Patel

The paper presents a constant-competitive algorithm for the Matroid Secretary Problem on graphic matroids using only an independence oracle.

View →
cs.AIcs.LGRecentMay 27, 2026

Tree of Thoughts as a Classical Heuristic Search Problem: Formal Foundations and Design Patterns

Guni Sharon

This paper unifies the fragmented field of Tree-of-Thoughts (ToT) reasoning by mapping LLM-based search processes onto a formal taxonomy derived from classical heuristic search theory.

View →
cs.CLcs.AIcs.CVEmpiricalRecentJun 25, 2026

Empowering GUI Agents via Autonomous Experience Exploration and Hindsight Experience Utilization for Task Planning

Tianyi Men, Zhuoran Jin, Pengfei Cao, Yubo Chen +2 more

This paper introduces the PEEU method to improve the planning abilities of small multimodal web agents.

View →