Collision-free motions of round robots on metric graphs
In this thesis, we study the path-connectivity problem of configuration spaces of two robots that move without collisions on a connected metric graph. The robots are modelled as metric balls of positive radii. In other words, we wish to find the number of path-connected components of such a configur...
Main Author: | |
---|---|
Published: |
Durham University
2013
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.578226 |