A Novel Robust Hierarchical Consensus Algorithm with Application in DC Nanogrids Coordination
This research investigates the delay sensitivity of discrete-time consensus among agents which communicate over a scale-free network with hubs. In this paper, a novel hierarchical consensus algorithm, based on the idea of virtual communication graph degree reduction, is proposed. As a result, a significant consensus speed gain is obtained which provides a potential time margin for applying cyber-physical techniques that cause systematic input delay. This approach provides robustness and resiliency in case of any communication topology disturbance during cyber- physical attacks or plug-and-play events. The feasibility of plug- and-play, which has the potential to increase the input delay, is presented based on the gained margin as a sample scenario. The algorithm application in the coordination of distributed photovoltaic resources of several nano-grids communicating over a scale-free network, is assessed via simulation as well.
Article Type:
Research/Original Article
International Journal Of Nonlinear Analysis And Applications, Volume:10 Issue:2, 2019
97 - 110
روش‌های دسترسی به متن این مطلب
اشتراک شخصی
در سایت عضو شوید و هزینه اشتراک یک‌ساله سایت به مبلغ 300,000ريال را پرداخت کنید. همزمان با برقراری دوره اشتراک بسته دانلود 100 مطلب نیز برای شما فعال خواهد شد!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی همه کاربران به متن مطالب خریداری نمایند!