3 papers
cs.RO2025
Fast and Near-Optimal Collision-Free Robot Scheduling On Paths
Duncan Adamson, Nathan Flaherty, Igor Potapov +2
In this paper, we address the problem of scheduling a set of robots to complete tasks in a laboratory environment, modelled as a graph, while avoiding collisions. We analyze the dy…
cs.DS2024
Collision-Free Robot Scheduling
Duncan Adamson, Nathan Flaherty, Igor Potapov +1
Robots are becoming an increasingly common part of scientific work within laboratory environments. In this paper, we investigate the problem of designing \emph{schedules} for compl…
math.CO2023
Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
Duncan Adamson, Nathan Flaherty, Igor Potapov +1
In this paper, we study the graph induced by the permutation on words with a fixed Parikh vector. A -swap is defined as a pair of positions where…