1 citations · 1 across the 13 of their papers we have counts for
5 papers · 1 filter
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours
Sándor P. Fekete, Dominik Krupke, Michael Perk +2
For a given polygonal region , the Lawn Mowing Problem (LMP) asks for a shortest tour that gets within Euclidean distance 1 of every point in ; this is equivalent to comp…
Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring
Javier Garcia, Michael Yannuzzi, Peter Kramer +3
We present progress on the problem of reconfiguring a 2D arrangement of building material by a cooperative group of robots. These robots must avoid collisions, deadlocks, and are s…
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
Sándor P. Fekete, Peter Kramer, Christian Rieck +2
When considering motion planning for a swarm of labeled robots, we need to rearrange a given start configuration into a desired target configuration via a sequence of parallel,…
The Dispersive Art Gallery Problem
Christian Rieck, Christian Scheffer
We introduce a new variant of the art gallery problem that comes from safety issues. In this variant we are not interested in guard sets of smallest cardinality, but in guard sets…
Connected Reconfiguration of Polyominoes Amid Obstacles using RRT*
Javier Garcia, Michael Yannuzzi, Peter Kramer +2
This paper investigates the use of a sampling-based approach, the RRT*, to reconfigure a 2D set of connected tiles in complex environments, where multiple obstacles might be presen…