Abstract-Network controllability is the ability to control the entire network, meaning that we can drive the network from any initial state to any desired final state in finite time by using appropriate inputs which are applied to a subset of nodes of the network. Despite obvious advantages, network controllability is not always feasible as it may ask for a considerable portion of the nodes to be controlled. Moreover, there are cases where controllability of the entire network is not of interest, but rather we are interested in controllability properties of certain parts of the network. This motivates us to investigate the so-called "targeted controllability" of the network, where controllability is only required for a subset of nodes in the network. Noting that targeted controllability can be treated as an output controllability problem, we investigate the (strong) structural output controllability properties of the network from a topological viewpoint. In addition, we examine the structural properties of the reachable subspace of the network. To this end, we use the notion of zero forcing sets, which has been recently exploited in the context of structural controllability.

The phenomenon of infinitely mode transitions in a finite time interval is called Zeno behavior in hybrid systems literature. It plays a critical role in the study of numerical methods and fundamental system and control theoretic properties of hybrid systems. This paper studies Zeno behavior for bimodal piecewise linear systems with possibly discontinuous dynamics. Our treatment is inspired by the work of Imura and Van der Schaft on the well-posedness of the same type of systems. The main contribution of the paper is two folded. Firstly, we show that ImuraVan der Schaft conditions for well-posedness guarantee that Filippov solutions have certain local properties. Secondly, we employ these in order to prove that bimodal piecewise linear systems do not exhibit Zeno behavior.

In this paper, we consider the problem of model reduction of consensus networks. We propose a new method of model reduction based on removing edges that close cycles in the network graph. The agent dynamics of the consensus network is given by a symmetric multivariable input-state-output system. In the network, the agents exchange relative output information with their neighbors. We assume that the network graph is connected, unweighted, and undirected. The network used to approximate the original system is defined on the same number of nodes as the original graph, but its edge set is a strict subset of the original edge set. Explicit expressions and upper bounds for the approximation errors are formulated in terms of the signed path vectors of the removed edges and the eigenvalues of the Laplacian matrices of the original and reduced network graphs.

Abstract-The term differential-algebraic inclusions (DAIs) not only describes the dynamical relations using set-valued mappings, but also includes the static algebraic inclusions, and this paper considers the problem of existence of solutions for a class of such dynamical systems described by the inclusionfor a symmetric positive semi-definite matrix P ∈ R n×n , and a maximal monotone operator M : R n ⇒ R n . The existence of solutions is proved using the tools from the theory of maximal monotone operators. The class of solutions that we study in the paper have the property that, instead of the whole state, only P x is absolutely continuous and unique. This framework, in particular, is useful for studying passive differential-algebraic equations (DAEs) coupled with maximal monotone relations. Certain class of irregular DAEs are also covered within the proposed general framework. Applications from electrical circuits are included to provide a practical motivation.

As networked dynamical systems appear around us at an increasing rate, questions concerning how to manage and control such systems are becoming more important. Examples include multi-agent robotics, distributed sensor networks, interconnected manufacturing chains, and data networks. In response to this growth, a significant body of work has emerged focusing on how to organize such networks in order to facilitate their control and make them amenable to human interactions. In this article, we summarize these activities by connecting the network topology, that is, the layout of the interconnections in the network, to the classic notion of controllability.In manufacturing, one of the technological bottlenecks can be found in the general assembly phase. This is the last stage of the manufacturing chain where the pieces, such as doors, locks, and cup-holders in automotive manufacturing, are assembled into a finished product. If a single worker could command and interact with a number of flexible, mobile manipulators in an effective manner, it is expected that this process could be improved significantly. Similarly,