activity
20122019
most citedGraph Distances and Controllability of Networks

69 citations · 171 across the 7 of their papers we have counts for

collaborators
Showing eess.SYShow all

7 papers · 1 filter

eess.SY2019

Computation of the Distance-based Bound on Strong Structural Controllability in Networks

Mudassir Shabbir, Waseem Abbas, A. Yasin Yazicioglu +1

In this paper, we study the problem of computing a tight lower bound on the dimension of the strong structurally controllable subspace (SSCS) in networks with Laplacian dynamics. T…

eess.SY2016

Resilient Operation of Transportation Networks via Variable Speed Limits

A. Yasin Yazicioglu, Mardavij Roozbehani, Munther A. Dahleh

In this paper, we investigate the use of variable speed limits for resilient operation of transportation networks, which are modeled as dynamical flow networks under local routing…

eess.SY2016★ 69 cited

Graph Distances and Controllability of Networks

A. Yasin Yazicioglu, Waseem Abbas, Magnus Egerstedt

In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external co…

eess.SY2016

Resilience of Locally Routed Network Flows: More Capacity is Not Always Better

A. Yasin Yazicioglu, Mardavij Roozbehani, Munther A. Dahleh

In this paper, we are concerned with the resilience of locally routed network flows with finite link capacities. In this setting, an external inflow is injected to the so-called or…

eess.SY2015★ 24 cited

Communication-Free Distributed Coverage for Networked Systems

A. Yasin Yazicioglu, Magnus Egerstedt, Jeff S. Shamma

In this paper, we present a communication-free algorithm for distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network i…

eess.SY2013★ 12 cited

A Message Passing Strategy for Decentralized Connectivity Maintenance in Agent Removal

Derya Aksaray, A. Yasin Yazicioglu, Eric Feron +1

In a multi-agent system, agents coordinate to achieve global tasks through local communications. Coordination usually requires sufficient information flow, which is usually depicte…

eess.SY2012★ 22 cited

A Tight Lower Bound on the Controllability of Networks with Multiple Leaders

Ahmet Yasin Yazicioglu, Waseem Abbas, Magnus Egerstedt

In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentra…