On multi-vehicle rendezvous under quantized communication

A rendezvous problem for a team of autonomous vehicles, which communicate over quantized channels, is analyzed. The paper illustrates how communication topologies based on uniform and logarithmic quantizations influence the performance. Since a logarithmic quantizer in general imposes fewer bits to be communicated compared to a uniform quantizer, the results indicate estimates of lower limits on the amount of information that needs to be exchanged in order for the vehicles to meet. Simulation examples illustrate the results.

[1]  Jie Lin,et al.  The multi-agent rendezvous problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[2]  Karl Henrik Johansson,et al.  On some communication schemes for distributed pursuit-evasion games , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[3]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[4]  Nicola Elia,et al.  Stabilization of linear systems with limited information , 2001, IEEE Trans. Autom. Control..

[5]  Pravin Varaiya,et al.  Smart cars on smart roads: problems of control , 1991, IEEE Trans. Autom. Control..

[6]  Fernando Lobo Pereira,et al.  On coordinated control strategies for networked dynamic control systems - an application to AUVs , 2002 .

[7]  Sandro Zampieri,et al.  Stability analysis and synthesis for scalar linear systems with a quantized feedback , 2003, IEEE Trans. Autom. Control..

[8]  Richard M. Murray,et al.  Flocking with obstacle avoidance: cooperation with limited communication in mobile networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).