Show simple item record

dc.contributor.authorChopra, Smritien_US
dc.contributor.authorEgerstedt, Magnus B.en_US
dc.date.accessioned2013-02-13T16:03:46Z
dc.date.available2013-02-13T16:03:46Z
dc.date.issued2012-09
dc.identifier.citationS. Chopra and M. Egerstedt, “Multi-Robot Routing under Connectivity Constraints,” IFAC Workshop on Estimation and Control of Networked Systems, Santa Barbara, CA, Sept. 2012.en_US
dc.identifier.isbn978-3-902823-22-9
dc.identifier.urihttp://hdl.handle.net/1853/46182
dc.descriptionPresented at the 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems (2012)en_US
dc.descriptionDOI: 10.3182/20120914-2-US-4030.00066en_US
dc.description.abstractThis paper addresses the problem of routing multiple range constrained robots to service spatially distributed requests at specified time instants, while ensuring a connected information exchange network at all times. We discuss the feasibility aspects of such a connectivity constrained routing problem. In particular, we derive the minimum number of robots required to service such requests, and we present an algorithm for the explicit construction of the corresponding routes for every robot, with total path lengths as the optimization criteria.en_US
dc.language.isoen_USen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.subjectAssignment problemsen_US
dc.subjectAutonomous mobile robotsen_US
dc.subjectConnectivity constraintsen_US
dc.subjectVehicle routingen_US
dc.titleMulti-robot routing under connectivity constraintsen_US
dc.typeProceedingsen_US
dc.typePost-printen_US
dc.contributor.corporatenameGeorgia Institute of Technology. School of Electrical and Computer Engineeringen_US
dc.contributor.corporatenameGeorgia Institute of Technology. Center for Robotics and Intelligent Machinesen_US
dc.publisher.originalElsevieren_US
dc.identifier.doi10.3182/20120914-2-US-4030.00066


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record