Title:
Manipulability of Leader-Follower Networks with the Rigid-Link Approximation

dc.contributor.author Kawashima, Hiroaki
dc.contributor.author Egerstedt, Magnus B.
dc.contributor.corporatename Georgia Institute of Technology. School of Electrical and Computer Engineering en_US
dc.contributor.corporatename Georgia Institute of Technology. Institute for Robotics and Intelligent Machines en_US
dc.contributor.corporatename Kyoto University. Graduate School of Informatics en_US
dc.date.accessioned 2014-09-16T19:57:27Z
dc.date.available 2014-09-16T19:57:27Z
dc.date.issued 2014-03
dc.description © Elsevier. This is the author's version of a work that was accepted for publication in Automatica. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Automatica, Vol. 50, Issue 3, pp. 695-706, March 2014, doi: 10.1016/j.automatica.2013.11.041 en_US
dc.description DOI: 10.1016/j.automatica.2013.11.041
dc.description.abstract This paper introduces the notion of manipulability to mobile, multi-agent networks as a tool to analyze the instantaneous effectiveness of injecting control inputs at certain, so-called leader nodes in the network. Effectiveness is interpreted to characterize how the movements of the leader nodes translate into responses among the remaining follower nodes. This notion of effectiveness is a function of the interaction topologies, the agent configurations, and the particular choice of inputs used to influence the network. In fact, classic manipulability is an index used in robotics to analyze the singularity and efficiency of configurations of robot-arm manipulators. To define similar notions for leader-follower networks, we use a rigid-link approximation of the follower dynamics and, under this assumption, we prove that the instantaneous follower velocities can be uniquely determined from that of the leaders’, which allows us to define a meaningful and computable manipulability index for the leader-follower networks. This paper examines the property of the proposed index in simulation and with real mobile robots, and demonstrates how the index can be used to find effective interaction topologies. en_US
dc.embargo.terms null en_US
dc.identifier.citation H. Kawashima and M. Egerstedt. Manipulability of Leader-Follower Networks Under a Rigid-Link Approximation. Automatica, Vol. 50, Issue 3, pp. 695-706, March 2014. en_US
dc.identifier.doi 10.1016/j.automatica.2013.11.041
dc.identifier.issn 0005-1098
dc.identifier.uri http://hdl.handle.net/1853/52367
dc.language.iso en_US en_US
dc.publisher Georgia Institute of Technology en_US
dc.publisher.original Elsevier
dc.subject Multi-agent systems en_US
dc.subject Networked mobile robots en_US
dc.subject Rigidity theory en_US
dc.title Manipulability of Leader-Follower Networks with the Rigid-Link Approximation en_US
dc.type Text
dc.type.genre Pre-print
dspace.entity.type Publication
local.contributor.author Egerstedt, Magnus B.
local.contributor.corporatename School of Electrical and Computer Engineering
local.contributor.corporatename College of Engineering
relation.isAuthorOfPublication dd4872d3-2e0d-435d-861d-a61559d2bcb6
relation.isOrgUnitOfPublication 5b7adef2-447c-4270-b9fc-846bd76f80f2
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Hiroaki14.pdf
Size:
967.85 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
3.13 KB
Format:
Item-specific license agreed upon to submission
Description: