In this paper, we address consensus seeking problem of dynamical agents on random sector graphs. Random sector graphs are directed geometric graphs and have been investigated extensively. Each agent randomly walks on these graphs and communicates with each other if and only if they coincide on a node at the same time. Extensive simulations are performed to show that global consensus can be reached.
Comments: 5 Pages. technical report in NUI, #551
[v1] 2012-07-06 10:56:56
Unique-IP document downloads: 100 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.