SafePilot: A Framework for Assuring LLM-enabled Cyber-Physical Systems

arXiv cs.RO / 2026/3/24

💬 オピニオンIdeas & Deep AnalysisModels & Research

要点

  • The paper introduces SafePilot, a hierarchical neuro-symbolic framework aimed at assuring cyber-physical systems that use LLMs for planning and navigation.
  • It targets the safety risk of LLM hallucinations by verifying LLM outputs against attribute-based and temporal specifications rather than relying on raw generation.
  • SafePilot uses a discriminator to judge task complexity and either sends manageable tasks to an LLM planner with built-in verification or applies divide-and-conquer task decomposition for harder tasks.
  • The LLM planner converts natural-language constraints into formal specs, checks for violations, and iteratively revises prompts and re-invokes the LLM until a valid plan is found or a limit is reached.
  • The framework is evaluated via two illustrative case studies demonstrating both effectiveness and adaptability across different constrained planning scenarios.

Abstract

Large Language Models (LLMs), deep learning architectures with typically over 10 billion parameters, have recently begun to be integrated into various cyber-physical systems (CPS) such as robotics, industrial automation, and autopilot systems. The abstract knowledge and reasoning capabilities of LLMs are employed for tasks like planning and navigation. However, a significant challenge arises from the tendency of LLMs to produce "hallucinations" - outputs that are coherent yet factually incorrect or contextually unsuitable. This characteristic can lead to undesirable or unsafe actions in the CPS. Therefore, our research focuses on assuring the LLM-enabled CPS by enhancing their critical properties. We propose SafePilot, a novel hierarchical neuro-symbolic framework that provides end-to-end assurance for LLM-enabled CPS according to attribute-based and temporal specifications. Given a task and its specification, SafePilot first invokes a hierarchical planner with a discriminator that assesses task complexity. If the task is deemed manageable, it is passed directly to an LLM-based task planner with built-in verification. Otherwise, the hierarchical planner applies a divide-and-conquer strategy, decomposing the task into sub-tasks, each of which is individually planned and later merged into a final solution. The LLM-based task planner translates natural language constraints into formal specifications and verifies the LLM's output against them. If violations are detected, it identifies the flaw, adjusts the prompt accordingly, and re-invokes the LLM. This iterative process continues until a valid plan is produced or a predefined limit is reached. Our framework supports LLM-enabled CPS with both attribute-based and temporal constraints. Its effectiveness and adaptability are demonstrated through two illustrative case studies.