Consensus icon indicating copy to clipboard operation
Consensus copied to clipboard

Implements consensus algorithms on fixed and time varying graphs

Consensus

Implements consensus algorithms on fixed and time varying graphs including a flocking based consensus algorithm (velocity matching) and a general flocking algorithm based on the framework in [3].

Examples

Checkout some examples in the notebook, plus some additional source files

Status

Travis
Build Status

To Do

Some movies showing the models in action

For [3]

alt

This next example shows fragmentation in as mentioned in the paper

alt text

For [2]

alt text

Obstical avoidance (arthur-yh)

Obsticals

Essay

Read here

Includes some discussion of the papers [1][2][3] and some simulation results+comments

References

For the theoretical results (and algorithms) used consult

[1] R. Olfati-Saber, J. A. Fax and R. M. Murray, "Consensus and Cooperation in Networked Multi-Agent Systems," in Proceedings of the IEEE, vol. 95, no. 1, pp. 215-233, Jan. 2007. doi: 10.1109/JPROC.2006.887293

[2] H. G. Tanner, A. Jadbabaie and G. J. Pappas, "Flocking in Fixed and Switching Networks," in IEEE Transactions on Automatic Control, vol. 52, no. 5, pp. 863-868, May 2007. doi: 10.1109/TAC.2007.895948

[3] R. Olfati-Saber, "Flocking for multi-agent dynamic systems: algorithms and theory," in IEEE Transactions on Automatic Control, vol. 51, no. 3, pp. 401-420, March 2006. doi: 10.1109/TAC.2005.864190