Copertina

Efficient Incremental Penetration Depth Estimation between Convex Geometries

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Gao, Wei
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Robotics Computational Geometry
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Learning the Contact Manifold for Accurate Pose Estimation During Peg-in-Hole Insertion of Complex Geometries
di: Negi, Abhay, et al.
Pubblicazione: (2025)

Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning
di: Werner, Peter, et al.
Pubblicazione: (2025)

Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space
di: Werner, Peter, et al.
Pubblicazione: (2024)

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

Foam: A Tool for Spherical Approximation of Robot Geometry
di: Coumar, Sai, et al.
Pubblicazione: (2025)

Decoupling Geometry from Optimization in 2D Irregular Cutting and Packing Problems: an Open-Source Collision Detection Engine
di: Gardeyn, Jeroen, et al.
Pubblicazione: (2025)

Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
di: Kirkpatrick, David, et al.
Pubblicazione: (2025)

On The Computational Complexity of Minimum Aerial Photographs for Planar Region Coverage
di: Feng, Si Wei
Pubblicazione: (2025)

An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning
di: Ibrahim, Ibrahim, et al.
Pubblicazione: (2024)

Efficient Path Planning with Soft Homology Constraints
di: Taveras, Carlos A., et al.
Pubblicazione: (2024)

Fast and Accurate Collision Probability Estimation for Autonomous Vehicles using Adaptive Sigma-Point Sampling
di: Cossette, Charles Champagne, et al.
Pubblicazione: (2025)

Approximation Depth of Convex Polytopes
di: Bakaev, Egor, et al.
Pubblicazione: (2025)

Implicit Swept Volume SDF: Enabling Continuous Collision-Free Trajectory Generation for Arbitrary Shapes
di: Wang, Jingping, et al.
Pubblicazione: (2024)

Ipelets for the Convex Polygonal Geometry
di: Parepally, Nithin, et al.
Pubblicazione: (2024)

Spiral Complete Coverage Path Planning Based on Conformal Slit Mapping in Multi-connected Domains
di: Shen, Changqing, et al.
Pubblicazione: (2023)

Certifying Bimanual RRT Motion Plans in a Second
di: Amice, Alexandre, et al.
Pubblicazione: (2023)

Reconfiguration and Locomotion with Joint Movements in the Amoebot Model
di: Padalkin, Andreas, et al.
Pubblicazione: (2023)

A Sublinear Algorithm for Path Feasibility Among Rectangular Obstacles
di: Fan, Alex, et al.
Pubblicazione: (2025)

Passage-traversing optimal path planning with sampling-based algorithms
di: Huang, Jing, et al.
Pubblicazione: (2025)

Morphing of and writing with a scissor linkage mechanism
di: A, Mohanraj, et al.
Pubblicazione: (2026)

Non-planar 3D Printing of Double Shells
di: Mitropoulou, Ioanna, et al.
Pubblicazione: (2025)

TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments
di: Mikula, Jan, et al.
Pubblicazione: (2024)

Theory and Explicit Design of a Path Planner for an SE(3) Robot
di: Zhang, Zhaoqi, et al.
Pubblicazione: (2024)

Co-design Optimization of Moving Parts for Compliance and Collision Avoidance
di: Mirzendehdel, Amir M., et al.
Pubblicazione: (2025)

From axial C-hedra to general P-nets
di: Nawratil, Georg
Pubblicazione: (2024)

Rapid Vector-based Any-angle Path Planning with Non-convex Obstacles
di: Lai, Yan Kai
Pubblicazione: (2024)

Provable Methods for Searching with an Imperfect Sensor
di: Chakraborty, Nilanjan, et al.
Pubblicazione: (2024)

VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization
di: Xiong, Biao, et al.
Pubblicazione: (2025)

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
di: Mikula, Jan, et al.
Pubblicazione: (2025)

Accelerated Reeds-Shepp and Under-Specified Reeds-Shepp Algorithms for Mobile Robot Path Planning
di: Ibrahim, Ibrahim, et al.
Pubblicazione: (2025)

Polyhedral Collision Detection via Vertex Enumeration
di: Cinar, Andrew, et al.
Pubblicazione: (2025)

A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers
di: Bilevich, Michael M., et al.
Pubblicazione: (2025)

Omnidirectional Sensor Placement: A Large-Scale Computational Study and Novel Hybrid Accelerated-Refinement Heuristics
di: Mikula, Jan, et al.
Pubblicazione: (2024)

Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring
di: Garcia, Javier, et al.
Pubblicazione: (2022)

Towards Practical Finite Sample Bounds for Motion Planning in TAMP
di: Shaw, Seiji, et al.
Pubblicazione: (2024)

Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs
di: Farhana, Tsuri, et al.
Pubblicazione: (2026)

Ten Problems in Geobotics
di: Abrahamsen, Mikkel, et al.
Pubblicazione: (2024)

Construction and deformation of P-hedra using control polylines
di: Nawratil, Georg
Pubblicazione: (2025)

INF-3DP: Implicit Neural Fields for Collision-Free Multi-Axis 3D Printing
di: Qu, Jiasheng, et al.
Pubblicazione: (2025)

RPT*: Global Planning with Probabilistic Terminals for Target Search in Complex Environments
di: Lyu, Yunpeng, et al.
Pubblicazione: (2026)