Show simple item record

dc.contributor.authorAbbas, Waseem
dc.contributor.authorEgerstedt, Magnus B.
dc.date.accessioned2012-08-31T19:39:58Z
dc.date.available2012-08-31T19:39:58Z
dc.date.issued2012-06
dc.identifier.citationW. Abbas and M. Egerstedt. Securing Multiagent Systems Against a Sequence of Intruder Attacks. American Control Conference, Montreal, Canada, June 2012.en_US
dc.identifier.urihttp://hdl.handle.net/1853/44600
dc.descriptionPresented at the 2012 American Control Conference, June 27-29, Montréal, Canada.en_US
dc.description.abstractIn this paper, we discuss the issue of security in multiagent systems in the context of their underlying graph structure that models the interconnections among agents. In particular, we investigate the minimum number of guards required to counter an infinite sequence of intruder attacks with a given sensing and response range of an individual guard. We relate this problem of eternal security in graphs to the domination theory in graphs, providing tight bounds on the number of guards required along with schemes for securing a multiagent system over a graph.en_US
dc.language.isoen_USen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.subjectMulti-agent systemsen_US
dc.subjectGraph-based multi-agent controlen_US
dc.subjectSecurityen_US
dc.subjectMinimum guardsen_US
dc.titleSecuring Multiagent Systems Against a Sequence of Intruder Attacksen_US
dc.typeProceedingsen_US
dc.typePost-printen_US
dc.contributor.corporatenameGeorgia Institute of Technology. Center for Robotics and Intelligent Machinesen_US
dc.contributor.corporatenameGeorgia Institute of Technology. School of Electrical and Computer Engineeringen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record