13 citations · 25 across the 16 of their papers we have counts for
Showing 2022Show all
3 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.CG2022
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem
Peyman Afshani, Mark de Berg, Kevin Buchin +7
We consider the following surveillance problem: Given a set of sites in a metric space and a set of robots with the same maximum speed, compute a patrol schedule of min…
cs.CG2022
Segment Visibility Counting Queries in Polygons
Kevin Buchin, Bram Custers, Ivor van der Hoog +4
Let be a simple polygon with vertices, and let be a set of points or line segments inside . We develop data structures that can efficiently count the number of o…