Research Papers

A Combinatorial Approach for Developing Ring Communication Graphs for Vehicle Formations

[+] Author and Article Information
Shyamprasad Konduri

Department of Mechanical Engineering,
Texas A&M University,
College Station, TX 77843
e-mail: konduri@tamu.edu

Prabhakar R. Pagilla

Fellow ASME
Department of Mechanical Engineering,
Texas A&M University,
College Station, TX 77843
e-mail: ppagilla@tamu.edu

Swaroop Darbha

Fellow ASME
Department of Mechanical Engineering,
Texas A&M University,
College Station, TX 77843
e-mail: dswaroop@tamu.edu

1Corresponding author.

Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL. Manuscript received August 26, 2016; final manuscript received April 13, 2017; published online June 28, 2017. Assoc. Editor: Jingang Yi.

J. Dyn. Sys., Meas., Control 139(10), 101014 (Jun 28, 2017) (9 pages) Paper No: DS-16-1417; doi: 10.1115/1.4036565 History: Received August 26, 2016; Revised April 13, 2017

In this paper, we study vehicle formations employing ring-structured communication strategies and propose a combinatorial approach for developing ring graphs for vehicle formations. In vehicle platoons, a ring graph is formed when each vehicle receives information from its predecessor, and the lead vehicle receives information from the last vehicle, thus forming a ring in its basic form. In such basic form, the communication distance between the first and the last vehicle increases with the platoon size, which creates implementation issues due to sensing range limitations. If one were to employ a communication protocol such as the token ring protocol, the delay in updating information and communication arises from the need for the token to travel across the entire graph. To overcome this limitation, alternative ring graphs which are formed by smaller communication distances between vehicles are proposed in this paper. For a given formation and a constraint on the maximum communication distance between any two vehicles, an algorithm to generate a ring graph is obtained by formulating the problem as an instance of the traveling salesman problem (TSP). In contrast to the vehicle platoons, generation of a ring communication graph is not straightforward for two- and three-dimensional formations; the TSP formulation allows this for both two- and three-dimensional formations with specific constraints. In addition, with ring communication structure, it is possible to devise simple ways to reconfigure the graph when vehicles are added/removed to/from the formation, which is discussed in the paper. Further, the experimental results using mobile robots for platooning and two-dimensional formations using ring graphs are shown and discussed.

Copyright © 2017 by ASME
Topics: Vehicles
Your Session has timed out. Please sign back in to continue.


