Show simple item record

dc.contributor.authorSmith, Brian Stephen
dc.contributor.authorEgerstedt, Magnus B.
dc.contributor.authorHoward, Ayanna M.
dc.date.accessioned2011-04-12T19:14:35Z
dc.date.available2011-04-12T19:14:35Z
dc.date.issued2007-10
dc.identifier.citationB. Smith, M. Egerstedt, and A. Howard. Automatic Generation of Persistent Formations for Multi-Agent Networks Under Range Constraints. ROBOCOMM, Athens, Greece, Oct. 2007.en_US
dc.identifier.urihttp://hdl.handle.net/1853/38490
dc.descriptionPresented at ROBOCOMM, Athens, Greece, Oct. 2007.en_US
dc.description.abstractWe present graph-based methods for determining if a mobile robot network with a defined sensor and communication range can persistently achieve a specified formation, which implies that the formation, once achieved, will be preserved by the direct maintenance of a subset of inter-agent distances. Here, formations are defined by a set of points whose inter-point distances correspond to desired inter-agent distances. Further, we provide graph operations to describe agent interactions that implement a given formation, as well as an algorithm that, given a persistent formation, automatically generates a sequence of such operations.en_US
dc.language.isoen_USen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.subjectMulti-agent networksen_US
dc.subjectAgent interactionsen_US
dc.subjectFormation controlen_US
dc.titleAutomatic Generation of Persistent Formations for Multi-Agent Networks Under Range Constraintsen_US
dc.typeProceedingsen_US
dc.contributor.corporatenameGeorgia Institute of Technology. School of Electrical and Computer Engineering
dc.contributor.corporatenameGeorgia Institute of Technology. Center for Robotics and Intelligent Machines


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record