Optimized Performance of Consensus algorithm in Multi Agent System Using PSO
Keywords:Consensus algorithm, Graph theory, Multi-agent network system, Particle swarm optimization
This paper provides a theoretical framework for analysis of consensus algorithm for multi-agent networked systems considering the role of directed information flow. Improvement of the performance of the implemented consensus algorithm has been achieved by using Particle Swarm Optimization (PSO). Concepts of information consensus in networks and methods of convergence are applied as well. Our analysis framework is based on tools algebraic Graph Theory (GT). Simulation of multi-agent system and the performance of a consensus algorithm have been discussed. Acceleration the network while approaching the required goal has been accomplished and elimination of undesired swing that appears during the acceleration was proved.
How to Cite
- Each author retains the right to use the work for non-commercial purposes as well as for further research and spoken presentations.
- Each author retains the right to use the illustrations and research data in his/her future work.
- Only one offprint is provided free for each author. The authors can order offprints at the proof stage at certain rates depending on the number of additional copies required and the year of publication.
The publisher of the journal has full rights for publication of the submitted manuscripts, electronic and facsimile formats and for electronic capture, reproduction and licensing in all formats now and in perpetuity in the original and all derivative works.