Automated Traffic and the Finite Size ResonanceMathematics and Statistics Faculty Publications and Presentations
- Control theory -- Mathematical models,
- Multiagent systems,
- Feedback control systems,
- Laplacian operators
AbstractWe investigate in detail what one might call the canonical (automated) traffic problem: A long string of N+1 cars (numbered from 0 to N) moves along a one-lane road “in formation” at a constant velocity and with a unit distance between successive cars. Each car monitors the relative velocity and position of only its neighboring cars. This information is then fed back to its own engine which decelerates (brakes) or accelerates according to the information it receives. The question is: What happens when due to an external influence—a traffic light turning green—the ‘zero’th’ car (the “leader”) accelerates? As a first approximation, we analyze linear(ized) equations and show that in this scenario the traffic flow has a tendency to be stop-and-go. We give approximate solutions for the global traffic as function of all the relevant parameters (the feed back parameters as well as cruise velocity and so on). We discuss general design principles for these algorithms, that is: how does the choice of parameters influence the performance.
Citation InformationJ. J. P. Veerman, Borko D. Stošić and F. M. Tangerman. "Automated Traffic and the Finite Size Resonance" (2009)
Available at: http://works.bepress.com/jj-veerman/34/