Robustness of heterogeneous cyclic pursuit

Dwaipayan Mukherjee; Daniel Zelazo

Robustness of heterogeneous cyclic pursuit

Dwaipayan Mukherjee, Daniel Zelazo

Aerospace Engineering

Technion - Israel Institute of Technology

Research output: Contribution to conference › Paper › peer-review

Abstract

The present paper investigates the robustness of the directed cycle graph using the Nyquist criterion and derives the limit to which a single gain can be varied, while achieving positional consensus among the agents in heterogeneous cyclic pursuit framework. This work builds on similar robustness results for multi-agent systems connected by undirected graphs, in the literature. Simulations back up the theoretical results.

Original language	English
State	Published - 2016
Event	56th Israel Annual Conference on Aerospace Sciences, IACAS 2016 - Tel-Aviv and Haifa, Israel Duration: 9 Mar 2016 → 10 Mar 2016

Conference

Conference	56th Israel Annual Conference on Aerospace Sciences, IACAS 2016
Country/Territory	Israel
City	Tel-Aviv and Haifa
Period	9/03/16 → 10/03/16

All Science Journal Classification (ASJC) codes

Space and Planetary Science
Aerospace Engineering

Cite this

@conference{215cea39d255430a9fe8323ba4d78568,

title = "Robustness of heterogeneous cyclic pursuit",

abstract = "The present paper investigates the robustness of the directed cycle graph using the Nyquist criterion and derives the limit to which a single gain can be varied, while achieving positional consensus among the agents in heterogeneous cyclic pursuit framework. This work builds on similar robustness results for multi-agent systems connected by undirected graphs, in the literature. Simulations back up the theoretical results.",

author = "Dwaipayan Mukherjee and Daniel Zelazo",

note = "Publisher Copyright: {\textcopyright} 2016, Israel Annual Conference on Aerospace Sciences. All rights reserved.; 56th Israel Annual Conference on Aerospace Sciences, IACAS 2016 ; Conference date: 09-03-2016 Through 10-03-2016",

year = "2016",

language = "الإنجليزيّة",

}

TY - CONF

T1 - Robustness of heterogeneous cyclic pursuit

AU - Mukherjee, Dwaipayan

AU - Zelazo, Daniel

PY - 2016

Y1 - 2016

N2 - The present paper investigates the robustness of the directed cycle graph using the Nyquist criterion and derives the limit to which a single gain can be varied, while achieving positional consensus among the agents in heterogeneous cyclic pursuit framework. This work builds on similar robustness results for multi-agent systems connected by undirected graphs, in the literature. Simulations back up the theoretical results.

AB - The present paper investigates the robustness of the directed cycle graph using the Nyquist criterion and derives the limit to which a single gain can be varied, while achieving positional consensus among the agents in heterogeneous cyclic pursuit framework. This work builds on similar robustness results for multi-agent systems connected by undirected graphs, in the literature. Simulations back up the theoretical results.

UR - http://www.scopus.com/inward/record.url?scp=84983159795&partnerID=8YFLogxK

M3 - محاضرة

T2 - 56th Israel Annual Conference on Aerospace Sciences, IACAS 2016

Y2 - 9 March 2016 through 10 March 2016

ER -

Robustness of heterogeneous cyclic pursuit

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Cite this