• DocumentCode
    3286318
  • Title

    Critical damping in a kinetic interaction network

  • Author

    Paley, D.A. ; Baharani, A.K.

  • Author_Institution
    Dept. of Aerosp. Eng., Univ. of Maryland, College Park, MD, USA
  • fYear
    2010
  • fDate
    June 30 2010-July 2 2010
  • Firstpage
    4628
  • Lastpage
    4633
  • Abstract
    In a kinetic interaction network, signals are emitted through motion. Natural examples include bird flocks, fish schools, and robot teams. A kinetic interaction network transmits information about external cues quickly and accurately. Analysis of a one-dimensional interaction network reveals a bound on the algebraic connectivity above which the transient response is overdamped. A critically damped response, the fastest and most accurate, is achieved by maximizing the algebraic connectivity subject to this bound. For example, in an n-neighbor interaction network, output rise time is minimized for intermediate values of n. This analytical result yields insight into natural networks and a design method for synthetic networks. We apply this result to automobile congestion by extending the Intelligent Driver Model to include interactions with multiple vehicles. Simulations indicate that, in certain portions of parameter space, traffic flow is improved by including directed interactions with an intermediate number of vehicles.
  • Keywords
    algebra; automobiles; damping; road traffic; transient response; algebraic connectivity subject; automobile congestion; critical damping; intelligent driver model; kinetic interaction network; multiple vehicles; natural networks; one-dimensional interaction network; synthetic networks; traffic flow; transient response; Automobiles; Birds; Damping; Design methodology; Educational institutions; Intelligent vehicles; Kinetic theory; Marine animals; Robots; Transient response;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    American Control Conference (ACC), 2010
  • Conference_Location
    Baltimore, MD
  • ISSN
    0743-1619
  • Print_ISBN
    978-1-4244-7426-4
  • Type

    conf

  • DOI
    10.1109/ACC.2010.5531059
  • Filename
    5531059