:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Wu, Pengcheng, Martinez, Sonia, Chen, Jun
Format:	Preprint
Published:	2023
Subjects:	Robotics
Online Access:	https://arxiv.org/abs/2303.01549
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convex Hulls of Reachable Sets
by: Lew, Thomas, et al.
Published: (2023)

Learning Probabilistic Obstacle Spaces from Data-driven Uncertainty using Neural Networks
by: Xiang, Jun, et al.
Published: (2024)

Data-driven Probabilistic Trajectory Learning with High Temporal Resolution in Terminal Airspace
by: Xiang, Jun, et al.
Published: (2024)

Reachability-Guaranteed Optimal Control for the Interception of Dynamic Targets under Uncertainty
by: Faraci, Tommaso, et al.
Published: (2025)

STAR-Filter: Efficient Convex Free-Space Approximation via Starshaped Set Filtering in Noisy Environments
by: Wu, Yuwei, et al.
Published: (2026)

Conformalized Reachable Sets for Obstacle Avoidance With Spheres
by: Kwon, Yongseok, et al.
Published: (2024)

PRREACH: Probabilistic Risk Assessment Using Reachability for UAV Control
by: Fronda, Nicole, et al.
Published: (2025)

Scenario Convex Programs for Dexterous Manipulation under Modeling Uncertainties
by: Altiner, Berk, et al.
Published: (2024)

Approximately Optimal Global Planning for Contact-Rich SE(2) Manipulation on a Graph of Reachable Sets
by: Liu, Simin, et al.
Published: (2026)

Robust Verification of Controllers under State Uncertainty via Hamilton-Jacobi Reachability Analysis
by: Lin, Albert, et al.
Published: (2025)

SDP Synthesis of Distributionally Robust Backward Reachable Trees for Probabilistic Planning
by: Aggarwal, Naman, et al.
Published: (2024)

Safe and Nonconservative Contingency Planning for Autonomous Vehicles via Online Learning-Based Reachable Set Barriers
by: Yang, Rui, et al.
Published: (2025)

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
by: Werner, Peter, et al.
Published: (2023)

Efficient Probabilistic Planning with Maximum-Coverage Distributionally Robust Backward Reachable Trees
by: Rose, Alex, et al.
Published: (2025)

An Algorithm for Distributed Computation of Reachable Sets for Multi-Agent Systems
by: Thapliyal, Omanshu, et al.
Published: (2024)

Parameter-Conditioned Reachable Sets for Updating Safety Assurances Online
by: Borquez, Javier, et al.
Published: (2022)

Dependent Reachable Sets for the Constant Bearing Pursuit Strategy
by: Makkapati, Venkata Ramana, et al.
Published: (2025)

Domains as Objectives: Domain-Uncertainty-Aware Policy Optimization through Explicit Multi-Domain Convex Coverage Set Learning
by: Ilboudo, Wendyam Eric Lionel, et al.
Published: (2024)

Data-driven Reachability Verification with Probabilistic Guarantees under Koopman Spectral Uncertainty
by: Ding, Jianqiang, et al.
Published: (2025)

Safe Navigation using Neural Radiance Fields via Reachable Sets
by: Thapliyal, Omanshu, et al.
Published: (2026)

Probabilistic Uncertainty Quantification of Prediction Models with Application to Visual Localization
by: Chen, Junan, et al.
Published: (2023)

Reachable Sets-based Trajectory Planning Combining Reinforcement Learning and iLQR
by: Huang, Wenjie, et al.
Published: (2025)

Fine-Tuning of Neural Network Approximate MPC without Retraining via Bayesian Optimization
by: Hose, Henrik, et al.
Published: (2025)

$A^*$ for Graphs of Convex Sets
by: Sundar, Kaarthik, et al.
Published: (2024)

Implicit Graph Search for Planning on Graphs of Convex Sets
by: Natarajan, Ramkumar, et al.
Published: (2024)

HJRNO: Hamilton-Jacobi Reachability with Neural Operators
by: Li, Yankai, et al.
Published: (2025)

Patching Approximately Safe Value Functions Leveraging Local Hamilton-Jacobi Reachability Analysis
by: Tonkens, Sander, et al.
Published: (2023)

A Reachability Tree-Based Algorithm for Robot Task and Motion Planning
by: Kim, Kanghyun, et al.
Published: (2023)

Safety Evaluation of Motion Plans Using Trajectory Predictors as Forward Reachable Set Estimators
by: Chakraborty, Kaustav, et al.
Published: (2025)

GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
by: Chia, Shao Yuan Chew, et al.
Published: (2024)

ADMM-based Continuous Trajectory Optimization in Graphs of Convex Sets
by: Pries, Lukas, et al.
Published: (2026)

Multi-Query Shortest-Path Problem in Graphs of Convex Sets
by: Morozov, Savva, et al.
Published: (2024)

Signal Temporal Logic Motion Planning via Graphs of Convex Sets
by: Chen, Yu, et al.
Published: (2026)

An Overtaking Trajectory Planning Framework Based on Spatio-temporal Topology and Reachable Set Analysis Ensuring Time Efficiency
by: Mao, Wule, et al.
Published: (2024)

Manifold-constrained Hamilton-Jacobi Reachability Learning for Decentralized Multi-Agent Motion Planning
by: Chen, Qingyi, et al.
Published: (2025)

CoFRIDA: Self-Supervised Fine-Tuning for Human-Robot Co-Painting
by: Schaldenbrand, Peter, et al.
Published: (2024)

Conformal Reachability for Safe Control in Unknown Environments
by: Ma, Xinhang, et al.
Published: (2026)

The Teenager's Problem: Efficient Garment Decluttering as Probabilistic Set Cover
by: Adler, Aviv, et al.
Published: (2023)

Actions as Language: Fine-Tuning VLMs into VLAs Without Catastrophic Forgetting
by: Hancock, Asher J., et al.
Published: (2025)

CLOSURE: Fast Quantification of Pose Uncertainty Sets
by: Gao, Yihuai, et al.
Published: (2024)