Exact, Efficient, and Safe Occlusion-Aware Planning Using AH-Polyhedrons

• URL: http://arxiv.org/abs/2606.15046v1
• Date: Sat, 13 Jun 2026 01:28:07 GMT
• Title: Exact, Efficient, and Safe Occlusion-Aware Planning Using AH-Polyhedrons
• Abstract summary: We propose APRO (AH-Polyhedron Reachability for Occlusions), an exact and efficient occlusion-aware planning framework.<n>Our key insight is to reformulate set-based safety conditions in prior work as unions of AH-polyhedrons.<n>We show how the resulting safety conditions can be integrated into optimization-based planners or a bisection search scheme for real-time applications.
• Score: 5.980069180948256
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Safely handling occlusions is a fundamental challenge for autonomous mobile robots operating in dynamic environments. This issue is especially prominent in autonomous valet parking (AVP), where traffic rules are lax, occlusions are frequent and cluttered, and overly conservative behavior can leave vehicles stuck. However, existing methods either lack formal safety guarantees, assume agents follow road structures, or introduce conservatism, leaving occlusion-aware planning for AVP an open challenge. In this paper, we propose APRO (AH-Polyhedron Reachability for Occlusions), an exact and efficient occlusion-aware planning framework based on game-theoretic active perception and AH-polyhedron reachability analysis with AVP as our canonical use case. Our key insight is to reformulate set-based safety conditions in prior work as unions of AH-polyhedrons, enabling exact safety verification through linear programming (LP) without any additional conservatism in set computations or assumptions on road topology. We further show how the resulting safety conditions can be integrated into optimization-based planners or a bisection search scheme for real-time applications. We validate our method in simulation and hardware experiments, including data replay on a real-world parking lot dataset. Experimental results demonstrate that our method consistently achieved a 100% safety rate across all evaluated scenarios while maintaining real-time performance, resulting in safer and more optimal decisions than existing methods with formal safety guarantees.

Related papers

• Discriminative Barrier Functions for Safe Adversarial Imitation Learning from Observation [14.317454403455331]
  Inverse Reinforcement Learning (IRL) algorithms are powerful tools for learning from and generalizing expert demonstrations.<n>Control Barrier Functions (CBFs) can guarantee the safety of control systems, but the analytical design of CBFs can be time-consuming and esoteric.<n>We address these limitations jointly by constraining reward function candidacy during IRL to the space of CBFs.
  arXiv  Detail & Related papers  (2026-07-15T15:20:57Z)
• Hope for the Best, Prepare for the Worst: Occlusion-Aware Contingency Planning for Autonomous Vehicles [11.150547523174694]
  Recent accidents involving driverless vehicles highlight the importance of motion planners that explicitly addresses the risks posed by occlusions.<n>We propose a formal, occlusion-aware trajectory planning framework that guarantees collision avoidance even when there are possible hidden traffic participants.<n>We demonstrate the effectiveness of our framework in a challenging simulated occluded scenario, showing that it pro-actively and efficiently guarantees collision-avoidance.
  arXiv  Detail & Related papers  (2026-07-03T09:53:33Z)
• Cooptimizing Safety and Performance Using Safety Value-Constrained Model Predictive Control [14.944399584182017]
  We propose a safety-value function-based terminal constraint that enforces membership in a control-invariant safe set at the end of each planning horizon.<n>This formulation enables real-time synthesis of trajectories that are both high-performing and provably safe.<n>We validate the proposed framework through simulation and hardware experiments on a Flexiv Rizon 10s manipulator.
  arXiv  Detail & Related papers  (2026-04-26T20:10:03Z)
• SQ-CBF: Signed Distance Functions for Numerically Stable Superquadric-Based Safety Filtering [9.291918812545699]
  Control barrier functions provide an effective framework for real-time safety filtering.<n>Their performance depends on the underlying geometric representation, which is often simplified.<n>Superquadrics offer an expressive way to model complex shapes using a few primitives.
  arXiv  Detail & Related papers  (2026-02-11T17:19:43Z)
• Rethinking Safety in LLM Fine-tuning: An Optimization Perspective [56.31306558218838]
  We show that poor optimization choices, rather than inherent trade-offs, often cause safety problems, measured as harmful responses to adversarial prompts.<n>We propose a simple exponential moving average (EMA) momentum technique in parameter space that preserves safety performance.<n>Our experiments on the Llama families across multiple datasets demonstrate that safety problems can largely be avoided without specialized interventions.
  arXiv  Detail & Related papers  (2025-08-17T23:46:36Z)
• Enhanced Safety in Autonomous Driving: Integrating Latent State Diffusion Model for End-to-End Navigation [5.928213664340974]
  This research addresses the safety issue in the control optimization problem of autonomous driving. We propose a novel, model-based approach for policy optimization, utilizing a conditional Value-at-Risk based Soft Actor Critic. Our method introduces a worst-case actor to guide safe exploration, ensuring rigorous adherence to safety requirements even in unpredictable scenarios.
  arXiv  Detail & Related papers  (2024-07-08T18:32:40Z)
• SAFE-SIM: Safety-Critical Closed-Loop Traffic Simulation with Diffusion-Controllable Adversaries [94.84458417662407]
  We introduce SAFE-SIM, a controllable closed-loop safety-critical simulation framework. Our approach yields two distinct advantages: 1) generating realistic long-tail safety-critical scenarios that closely reflect real-world conditions, and 2) providing controllable adversarial behavior for more comprehensive and interactive evaluations. We validate our framework empirically using the nuScenes and nuPlan datasets across multiple planners, demonstrating improvements in both realism and controllability.
  arXiv  Detail & Related papers  (2023-12-31T04:14:43Z)
• Evaluating Model-free Reinforcement Learning toward Safety-critical Tasks [70.76757529955577]
  This paper revisits prior work in this scope from the perspective of state-wise safe RL. We propose Unrolling Safety Layer (USL), a joint method that combines safety optimization and safety projection. To facilitate further research in this area, we reproduce related algorithms in a unified pipeline and incorporate them into SafeRL-Kit.
  arXiv  Detail & Related papers  (2022-12-12T06:30:17Z)
• Recursively Feasible Probabilistic Safe Online Learning with Control Barrier Functions [60.26921219698514]
  We introduce a model-uncertainty-aware reformulation of CBF-based safety-critical controllers. We then present the pointwise feasibility conditions of the resulting safety controller. We use these conditions to devise an event-triggered online data collection strategy.
  arXiv  Detail & Related papers  (2022-08-23T05:02:09Z)
• Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning [72.97229770329214]
  We introduce a general approach for seeking high dimensional non-linear optimization problems in which maintaining safety during learning is crucial. Our approach called LBSGD is based on applying a logarithmic barrier approximation with a carefully chosen step size. We demonstrate the effectiveness of our approach on minimizing violation in policy tasks in safe reinforcement learning.
  arXiv  Detail & Related papers  (2022-07-21T11:14:47Z)
• Learning Control Barrier Functions from Expert Demonstrations [69.23675822701357]
  We propose a learning based approach to safe controller synthesis based on control barrier functions (CBFs) We analyze an optimization-based approach to learning a CBF that enjoys provable safety guarantees under suitable Lipschitz assumptions on the underlying dynamical system. To the best of our knowledge, these are the first results that learn provably safe control barrier functions from data.
  arXiv  Detail & Related papers  (2020-04-07T12:29:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.