• DocumentCode
    3436491
  • Title

    Approximate manipulability of leader-follower networks

  • Author

    Kawashima, Hiroaki ; Egerstedt, Magnus

  • Author_Institution
    Grad. Sch. of Inf., Kyoto Univ., Kyoto, Japan
  • fYear
    2011
  • fDate
    12-15 Dec. 2011
  • Firstpage
    6618
  • Lastpage
    6623
  • Abstract
    We introduce the notion of manipulability to leader-follower networks as a tool to analyze how effective inputs injected at a leader node are in terms of their impact on the movements of the follower nodes, as a function of the interaction topologies and agent configurations. Classic manipulability is an index used in robotics for analyzing 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 by that of the leader´s, which allows us to define a meaningful manipulability index of the leader-follower networks.
  • Keywords
    approximation theory; dexterous manipulators; mobile agents; multi-agent systems; network theory (graphs); network topology; agent configurations; approximate manipulability index; follower nodes; interaction topology; leader node; leader-follower networks; rigid-link approximation; robot arm manipulators; Approximation methods; Eigenvalues and eigenfunctions; Equations; Indexes; Lead; Network topology; Robots;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on
  • Conference_Location
    Orlando, FL
  • ISSN
    0743-1546
  • Print_ISBN
    978-1-61284-800-6
  • Electronic_ISBN
    0743-1546
  • Type

    conf

  • DOI
    10.1109/CDC.2011.6160974
  • Filename
    6160974