PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds
cs.RO
Submitted: 2026-08-06
Updated: 2026-09-20
Code: https://github.com/kunalnk123690/PathCover
Terminology
Sources
- Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming
- Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space
- Generating Large Convex Polytopes Directly on Point Clouds
- GPU Accelerated Voxel Grid Generation for Fast MAV Exploration
Related papers
- FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
- MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
- RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
- HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
- APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies
- Fine-tuning is Not Enough: A Parallel Framework for Collaborative Imitation and Reinforcement Learning in End-to-end Autonomous Driving