5 articles tagged with #planning-algorithms. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Research shows that large language models significantly outperform traditional AI planning algorithms on complex block-moving problems, tracking theoretical optimality limits with near-perfect precision. The study suggests LLMs may use algorithmic simulation and geometric memory to bypass exponential combinatorial complexity in planning tasks.
Researchers introduce ViPlan, the first benchmark for comparing Vision-Language Model planning approaches, finding that VLM-as-grounder methods excel in visual tasks like Blocksworld while VLM-as-planner methods perform better in household robotics scenarios. The study reveals fundamental limitations in current VLMs' visual reasoning abilities, with Chain-of-Thought prompting showing no consistent benefits.
Researchers developed a message passing approach for Expected Free Energy minimization that transforms complex combinatorial search problems into tractable inference problems. The method enables more efficient AI agent planning and exploration under uncertainty, outperforming conventional approaches in test environments.
Researchers present GenePlan, a framework that uses large language models with evolutionary algorithms to generate domain-specific planners for classical planning tasks in PDDL. The system achieved a 0.91 SAT score across eight benchmark domains, nearly matching state-of-the-art performance while significantly outperforming other LLM-based approaches.
Researchers studied diffusion-based model predictive control in discrete domains using Tetris, finding that feasibility constraints are necessary and shorter planning horizons outperform longer ones. The study reveals structural challenges with discrete diffusion planners, particularly misalignment issues with DQN critics that produce high decision regret.
