We introduce a type of movement constraints for a swarm of robots in a grid environment, which is inspired by Alex Randolphâ€™s board game Ricochet Robot and new to the field of robot motion planning.â€¦ (More)

We consider the Minimum Manhattan Subnetwork (MMSN) Problem which generalizes the already known Minimum Manhattan Network (MMN) Problem: Given a set P of n points in the plane, find shortestâ€¦ (More)

The problem to find a valid integer flow with flow multipliers on nodes or arcs is long known to be NP-complete [10]. We show that the problem is still hard when restricted to instances with aâ€¦ (More)

We introduce a new type of movement constraints for a swarm of robots in a grid environment. This type is inspired by Alex Randolphs board game Ricochet Robot and may be used to model robots withâ€¦ (More)

In the freight car dispatching problem empty freight cars have to be assigned to known demands respecting a given time horizon and certain constraints. The goal is to minimize the resultingâ€¦ (More)