paper-with-me

홈 › Papers

Convex Collision-Free Regions

2026-07-29 · Tomoyo Kikuchi, Takashi Kanai arxiv

Convex Collision-Free Regions (CCFR) is a collision handling method that explicitly represents local convex feasible regions to enforce non-penetration. Each feasible region is constructed from surrounding mesh primitive configurations, including edge-edge and vertex-face interactions. The resulting convex region represents admissible non-penetrating vertex displacements at the current configuration. Existing collision handling methods for deformable body simulation have largely relied on implicit representations of feasibility, resulting in either compromised robustness for secondary collisions and codimensional contacts or tight coupling with specific nonlinear optimization schemes. Our formulation constructs feasible regions independently for each vertex, defined prior to penetration, inherently accounts not only for primary collisions but also for secondary collisions and codimensional contacts, enabling highly scalable and parallelizable collision handling. These feasible regions encode geometric non-penetration constraints independently of physical contact response models. CCFR does not rely on nonlinear optimization and is compatible with simulation frameworks such as Extended Position-Based Dynamics (XPBD) that do not explicitly maintain interior feasibility during iterative updates. The effectiveness of CCFR is demonstrated across cloth, hair, wire, particle systems, and codimensional contact scenarios, showing versatile and efficient collision handling.

📄 PDF Abstract BibTeX arXiv:2607.26901

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Safe Navigation in Unknown and Cluttered Environments via Direction-Aware Convex Free-Region Generation

2026-04-26 · Zhicheng Song, Yongjian Li, Kai Chen, Yulin Li 외 arxiv

Convex free regions provide a structured and optimization-friendly representation of collision-free space for robot navigation in unknown and cluttered environments. However, existing methods typically enlarge local coll…

Robot Navigation

Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning

2026-06-10 · Taerim Yoon, Dongho Kang, Kisang Park, Junha Cha 외 arxiv

Collision-free path planning in cluttered, real-world environments relies on a representation of the collision-free space, and existing representations broadly fall into two categories. Explicit representations, such as …

Trajectory Planning Using Safe Ellipsoidal Corridors as Projections of Orthogonal Trust Regions

2025-09-24 · Akshay Jaitly, Jon Arrizabalaga, Guanrui Li arxiv

Planning collision free trajectories in complex environments remains a core challenge in robotics. Existing corridor based planners which rely on decomposition of the free space into collision free subsets scale poorly w…

Trajectory Planning

Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets

2026-07-01 · Jingtao Tang, Zining Mao, Lufan Yang, Hang Ma arxiv

Spatiotemporal motion planning, especially in multi-robot settings, requires robots to reason about collision-free regions that change over time, which is challenging in continuous spaces when feasible regions are transi…

Motion Planning

Systematic Constraint Formulation and Collision-Free Trajectory Planning Using Space-Time Graphs of Convex Sets

2025-08-13 · Matthew D. Osburn, Cameron K. Peterson, John L. Salmon arxiv

In this paper, we create optimal, collision-free, time-dependent trajectories through cluttered dynamic environments. The many spatial and temporal constraints make finding an initial guess for a numerical solver difficu…

Trajectory Planning