Abstract
In this paper, we consider the problem of routing multiple robots to service spatially distributed requests at specified time instants. As a motivating example, we present the Robot Music Wall, a musically instrumented surface where planar positions correspond to distinct notes of an instrument. Multiple robots with the ability to traverse the wall can effectively “play” a piece of music by reaching positions on the wall that correspond to the musical notes in the piece, at specified time instants. We show that the multi-robot routing problem for servicing such spatio-temporal requests can be formulated as a pure assignment problem with the resulting reduction in complexity. Moreover, we derive the minimum number of robots required to service such requests.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
