Convex Approximation of Probabilistic Reachable Sets from Small Samples Using Self-supervised Neural Networks

📅 2024-11-21
🏛️ arXiv.org
📈 Citations: 2
✨ Influential: 0
📄 PDF
🤖 AI Summary
Computing high-fidelity, computationally efficient probabilistic reachable sets (PRS) is critical for safe path planning in autonomous systems. Existing approaches—including Monte Carlo sampling, Hamilton–Jacobi (HJ) analysis, Gaussian processes, and filtering-based fusion—suffer from prohibitive computational cost, strong dependence on accurate dynamical models, or requirements for large-scale labeled data. This paper proposes a self-supervised neural network framework for convex approximation of two-dimensional PRS. It introduces the first integration of self-supervised multi-label learning with knowledge distillation from a convex optimization-based expert model—requiring neither prior dynamical system knowledge nor extensive sampling. Leveraging only a small number of trajectory samples, the method efficiently generates high-fidelity PRS. Experiments demonstrate that it matches the accuracy of the expert convex optimizer while accelerating PRS generation by over two orders of magnitude, substantially outperforming state-of-the-art baselines.

Technology Category

Search and Optimization: Sampling/Simulation-based SearchPlanning, Routing, and Scheduling: Learning for Planning and SchedulingIntelligent Robots: State Estimation

Application Category

Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphsSearch and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for rankingResponsible Web: Machine-in-the-loop, human agency and autonomy
📝 Abstract
Probabilistic Reachable Set (PRS) plays a crucial role in many fields of autonomous systems, yet efficiently generating PRS remains a significant challenge. This paper presents a learning approach to generating 2-dimensional PRS for states in a dynamic system. Traditional methods such as Hamilton-Jacobi reachability analysis, Monte Carlo, and Gaussian process classification face significant computational challenges or require detailed dynamics information, limiting their applicability in realistic situations. Existing data-driven methods may lack accuracy. To overcome these limitations, we propose leveraging neural networks, commonly used in imitation learning and computer vision, to imitate expert methods to generate PRS approximations. We trained the neural networks using a multi-label, self-supervised learning approach. We selected the fine-tuned convex approximation method as the expert to create expert PRS. Additionally, we continued sampling from the distribution to obtain a diverse array of sample sets. Given a small sample set, the trained neural networks can replicate the PRS approximation generated by the expert method, while the generation speed is much faster.
Problem

Research questions and friction points this paper is trying to address.

Modeling uncertainty in obstacle space identification for autonomous systems
Reducing computational costs of high-quality probabilistic obstacle generation
Generating convex obstacle spaces for efficient path planning
Innovation

Methods, ideas, or system contributions that make the work stand out.

Neural networks model uncertainty for obstacle spaces
Multi-label supervised learning trains network with expert data
Convex probabilistic obstacle space enables faster path planning
🔎 Similar Papers
💼 Related Jobs
No related jobs found.
San Diego State University
J
Jun Xiang
Department of Aerospace Engineering, San Diego State University, San Diego, CA 92182 USA
J
Jun Chen
Department of Aerospace Engineering, San Diego State University, San Diego, CA 92182 USA