activity
20122022
most citeddRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning

93 citations · 129 across the 10 of their papers we have counts for

collaborators
Showing cs.CGShow all

9 papers · 1 filter

cs.CG2022

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds

Bahareh Banyassady, Mark de Berg, Karl Bringmann +6

We consider the unlabeled motion-planning problem of unit-disc robots moving in a simple polygonal workspace of edges. The goal is to find a motion plan that moves the robo…

cs.CG2021

Throwing a Sofa Through the Window

Dan Halperin, Micha Sharir, Itay Yehuda

We study several variants of the problem of moving a convex polytope , with edges, in three dimensions through a flat rectangular (and sometimes more general) window. Specif…

cs.CG2020

Space-Aware Reconfiguration

Dan Halperin, Marc van Kreveld, Golan Miglioli-Levy +1

We consider the problem of reconfiguring a set of physical objects into a desired target configuration, a typical (sub)task in robotics and automation, arising in product assembly,…

cs.CG2020

Geometric Sparsification of Closeness Relations: Eigenvalue Clustering for Computing Matrix Functions

Nir Goren, Dan Halperin, Sivan Toledo

We show how to efficiently solve a clustering problem that arises in a method to evaluate functions of matrices. The problem requires finding the connected components of a graph wh…

cs.CG2020

The Maximum-Level Vertex in an Arrangement of Lines

Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn +2

Let be a set of lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement of maximum…

cs.CG2019

Optimized Synthesis of Snapping Fixtures

Tom Tsabar, Efi Fogel, Dan Halperin

Fixtures for constraining the movement of parts have been extensively investigated in robotics, since they are essential for using robots in automated manufacturing. This paper dea…