Consensus Problem of Multivehicle Formation Using Nearest Neighbor Rule with Addition of State Buffer

Umm E Amin; Shu Li Guo; Li Na Han

doi:10.4028/www.scientific.net/AMM.705.360

Paper Titles

Analysis of Research Trends of Organic Solar Cell Using Patent Information
p.324

Research on the Application of Fuel Cell in the Electricity-Generating Industry
p.329

Fault Diagnosis of Wind Turbine's Converter Based on Memristive Neural Network
p.333

Speed Sensorless Control with ANN-MRAS Based on Modified ACO for Induction Motor Drives
p.341

Distributed Cross-Direction Control System Based on CAN-Bus
p.345

Design and Application of Hotel Intelligent Control System
p.350

A Novel Traction Control Strategy Based on Optimal Slip Ratio Control for Electric Vehicle
p.355

Consensus Problem of Multivehicle Formation Using Nearest Neighbor Rule with Addition of State Buffer
p.360

A Brief Description of ESP Working Principle and Common Control Methods
p.364

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 705Consensus Problem of Multivehicle Formation Using...

Consensus Problem of Multivehicle Formation Using Nearest Neighbor Rule with Addition of State Buffer

Abstract:

We consider the problem of cooperation among a collection of vehicles performing a shared task using intervehicle communication to coordinate their actions. Tools from algebraic graph theory prove useful in modeling the communication network and relating its topology to formation stability. We show that agents can reach consensus if the value of the function is time invariant and we prove our result by taking agents initial state values. The concept of state buffer is also introduced to avoid delays in achieving consensus.

You might also be interested in these eBooks

Machinery Electronics and Control Engineering IV

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 705)

Pages:

360-363

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.705.360

Citation:

Cite this paper

Online since:

December 2014

Authors:

Umm E Amin, Shu Li Guo, Li Na Han

Keywords:

Cooperative Control, Graph Theory, Laplacian, Statebuffer

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] A. Lynch, Distributed Algorithm. San Francisco, CA: Morgan Kaufmann, (1997).

Google Scholar

[2] R.O. Saber and R.M. Murray Consensus protocol for networks of dynamic agents, in Proc. 2003 Am. ControlConf, 2003 pp.951-956.

Google Scholar

[3] R. Olfati-Saber and R. M Murray: IEEE Trans. Autom. Control, vol. 49, no. 9, pp.1520-1533, Sep (2004).

Google Scholar

[4] J. A Fax, Optimal and cooperative control of vehicle formation, Ph. D dissertation, Control Dynamical Syst., Cali-fornia Inst. Technol., Pasadena CA, (2001).

Google Scholar

[5] J.A. Fax and R. M Murray: IEE Trans. Autom. Control, vol. 49, no 9, pp.1465-1476, Sep (2004).

Google Scholar

[6] M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Math.J., vol. 23, no. 98, pp.298-305, (1973).

DOI: 10.21136/cmj.1973.101168

Google Scholar

[7] W. Ren and R. Beard and E. M. Atkins, A Survey of Consensus Problems in Multi-Agent Coordination, Proc. Ofthe American Control Conference, 1859-1864, (2005).

DOI: 10.1109/acc.2005.1470239

Google Scholar

[8] L. Xiao, S. Boyd: Systems and Control Letters 53 (1) (2004) 6578.

Google Scholar