Skip to content

EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees

Jul 2026 · arXiv.org · Vol abs/2607.06724 · 0 citations · 27 references
Computer Science

TL;DR

A neuro-symbolic framework with three parts: an evolutionary PDDL planner, an LLM proposes and repairs plans, programmatic validators decide which ones survive, and the validated portion of the plan grows over iterations.

Abstract

LLM-based robot planners are fluent but cannot guarantee that their plans are executable or safe. Classical PDDL planners can guarantee these properties, but only after the problem is fully specified, and they make poor use of an LLM's ability to read context and repair plans. This paper presents a neuro-symbolic framework with three parts. All LLM calls use a locally-hosted open-weight model, so the pipeline can be deployed on-robot with no cloud dependency. First, an offline procedure that mines a single global Signal Temporal Logic (STL) constraint on mobility from demonstration data. The procedure recovers codified rules (e.g., stopping at red lights, mined from nuPlan driving logs) or population preferences (e.g., social-navigation comfort, mined from SCAND teleoperation), depending on what the demonstrations encode. Because the demonstrations are a one-class signal, we generate the missing negatives with counterfactual perturbations and an LLM violation generator and then fit the constraint by evolutionary search. We use the mined constraint to shield a vision-language driving policy on Bench2Drive and two discrete-action navigation policies on HA-VLN-CE. Second, an evolutionary PDDL planner: an LLM proposes and repairs plans, programmatic validators decide which ones survive, and the validated portion of the plan grows over iterations. We test the planner on the open-world ALFWorld Text benchmark, where it beats strong baselines and stays robust when the goal vocabulary does not match the action-model vocabulary. Third, a constrained execution loop: the planner's plan is compiled into waypoints, the waypoints are checked against the mined constraint, and the planner re-plans on a violation. We illustrate the full pipeline via demonstrations using the Gazebo simulator.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

SAGE: Symbolic Action-Gating and Editing for LLM Task Planners

SAGE (Symbolic Action-Gating and Editing), a single-LLM planner built from two lightweight mechanisms: a domain-agnostic symbolic gate that blocks precondition-violating actions with typed reasons as a runtime safety monitor, and a local edit that regenerates only the failed sub-goal's suffix, keeping completed and unt...

T. Bui, Jongsul Moon, Youngouk Kim et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Meta-Ctrl: Guaranteed Plan Generation by Decoupling Syntactic and Semantic Constraints

Meta-Ctrl is proposed, a constrained-decoding framework that guarantees the encoded constraints while preserving the base LM's plan quality, and is demonstrated on a real tabletop robot, where every generated plan satisfies its preconditions and goals by construction.

Gwen Yidou-Weng, Edward Sun, Tian-Yi Ma et al. · 0 citations
#artificial intelligence Preprint Sep 2026

CAPEX: Efficiently Distilling Foundation Model Behavior into Deployable Robot Policies through Experience-Adaptive Reasoning

CAPEX, an experience-conditioned demonstration collection framework that uses execution experience from previous attempts to adapt how frequently the foundation model must observe, reason, and replan, is introduced and suggests that foundation models can serve as scalable sources of reusable robot experience.

Shivam Aarya, Xi-Jia Zhang, Cheng-Yue Huang et al. · 0 citations
Preprint Aug 2026

SUN: Agentic Robot Policy Learning with Persistent Task Programs

Model-based control can directly execute specified objectives, while learning can amortize such behaviors into reactive policies, making their combination a natural solution to multi-stage manipulation. We introduce Semantically UNified (SUN) Programs, typed executables that compile grounded relations into aligned opti...

Wei-Qi Wang, Zhi Li, Yuliang Lei et al. · 0 citations

SRMP-S: Self-Refining Multi-Planner Strategy for Long-Horizon Robotic Tasks

Enabling robotic agents to perform complex long-horizon tasks has been a long-standing goal in robotics and artificial intelligence (AI). Existing Large Language Models (LLMs)-based symbolic planners auto-generate Planning Domain Definition Language (PDDL) specifications to bridge language and formal reasoning, but the...

Chang-Zhi Wang, Ting-Hao Yi, Zhen-Zhen Huang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.