EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees
summary
The gist
LLM-based robot planners are fluent but cannot guarantee that their plans are executable or safe because classical PDDL planners can guarantee these properties only after the problem is fully…
In short
The system uses an offline procedure to mine a global Signal Temporal Logic constraint from demonstrations. An evolutionary PDDL planner then proposes and repairs plans using an LLM, guided by programmatic validation and feedback. A final execution loop checks these plans against the mined constraint before running, ensuring safety.
Key concepts
- Signal Temporal Logic (STL) Constraint ($\Phi_{mob}$)
- This is a single global rule derived from robot demonstrations that dictates how the robot must move at all times. It synthesizes missing negative examples and acts uniformly across every mobility action in any plan, serving as a crucial safety shield.
- Evolutionary PDDL Planner
- This planner uses an LLM to propose and iteratively repair plans against a fixed problem definition (PDDL). A programmatic validator scores these candidates, and the system 'evolves' by keeping the best validated prefix, ensuring monotonic improvement in plan quality.
- Constrained Execution Loop
- Before executing a proposed plan, this loop checks every waypoint against the mined STL constraint ($\Phi_{mob}$). If a violation is found, it commits the verified part of the plan and re-invokes the planner to generate a corrected suffix.
Terminology used across episodes
This episode discusses
- EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees · Paper Radio
- Qwen2.5-VL Technical Report
- SafeGen-LLM: Enhancing Safety Generalization in Task Planning for Robotic Systems
- Bench2Drive: Towards Multi-Ability Benchmarking of Closed-Loop End-To-End Autonomous Driving
- Socially Compliant Navigation Dataset (SCAND): A Large-Scale Dataset of Demonstrations for Social Navigation
- Heterogeneous Robot Collaboration in Unstructured Environments with Grounded Generative Intelligence · Paper Radio
- PIP-LLM: Integrating PDDL-Integer Programming with LLMs for Coordinating Multi-Robot Teams Using Natural Language
- Human-Aware Vision-and-Language Navigation: Bridging Simulation to Reality with Dynamic Human Interactions
The paper
EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees · Read on arXiv
Bhavya Sai Nukapotula, Samin Moosavi Haoze Wang, Luke Duncan, Diya Shakkottai*, Varun Murali Srinivas Shakkottai
Texas A&M University
LLM-based robot planners are fluent but cannot guarantee that their plans are executable or safe. Classical PDDL planners can guarantee symbolic validity, but only once the problem is fully specified, and they make poor use of an LLM's ability to read context and repair plans. We present EvoPlan, a neuro-symbolic framework whose guarantees are symbolic validity and satisfaction of a constraint learned from data. The planner works with locally-hosted open-weight models, so it does not require a cloud service. EvoPlan has three parts. First, an offline procedure that mines a single global Signal Temporal Logic (STL) mobility constraint from demonstrations. Perturbed demonstrations supply the missing negatives without encoding any rule, and evolutionary search fits the constraint, which captures driving rules or social-navigation preferences within a modelled taxonomy of norms. We use the mined constraint to shield driving and navigation policies on Bench2Drive and 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. On open-world ALFWorld and NL-PDDL Blocksworld, it approaches classical planning when the goal vocabulary agrees with the action model, and it stays robust when the two disagree and classical planning fails. Third, a constrained execution loop: Nav2 uses the costmap to ground the plan into waypoints, which are checked against the mined constraint. Violations and execution failures update the PDDL problem for re-planning. We demonstrate the full pipeline in Gazebo and on a Clearpath Jackal robot. More details and videos are on the project page: https://nbhavyasai.github.io/evoplan/
Transcript
Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.
Rosa: We're looking at the paper: "EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees".
Dev: Here's the gist of the paper. LLM-based robot planners are fluent but cannot guarantee that their plans are executable or safe because classical PDDL planners can guarantee these properties only after the problem is fully specified and they make poor use of an LLM’s ability to read context and repair plans.
Rosa: This paper presents a neuro-symbolic framework with three parts.
Dev: System Overview The framework involves an offline procedure that mines a single global Signal Temporal Logic (STL) constraint on mobility from demonstration data and an evolutionary PDDL planner where an LLM proposes and repairs plans against a fixed PDDL problem P and domain D.
Rosa: Finally, a constrained execution loop checks the plan's waypoints against the mined constraint Φmob before execution.
Paper summary: Rosa: So, we're looking at this paper called "EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees." Basically, the core idea is that big language models are fluent but they can't actually guarantee a plan will work or be safe when you put them on a robot.
Dev: Right, so classical planners like PDDL can do that, but they need you to fully specify everything upfront, which is tough in the real world. This paper claims this framework fixes that by using an LLM to help propose and repair plans against a fixed problem setup while adding formal safety checks.
Taro: What matters here for me is how it handles when the robot runs into something unexpected; it suggests a way for the system to recover gracefully instead of just failing completely.
Rosa: It claims this framework works in three main parts: first, an offline procedure that mines a single global signal temporal logic constraint on mobility from demonstration data; second, an evolutionary PDDL planner where an LLM proposes and repairs plans against a fixed problem setup; and finally, a constrained execution loop that checks the plan's waypoints against that mined constraint before it executes.
Dev: The key part I see there is this offline constraint extraction procedure. It mines one global Signal Temporal Logic, or STL, constraint on mobility directly from demonstration data to get rules like stopping at red lights or social navigation comfort preferences.
Rosa: That procedure is designed to synthesize missing negative classes using counterfactual perturbations and an LLM violation generator, which turns the process of finding those constraints into a supervised classification problem. It’s trying to codify how the robot must move at all times, applying that constraint uniformly to every mobility action any plan invokes.
Taro: So, if we think about what this means for real robots outside a lab setting, it suggests we can learn fundamental movement rules from just watching someone do something and turn that into a formal safety contract.
Dev: Exactly. And then online, the evolutionary PDDL solver uses an LLM to propose and repair plans against a fixed PDDL problem and domain. A programmatic validator cascade scores each candidate, and elitism on that feedback grows the validated prefix of the plan monotonically over iterations.
Rosa: And if that constraint check fails during execution, the verified prefix gets committed, and then the planner is re-invoked to produce a fresh suffix-replacing plan. This creates a closed loop where safety verification drives replanning when things go wrong.
Paper summary: Taro: I like that part about replanning; it means even if the initial suggestion from the LLM is bad, we have a mechanism to fix it quickly based on those hard constraints. But what about how robust this whole thing is?
Dev: The paper tests this system on open-world ALFWorld Text where it actually outperforms strong baselines and stays robust even when the goal vocabulary doesn't match the action model vocabulary. They also evaluated the mined constraint as a shield over a Qwen2 point 5-VL driver on Bench2Drive and two discrete-action navigation policies on HA-VLNCE <ref:2607.06724#pg1>.
Rosa: And they showed that in crowded operation, this constrained execution loop demonstrates graceful degradation under crowded conditions, trading clearance margin for an isolated failure rather than collapsing wholesale. That's a big deal for deployment outside controlled settings.
Taro: Graceful degradation is important; it means the robot doesn't just crash when things get messy; it handles the mess by sticking to the learned constraints as much as possible.
Dev: The paper also mentions that all LLM calls use a locally-hosted open-weight model, specifically Qwen3-32B in their experiments, so you don't need some expensive cloud connection for this pipeline to run on a robot <ref:2607.06724#pg1,all LLM calls use a locally-hosted open-weight model>.
Rosa: So, the system is designed to be deployable on hardware right away without needing constant internet access or heavy cloud resources. That makes it much more practical for real-time robotic applications.
Taro: But I wonder about the training signal itself; they mention how they build it by mining a single global STL constraint from demonstrations, which seems like a very specific starting point for the whole system.
Dev: They say that constraint extraction procedure synthesizes missing negatives with counterfactual perturbations and an LLM violation generator to turn the constraint mining into a supervised classification problem. It recovers codified rules or population preferences depending on what the demonstrations encode, which is flexible.
Rosa: So it's not just one hard rule; it can learn different types of constraints based on whether the robot is learning stopping at red lights or maybe learning social navigation comfort from teleoperation data.
Taro: It’s interesting how they say this procedure recovers codified rules or population preferences depending on what the demonstrations encode, which means it adapts its type of constraint mining to the specific behavior it's looking at.
Dev: And then in the evolutionary PDDL solving part, they use an LLM not as a standalone planner but as a proposal mechanism inside this machine-checkable loop, which is how they manage the safety concerns we talked about earlier.
Paper summary: Rosa: It’s interesting because they are treating neural models as generators of candidate plans rather than sources of unchecked authority, which seems like a responsible way to build these things.
Taro: That sounds like a key distinction; you’re not letting the LLM just decide what to do, but you're putting it inside a validation structure. It’s about using the LLM for generation, not final decision-making authority.
Dev: And looking at their evaluation results, they show that single-shot LLM+VAL systems already beat every direct LLM baseline and the NL-PDDL symbolic floor on Plain, confirming that the backbone is strong even before adding the evolution part.
Rosa: They also have some interesting comparisons with other models; for instance, EvoPlan with Qwen3-32B shows ninety point three percent success in their test, while a larger model like gpt-oss-120b only hits seventy-eight point four percent.
Taro: So the evolution step is definitely adding value, but it’s not a massive leap from just using a strong base model with validation, which suggests the constraint mining part is doing significant heavy lifting.
Dev: The paper also points out some limitations; they flag dependence on demonstration quality, the expressivity and tractability of the STL grammar, perception uncertainty, and sensitivity to the proposal backbone.
Rosa: Those are important caveats; we can't just assume perfect demonstrations or perfect sensor readings when we deploy this outside. We need to be careful about how expressive that signal temporal logic is for complex real-world movement.
Taro: And the need for broader hardware validation sounds like something the authors themselves recognize as a necessary next step before you trust it in a truly unstructured environment.
Dev: So, putting it all together, EvoPlan is proposing this neuro-symbolic framework where an LLM proposes plans, but those plans are checked against a formally mined mobility constraint derived from demonstrations and verified through a rigorous validation cascade.
Rosa: The authors call this EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees because it bridges the gap between the fluency of language models and the safety guarantees needed for physical systems.
Taro: It seems like their main contribution is establishing a way to turn unstructured demonstration data into a formal, actionable safety contract that an LLM can then help navigate during planning.
Dev: The implication is that we can move towards more reliable AI planning systems where the neural part does the creative heavy lifting of proposing paths, but the symbolic and formal parts enforce the hard physical limitations.
Rosa: So what this means for us listening, it means we’re seeing a direction where these models aren't just generating text or images anymore; they are being integrated into loops that actively verify physical safety before anything moves.
Conclusion: Rosa: So, we're looking at this paper called "EvoPlan: Evolutionary Neuro-Symbolic Robot Planning with Spatio-Temporal Guarantees." It's about taking the ideas from large language models and putting them into a system that actually respects physical rules.
Dev: Yeah, it’s about using an LLM to suggest plans but making sure those plans don't break physical laws or safety protocols when you put them on a robot.
Rosa: The authors are trying to bridge that gap between the creative suggestion of the language model and the strict requirements of real-world robotics.
Dev: They achieve this by using demonstration data to mine a single global temporal logic constraint from that data, which acts like a hard rulebook for movement.
Rosa: It’s not just one simple rule, though; they turn that constraint extraction into a classification problem using counterfactual perturbations and an LLM violation generator.
Dev: That means the system learns how the robot *must* move at all times, applying that constraint to every single action any plan tries to use.
Rosa: Then they use this mined constraint as a shield during execution, checking waypoints against it before the robot actually moves anything.
Dev: The whole point is that if the LLM suggests something risky, the loop catches it immediately and forces a replan with a fresh suffix to fix that specific part.
Rosa: This framework aims to make AI planning more reliable by treating neural models as generators of candidates rather than final authority on what's safe.
Dev: It’s about building a system where the LLM proposes, but the formal verification and the temporal constraints provide the necessary safety case.
Rosa: The paper shows that even with this setup, it stays robust when it runs in open-world scenarios where the goal vocabulary doesn't perfectly match what's in the action model.
Dev: It’s interesting because they also show how graceful degradation happens when things get crowded on a robot, trading a little bit of clearance for avoiding a total system collapse.
Rosa: So, this work suggests we can start trusting these models with planning tasks more confidently if we give them that kind of formal, spatiotemporal guardrail.
Dev: And it opens up the question: how robust is this constraint mining procedure when the real-world demonstrations are messy or incomplete?
More episodes
- 2608.13438-ContactGuard: Pre-Contact Execution Monitoring with Action-Conditioned Latent World Models
- 2610.34593-Future Prediction as Training-Only Video Supervision for Pretrained VLA Policies
- 2610.35385-EmbodiedLab: Beyond Manipulation, Benchmarking Embodied Agents That Act to Know
- 2610.36378-Data-Driven Hamiltonian for Neural Optimal Control
- 2610.37275-A Heuristic for Scheduling Autonomous Vehicles at Intersections
- 2610.37288-Dynamic Coordination of Autonomous Vehicles at Intersections
- 2610.37632-Real-Time Coordination of Autonomous Vehicles at Intersections
- 2611.13779-Softness is something you also need! Why compliance helps control: information metrics of a passive walker with compliant ankle
- 2611.13411-Residual-Corrected Physics-Informed Neural Network KKL Observers with Input-to-State Stability Guarantees
- 2611.14488-Is Your Robot's Memory Just a Clock? Temporal Shortcuts in Memory-Augmented VLA Policies