Copertina

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Werner, Peter, Amice, Alexandre, Marcucci, Tobia, Rus, Daniela, Tedrake, Russ
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

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

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

Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets
di: Morozov, Savva, et al.
Pubblicazione: (2025)

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

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

Towards Tight Convex Relaxations for Contact-Rich Manipulation
di: Graesdal, Bernhard Paus, et al.
Pubblicazione: (2024)

Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces
di: Garg, Shruti, et al.
Pubblicazione: (2024)

Shortest Paths in Graphs of Convex Sets
di: Marcucci, Tobia, et al.
Pubblicazione: (2021)

Fast Path Planning Through Large Collections of Safe Boxes
di: Marcucci, Tobia, et al.
Pubblicazione: (2023)

A Framework for Combining Optimization-Based and Analytic Inverse Kinematics
di: Cohn, Thomas, et al.
Pubblicazione: (2026)

A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling
di: Yang, Lujie, et al.
Pubblicazione: (2025)

Sampling-Based Motion Planning with Discrete Configuration-Space Symmetries
di: Cohn, Thomas, et al.
Pubblicazione: (2025)

A Unified and Scalable Method for Optimization over Graphs of Convex Sets
di: Marcucci, Tobia
Pubblicazione: (2025)

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

A Screw Approach to the Approximation of the Local Geometry of the Configuration Space and of the set of Configurations of Certain Rank of Lower Pair Linkages
di: Mueller, Andreas
Pubblicazione: (2025)

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

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

Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning
di: Tang, Jingtao, et al.
Pubblicazione: (2025)

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
di: Di Luna, Giuseppe A., et al.
Pubblicazione: (2020)

Efficient Incremental Penetration Depth Estimation between Convex Geometries
di: Gao, Wei
Pubblicazione: (2023)

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

Approximate Environment Decompositions for Robot Coverage Planning using Submodular Set Cover
di: Ramesh, Megnath, et al.
Pubblicazione: (2024)

Multi-Covering a Point Set by $m$ Disks with Minimum Total Area
di: Guitouni, Mariem, 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)

Convex Covering Using Collections of Convex Polygons and Set Cover
di: da Fonseca, Guilherme D.
Pubblicazione: (2023)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
di: Garcia, Javier, et al.
Pubblicazione: (2025)

A biconvex method for minimum-time motion planning through sequences of convex sets
di: Marcucci, Tobia, et al.
Pubblicazione: (2025)

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

Scalable Real2Sim: Physics-Aware Asset Generation Via Robotic Pick-and-Place Setups
di: Pfaff, Nicholas, et al.
Pubblicazione: (2025)

Robot Fleet Learning via Policy Merging
di: Wang, Lirui, et al.
Pubblicazione: (2023)

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

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
di: Gao, Jie, et al.
Pubblicazione: (2025)

Tractability Frontiers in Multi-Robot Coordination and Geometric Reconfiguration
di: Geft, Tzvika, et al.
Pubblicazione: (2021)

PoCo: Policy Composition from and for Heterogeneous Robot Learning
di: Wang, Lirui, et al.
Pubblicazione: (2024)

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)

Safe Control for Soft-Rigid Robots with Self-Contact using Control Barrier Functions
di: Patterson, Zach J., et al.
Pubblicazione: (2023)

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

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

Constrained Bimanual Planning with Analytic Inverse Kinematics
di: Cohn, Thomas, et al.
Pubblicazione: (2023)

Universal Manipulation Interface: In-The-Wild Robot Teaching Without In-The-Wild Robots
di: Chi, Cheng, et al.
Pubblicazione: (2024)