Yadlapalli, S. , Darbha, S. , and Rajagopal, K. , 2006, “ Information Flow and Its Relation to Stability of the Motion of Vehicles in a Rigid Formation,” IEEE Trans. Autom. Control, 51(8), pp. 1315–1319. [CrossRef]
Darbha, S. , and Pagilla, P. R. , 2010, “ Limitations of Employing Undirected Information Flow Graphs for the Maintenance of Rigid Formations for Heterogeneous Vehicles,” Int. J. Eng. Sci., 48(11), pp. 1164–1178. [CrossRef]
Menon, A. , and Baras, J. S. , 2012, “ Expander Families as Information Patterns for Distributed Control of Vehicle Platoons,” Third IFAC Workshop on Distributed Estimation and Control in Networked Systems, Philadelphia, PA, Sept. 10–11, pp. 288–293.
Hao, H. , and Barooah, P. , 2012, “ On Achieving Size-Independent Stability Margin of Vehicular Lattice Formations With Distributed Control,” IEEE Trans. Autom. Control, 57(10), pp. 2688–2694. [CrossRef]
Shladover, S. E. , 1991, “ Longitudinal Control of Automotive Vehicles in Close-Formation Platoons,” ASME J. Dyn. Syst., Meas., Control, 113(2), pp. 231–241. [CrossRef]
Rogge, J. A. , and Aeyels, D. , 2008, “ Vehicle Platoons Through Ring Coupling,” IEEE Trans. Autom. Control, 53(6), pp. 1370–1378. [CrossRef]
Marshall, J. A. , Broucke, M. E. , and Francis, B. A. , 2004, “ Formations of Vehicles in Cyclic Pursuit,” IEEE Trans. Autom. Control, 49(11), pp. 1963–1974. [CrossRef]
Galloway, K. , Justh, E. , and Krishnaprasad, P. , 2009, “ Geometry of Cyclic Pursuit,” IEEE Conference on Decision and Control (CDC), Shanghai, China, Dec. 15–18, pp. 7485–7490.
Konduri, S. , Pagilla, P. , and Darbha, S. , 2013, “ Vehicle Formations Using Directed Information Flow Graphs,” American Control Conference (ACC), Washington, DC, June 17–19, pp. 3045–3050.
Sungu, H. E. , Inoue, M. , and Imura, J. , 2015, “ Nonlinear Spacing Policy Based Vehicle Platoon Control for Local String Stability and Global Traffic Flow Stability,” European Control Conference (ECC), Linz, Austria, July 15–17, pp. 3396–3401.
Jin, I . G. , Avedisov, S. S. , and Orosz, G. , 2013, “ Stability of Connected Vehicle Platoons With Delayed Acceleration Feedback,” ASME Paper No. DSCC2013-4040.
Fruchterman, T. M. J. , and Reingold, E. M. , 1991, “ Graph Drawing by Force-Directed Placement,” Software Pract. Exp., 21(11), pp. 1129–1164. [CrossRef]
Dwyer, T. , Koren, Y. , and Marriott, K. , 2006, “ Drawing Directed Graphs Using Quadratic Programming,” IEEE Trans. Visualization Comput. Graphics, 12(4), pp. 536–548. [CrossRef]
Navaravong, L. , Shea, J. , Pasiliao, E. , and Dixon, W. , 2012, “ Optimizing Network Topology to Reduce Aggregate Traffic in a System of Mobile Robots Under an Energy Constraint,” IEEE International Conference on Communications, Ottawa, ON, June 10–15, pp. 16–20.
Nowakowski, C. , Thompson, D. , Shladover, S. E. , Kailas, A. , and Lu, X.-Y. , 2016, “ Operational Concepts for Truck Cooperative Adaptive Cruise Control (Cacc) Maneuvers,” Transportation Research Board 95th Annual Meeting, Washington, DC, Jan. 10–14, Paper No. 16-4462. http://docs.trb.org/prp/16-4462.pdf
Swaroop, D. , Hedrick, J. , Chien, C. , and Ioannou, P. , 1994, “ A Comparison of Spacing and Headway Control Laws for Automatically Controlled Vehicles,” Veh. Syst. Dyn., 23(1), pp. 597–625. [CrossRef]
Swaroop, D. V. A. H. G. , 1994, “ String Stability of Interconnected Systems: An Application to Platooning in Automated Highway Systems,” Ph.D. thesis, University of California, Berkeley, CA. https://ideas.repec.org/p/cdl/itsrrp/qt86z6h1b1.html
Qiu, J. , Gao, H. , and Ding, S. X. , 2016, “ Recent Advances on Fuzzy-Model-Based Nonlinear Networked Control Systems: A Survey,” IEEE Trans. Ind. Electron., 63(2), pp. 1207–1217. [CrossRef]
Gray, R. M. , 2006, “ Toeplitz and Circulant Matrices: A Review,” Found. Trends. Commun. Inf. Theory, 2(3), pp. 155–239.
Mazancourt, T. D. , and Gerlic, D. , 1983, “ The Inverse of a Block-Circulant Matrix,” IEEE Trans. Antennas Propag., 31(5), pp. 808–810. [CrossRef]
Reinelt, G. , 1994, The Traveling Salesman: Computational Solutions for TSP Applications, Springer-Verlag, Berlin.
Archetti, C. , Bertazzi, L. , and Speranza, M. G. , 2003, “ Reoptimizing the Traveling Salesman Problem,” Networks, 42(3), pp. 154–159. [CrossRef]
Kanayama, Y. , Kimura, Y. , Miyazaki, F. , and Noguchi, T. , 1990, “ A Stable Tracking Control Method for an Autonomous Mobile Robot,” IEEE International Conference on Robotics and Automation (ICRA), Cincinnati, OH, May 13–18, Vol. 1, pp. 384–389.


Grahic Jump Location
Fig. 1

Position of vehicles with control law (3), actuator lag τ=0.5 s, time headway h = 0.6 s with ka = 0 (top) and ka=0.75 (bottom)

Grahic Jump Location
Fig. 2

Basic ring communication in a platoon with five vehicles

Grahic Jump Location
Fig. 3

Alternate ring graph with communication structure 1→3→5→2→4→1

Grahic Jump Location
Fig. 4

Information hopping from vehicle ten to one

Grahic Jump Location
Fig. 5

Platoon of ten vehicles with alternative ring graph

Grahic Jump Location
Fig. 6

Two- and three-dimensional formation examples with communication range disk

Grahic Jump Location
Fig. 7

Two- and three-dimensional formations with ring graph obtained from the TSP formulation

Grahic Jump Location
Fig. 8

Eigenvalues of the platoons with ring graph with ten and 13 vehicles

Grahic Jump Location
Fig. 9

Graph reconfiguration after adding a single node, newly added node “m” and its closest node along the path “nc,” Reconfigured graph passing through “m”

Grahic Jump Location
Fig. 10

Reconfiguration using graph search: initial configuration, and reconfigured graph with additional two vehicles

Grahic Jump Location
Fig. 11

Picture of mobile robots

Grahic Jump Location
Fig. 12

Two loop trajectory tracking controller

Grahic Jump Location
Fig. 13

Evolution of position with (a) basic and alternative ring graphs, (b) initial position less and greater than desired spacing, and (c) triangle and square formation with nonzero initial position errors



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In