Michael Zavlanos

Journal Article IEEE Transactions on Automatic Control · May 1, 2019 This paper proposes a new optimal control synthesis algorithm for multirobot systems under global temporal logic tasks. Existing planning approaches under global temporal goals rely on graph search techniques applied to a product automaton constructed amon ... Full text Cite

Risk-averse access point selection in wireless communication networks

Journal Article IEEE Transactions on Control of Network Systems · March 1, 2019 This paper considers the problem of selecting the optimal set of access points and routing decisions in wireless communication networks. We consider networks that are subject to uncertainty in the wireless channel, for example, due to multipath fading effe ... Full text Cite

Distributed Hierarchical Control for State Estimation with Robotic Sensor Networks

Journal Article IEEE Transactions on Control of Network Systems · December 1, 2018 This paper addresses active state estimation with a team of robotic sensors. The states to be estimated are represented by spatially distributed, uncorrelated, stationary vectors. Given a prior belief on the geographic locations of the states, we cluster t ... Full text Cite

Probabilistic Motion Planning Under Temporal Tasks and Soft Constraints

Journal Article IEEE Transactions on Automatic Control · December 1, 2018 This paper studies motion planning of a mobile robot under uncertainty. The control objective is to synthesize a finite-memory control policy, such that a high-level task specified as a linear temporal logic formula is satisfied with a desired high probabi ... Full text Cite

Approximate projection methods for decentralized optimization with functional constraints

Journal Article IEEE Transactions on Automatic Control · October 1, 2018 We consider distributed convex optimization problems that involve a separable objective function and nontrivial functional constraints, such as linear matrix inequalities. We propose a decentralized and computationally inexpensive algorithm, which is based ... Full text Cite

Multirobot Data Gathering under Buffer Constraints and Intermittent Communication

Journal Article IEEE Transactions on Robotics · August 1, 2018 We consider a team of heterogeneous robots, which are deployed within a common workspace to gather different types of data. The robots have different roles due to different capabilities: some gather data from the workspace (source robots) and others receiv ... Full text Cite

Complexity Certification of a Distributed Augmented Lagrangian Method

Journal Article IEEE Transactions on Automatic Control · March 1, 2018 In this paper, we present complexity certification results for a distributed augmented Lagrangian (AL) algorithm used to solve convex optimization problems involving globally coupled linear constraints. Our method relies on the accelerated distributed AL ( ... Full text Cite

Distributed Active State Estimation with User-Specified Accuracy

Journal Article IEEE Transactions on Automatic Control · February 1, 2018 In this paper, we address the problem of controlling a network of mobile sensors so that a set of hidden states are estimated up to a user-specified accuracy. The sensors take measurements and fuse them online using an information consensus filter (ICF). A ... Full text Cite

Controlling a robotic stereo camera under image quantization noise

Journal Article International Journal of Robotics Research · October 1, 2017 In this paper, we address the problem of controlling a mobile stereo camera under image quantization noise. Assuming that a pair of images of a set of targets is available, the camera moves through a sequence of Next-Best-Views (NBVs), i.e. a sequence of v ... Full text Cite

Distributed network design for laplacian eigenvalue placement

Journal Article IEEE Transactions on Control of Network Systems · September 1, 2017 We propose a distributed iterative algorithm in which a group of n autonomous agents self-organize the structure of their communication network in order to control the network's Laplacian eigenvalue spectrum. We assume that every agent has only access to a ... Full text Cite

On the Convergence of a Distributed Augmented Lagrangian Method for Nonconvex Optimization

Journal Article IEEE Transactions on Automatic Control · September 1, 2017 In this paper, we propose a distributed algorithm for optimization problems that involve a separable, possibly nonconvex objective function subject to convex local constraints and linear coupling constraints. The method is based on the accelerated distribu ... Full text Cite

Distributed data gathering with buffer constraints and intermittent communication

Conference Proceedings - IEEE International Conference on Robotics and Automation · July 21, 2017 We consider a team of multiple dynamical and heterogeneous robots which are deployed for gathering different types of data within a common workspace. The robots have different roles due to different capabilities: some gather data from the workspace (Type-A ... Full text Cite

Distributed Intermittent Connectivity Control of Mobile Robot Networks

Journal Article IEEE Transactions on Automatic Control · July 1, 2017 In this paper we develop an intermittent communication framework for teams of mobile robots. Robots move along the edges of a mobility graph and communicate only when they meet at the vertices of this graph, giving rise to a dynamic communication network. ... Full text Cite

Risk-averse sensor planning using distributed policy gradient

Conference Proceedings of the American Control Conference · June 29, 2017 This paper considers a risk-averse approach to planning the motion of mobile sensor networks in order to maximize the information they collect in uncertain environments. Recent models of risk shape the tails of the probability distributions of the decision ... Full text Cite

Stochastic model-based source identification

Conference 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017 · June 28, 2017 In this paper we investigate the use of Stochastic Reduced Order Models (SROMs) for solving Stochastic Source Identification (SSI) problems in steady-state transport phenomena given statistics of the system state at a small number of locations. We capture ... Full text Cite

A distributed augmented Lagrangian method for model predictive control

Conference 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017 · June 28, 2017 In this paper we present a distributed Augmented Lagrangian (AL) algorithm to solve model predictive control (MPC) problems that involve a finite number of subsystems which interact with each other via a general network. We focus on discrete-time control s ... Full text Cite

Temporal task planning in wirelessly connected environments with unknown channel quality

Conference 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017 · June 28, 2017 We consider a mobile robot tasked with gathering data in an environment of interest and transmitting these data to a data center. The task is specified as a high-level Linear Temporal Logic (LTL) formula that captures the data to be gathered at various reg ... Full text Cite

Sampling-based control synthesis for multi-robot systems under global temporal specifications

Conference Proceedings - 2017 ACM/IEEE 8th International Conference on Cyber-Physical Systems, ICCPS 2017 (part of CPS Week) · April 18, 2017 This paper proposes a sampling-based algorithm for multi-robot control synthesis under global Linear Temporal Logic (LTL) formulas. Robot mobility is captured by transition systems whose states represent regions in the environment that satisfy atomic propo ... Full text Cite

Distributed estimation and control for robotic sensor networks

Conference 2016 IEEE 55th Conference on Decision and Control, CDC 2016 · December 27, 2016 In this paper, we address the problem of controlling a network of mobile sensors to estimate a collection of hidden states to a user-specified accuracy. The mobile sensors simultaneously take measurements of the hidden states, fuse them in a distributed fi ... Full text Cite

Approximate projections for decentralized optimization with SDP constraints

Conference 2016 IEEE 55th Conference on Decision and Control, CDC 2016 · December 27, 2016 We consider distributed convex optimization problems that involve a separable objective function and nontrivial convex local constraints, such as Linear Matrix Inequalities (LMIs). We propose a decentralized, computationally inexpensive algorithm to solve ... Full text Cite

Simultaneous intermittent communication control and path optimization in networks of mobile robots

Conference 2016 IEEE 55th Conference on Decision and Control, CDC 2016 · December 27, 2016 In this paper, we propose an intermittent communication framework for mobile robot networks. Specifically, we consider robots that move along the edges of a connected mobility graph and communicate only when they meet at the nodes of that graph giving rise ... Full text Cite

Distributed continuous-time online optimization using saddle-point methods

Conference 2016 IEEE 55th Conference on Decision and Control, CDC 2016 · December 27, 2016 This paper introduces saddle-point methods for distributed continuous-time online convex optimization, where the system objective function varies arbitrarily over time subject to some global inequality constraints. The overall dynamics of the proposed sadd ... Full text Cite

Distributed scheduling of network connectivity using mobile access point robots

Journal Article IEEE Transactions on Robotics · December 1, 2016 In this paper, we consider scenarios where mobility can be exploited to enable reliable communications in wireless networks with scarce resources that are unable to concurrently service their nodes. Specifically, we consider cases where a team of robots op ... Full text Cite

Distributed Formation Stabilization Using Relative Position Measurements in Local Coordinates

Journal Article IEEE Transactions on Automatic Control · December 1, 2016 In this paper, we present a novel distributed method to stabilize a set of agents moving in a two dimensional environment to a desired rigid formation. In our approach, each agent computes its control input using the relative positions of a set of formatio ... Full text Cite

A Distributed Algorithm for Convex Constrained Optimization under Noise

Journal Article IEEE Transactions on Automatic Control · September 1, 2016 We present a novel distributed algorithm for convex constrained optimization problems that are subject to noise corruption and uncertainties. The proposed scheme can be classified as a distributed stochastic approximation method, where a unique feature her ... Full text Cite

Global Planning for Multi-Robot Communication Networks in Complex Environments

Journal Article IEEE Transactions on Robotics · August 17, 2016 © 2004-2012 IEEE. In this paper, we consider networks of mobile robots responsible for servicing a collection of tasks in complex environments, while ensuring end-to-end connectivity with a fixed infrastructure of access points. Tasks are associated with s ... Full text Cite

Distributed primal-dual methods for online constrained optimization

Conference Proceedings of the American Control Conference · July 28, 2016 This paper introduces a decentralized primal-dual method for online distributed optimization involving global constraints. We employ a consensus-based framework and exploit the decomposability of the constraints in dual domain. At each stage, each agent co ... Full text Cite

Nonlinear reduced order source identification

Conference Proceedings of the American Control Conference · July 28, 2016 In this paper we propose a novel approach to the problem of model-based source identification in steady-state transport phenomena given a set of noisy measurements. We formulate the problem as an optimization problem in function space and utilize the adjoi ... Full text Cite

A distributed LTL-based approach for intermittent communication in mobile robot networks

Conference Proceedings of the American Control Conference · July 28, 2016 In this paper we develop an intermittent communication framework for mobile robot networks. Intermittent communication provides significantly more flexibility to the robots to accomplish their tasks compared to approaches that enforce communication constra ... Full text Cite

Intermittent connectivity control in mobile robot networks

Conference Conference Record - Asilomar Conference on Signals, Systems and Computers · February 26, 2016 In this paper, we consider networks of mobile robots responsible for accomplishing tasks, captured by Linear Temporal Logic (LTL) formulas, while ensuring communication with all other robots in the network. The robots operate in complex environments repres ... Full text Cite

Distributed communication-aware coverage control by mobile sensor networks

Journal Article Automatica · January 1, 2016 The purpose of this paper is to propose a distributed control scheme to maximize area coverage by a mobile robot network while ensuring reliable communication between the members of the team. The information that is generated at the sensors depends on the ... Full text Cite

Exact bias correction and covariance estimation for stereo vision

Conference Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition · October 14, 2015 We present an approach for correcting the bias in 3D reconstruction of points imaged by a calibrated stereo rig. Our analysis is based on the observation that, due to quantization error, a 3D point reconstructed by triangulation essentially represents an e ... Full text Cite

An augmented Lagrangian method for distributed optimization

Journal Article Mathematical Programming · August 24, 2015 We propose a novel distributed method for convex optimization problems with a certain separability structure. The method is based on the augmented Lagrangian framework. We analyze its convergence and provide an application to two network models, as well as ... Full text Cite

Model-based sparse source identification

Conference Proceedings of the American Control Conference · July 28, 2015 This paper presents a model-based approach for source identification using sparse recovery techniques. In particular, given an arbitrary domain that contains a set of unknown sources and a set of stationary sensors that can measure a quantity generated by ... Full text Cite

Optimal path planning and resource allocation for active target localization

Conference Proceedings of the American Control Conference · July 28, 2015 This paper addresses optimal path planning and resource allocation for active multi-target localization. For each target, we solve a local Dynamic Program (DP) that plans optimal trajectories in the joint state-space of robot positions and target location ... Full text Cite

On the convergence rate of a Distributed Augmented Lagrangian optimization algorithm

Conference Proceedings of the American Control Conference · July 28, 2015 We consider the Accelerated Distributed Augmented Lagrangians (ADAL) algorithm, a distributed optimization algorithm that was recently developed by the authors to address problems that involve multiple agents optimizing a separable convex objective functio ... Full text Cite

Coordinate-free formation stabilization based on relative position measurements

Journal Article Automatica · July 1, 2015 This paper presents a method to stabilize a group of agents moving in a two-dimensional space to a desired rigid geometric configuration. A common approach is to use information of relative interagent position vectors to carry out this specific control tas ... Full text Cite

Distributed cooperative beamforming in multi-source multi-destination clustered systems

Journal Article IEEE Transactions on Signal Processing · December 1, 2014 We consider the scenario of a multi-cluster network, in which each cluster contains multiple single-antenna source destination pairs that communicate simultaneously over the same channel. The communications are supported by cooperating amplify-and-forward ... Full text Cite

Three-dimensional multirobot formation control for target enclosing

Conference IEEE International Conference on Intelligent Robots and Systems · October 31, 2014 This paper presents a novel method that enables a team of aerial robots to enclose a target in 3D space by attaining a desired geometric formation around it. We propose an approach in which each robot obtains its motion commands using measurements of the r ... Full text Cite

Towards mobile microrobot swarms for additive micromanufacturing

Journal Article International Journal of Advanced Robotic Systems · September 19, 2014 In this paper, a novel approach to achieving the independent control of multiple magnetic microrobots is presented. The approach utilizes a specialized substrate consisting of a fine grid of planar, MEMS-fabricated micro coils of the same size as the micro ... Full text Cite

Distributed simultaneous coverage and communication control by mobile sensor networks

Conference 2014 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2014 · February 5, 2014 The purpose of this paper is to propose a distributed control scheme to maximize area coverage by a mobile robot network while ensuring reliable communication between the members of the team. The information that is generated at the sensors depends on the ... Full text Cite

Controlling the relative agent motion in multi-agent formation stabilization

Journal Article IEEE Transactions on Automatic Control · January 1, 2014 In this technical note, we propose a novel technique to control the relative motion of multiple mobile agents as they stabilize to a desired configuration. In particular, we focus on the agents' relative velocities and the rate of change of their pairwise ... Full text Cite

Communication-aware coverage control for robotic sensor networks

Conference Proceedings of the IEEE Conference on Decision and Control · January 1, 2014 The purpose of this paper is to propose a control scheme to maximize area coverage and at the same time ensure reliable communication in networks of mobile robot sensors. The information that is generated at the sensors depends on the sensing capabilities ... Full text Cite

Distributed stochastic multicommodity flow optimization

Journal Article 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings · December 1, 2013 In this paper we are concerned with a class of stochastic multicommodity network flow problems, the so called capacity expansion planning problems. We consider a two-stage stochastic optimization formulation that incorporates uncertainty in the problem par ... Full text Cite

A hybrid control approach to the Next-Best-View problem using stereo vision

Journal Article Proceedings - IEEE International Conference on Robotics and Automation · November 14, 2013 In this paper, we consider the problem of precisely localizing a group of stationary targets using a single stereo camera mounted on a mobile robot. In particular, assuming that at least one pair of stereo images of the targets is available, we seek to det ... Full text Cite

Mobile jammers for secrecy rate maximization in cooperative networks

Journal Article ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings · October 18, 2013 We consider a source (Alice) trying to communicate with a destination (Bob), in a way that an unauthorized node (Eve) cannot infer, based on her observations, the information that is being transmitted. The communication is assisted by multiple multi-antenn ... Full text Cite

Network integrity in mobile robotic networks

Journal Article IEEE Transactions on Automatic Control · January 7, 2013 Most coordinated tasks performed by teams of mobile robots require reliable communications between team members. Therefore, task accomplishment requires that robots navigate their environment with their collective movement restricted to formations that gua ... Full text Cite

Hybrid control for mobile target localization with stereo vision

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2013 In this paper, we control image collection for a mobile stereo camera that is actively localizing a group of mobile targets. In particular, assuming that at least one pair of stereo images of the targets is available, we propose a novel approach to control ... Full text Cite

A distributed algorithm for cooperative relay beamforming

Journal Article Proceedings of the American Control Conference · January 1, 2013 We consider the problem of cooperative beamforming in relay networks. Assuming knowledge of the second-order statistics of channel state information (CSI), the optimal beamforming weights are determined so that the total transmitted power at the relays is ... Full text Cite

Controlling groups of mobile beamformers

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2012 In this paper, we address the problem of controlling networks of wireless mobile nodes to propagate information over large distances, while minimizing power consumption and maintaining desired Quality of Service (QoS) guarantees. For this, we rely on colla ... Full text Cite

Approximate augmented lagrangians for distributed network optimization

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2012 In this paper, we propose a distributed algorithm for optimal routing in wireless multi-hop networks. We build our approach on a recently proposed model for stochastic routing, whereby each node selects a neighbor to forward a packet according to a given p ... Full text Cite

A framework for integrating mobility and routing in mobile communication networks

Journal Article Conference Record - Asilomar Conference on Signals, Systems and Computers · December 1, 2011 Most coordinated tasks performed by teams of mobile robots, require reliable communications between the members of the team. Therefore, task accomplishment requires that robots navigate their environment with their collective movement restricted to formati ... Full text Cite

Distributed control of mobility & routing in networks of robots

Journal Article IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC · September 16, 2011 Most coordinated tasks performed by teams of mobile robots, require reliable communications between the members of the team. Therefore, task accomplishment requires that robots navigate their environment with their collective movement restricted to formati ... Full text Cite

Inferring stable genetic networks from steady-state data

Journal Article Automatica · June 1, 2011 Gene regulatory networks capture the interactions between genes and other cell substances, resulting from the fundamental biological process of transcription and translation. In some applications, the topology of the regulatory network is not known, and ha ... Full text Cite

Graph-theoretic connectivity control of mobile robot networks

Journal Article Proceedings of the IEEE · January 1, 2011 In this paper, we provide a theoretical framework for controlling graph connectivity in mobile robot networks. We discuss proximity-based communication models composed of disk-based or uniformly-fading-signal-strength communication links. A graph-theoretic ... Full text Cite

Robust flux balance analysis of metabolic networks

Journal Article Proceedings of the American Control Conference · January 1, 2011 Metabolic networks describe the set of biochemical reactions and regulatory interactions of metabolism that govern the phenotypical properties of a cell. Analysis of such networks is critical not only to promote biological knowledge, but also in drug disco ... Full text Cite

Spectral control of mobile robot networks

Journal Article Proceedings of the American Control Conference · January 1, 2011 The eigenvalue spectrum of the adjacency matrix of a network is closely related to the behavior of many dynamical processes run over the network. In the field of robotics, this spectrum has important implications in many problems that require some form of ... Full text Cite

Mobility & routing control in networks of robots

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2010 Most coordinated tasks performed by teams of mobile robots, require reliable communications between the members of the team. Therefore, task accomplishment requires that robots navigate their environment with their collective movement restricted to formati ... Full text Cite

Distributed control of the Laplacian spectral moments of a network

Journal Article Proceedings of the 2010 American Control Conference, ACC 2010 · January 1, 2010 It is well-known that the eigenvalue spectrum of the Laplacian matrix of a network contains valuable information about the network structure and the behavior of many dynamical processes run on it. In this paper, we propose a fully decentralized algorithm t ... Full text Cite

Synchronous rendezvous of very-low-range wireless agents

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2010 In this paper, we address the problem of temporal synchronization of a team of mobile agents on a set of rendezvous points defined by the nodes of a bipartite network. In particular, we assume very-low-range (VLR) wireless agents that travel along the edge ... Full text Cite

Hybrid control for connectivity preserving flocking

Journal Article IEEE Transactions on Automatic Control · December 1, 2009 In this technical note, we address the combined problem of motion and network topology control in a group of mobile agents with common objective the flocking behavior of the group. Instead of assuming network connectivity, we enforce it by means ofdistribu ... Full text Cite

Maintaining Connectivity in Mobile Robot Networks

Journal Article Springer Tracts in Advanced Robotics · December 1, 2009 While there has been significant progress in recent years in the study of estimation and control of dynamic network graphs, limited attention has been paid to the experimental validation and verification of such algorithms on distributed teams of robots. I ... Full text Cite

A distributed dynamical scheme for fastest mixing markov chains

Journal Article Proceedings of the American Control Conference · November 23, 2009 This paper introduces the problem of determining through distributed consensus the fastest mixing Markov chain with a desired sparsity pattern. In contrast to the centralized optimization-based problem formulation, we develop a novel distributed relaxation ... Full text Cite

Genetic network identification using convex programming.

Journal Article IET systems biology · May 2009 Gene regulatory networks capture interactions between genes and other cell substances, resulting in various models for the fundamental biological process of transcription and translation. The expression levels of the genes are typically measured as mRNA co ... Full text Cite

Resource allocation for signal detection with active sensors

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2009 We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switch between different sites. Since the quality of detection depends on the time th ... Full text Cite

Distributed connectivity control of mobile networks

Journal Article IEEE Transactions on Robotics · December 10, 2008 Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile sensor networks and multiagent systems, a great new challenge is the development ... Full text Cite

A dynamical systems approach to weighted graph matching

Journal Article Automatica · October 9, 2008 Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal graph matching problem for weighted graphs, which is computationally challe ... Full text Cite

Distributed topology control of dynamic networks

Journal Article Proceedings of the American Control Conference · September 30, 2008 In this paper, we present a distributed control framework for controlling the topology of dynamic multi-agent networks. Agents are equipped with local sensing and wireless communication capabilities, however, due to power constraints, they are required to ... Full text Cite

Identification of stable genetic networks using convex programming

Journal Article Proceedings of the American Control Conference · September 30, 2008 Gene regulatory networks capture interactions between genes and other cell substances, resulting in various models for the fundamental biological process of transcription and translation. The expression levels of the genes are typically measured in mRNA co ... Full text Cite

Distributed multi-robot task assignment and formation control

Journal Article Proceedings - IEEE International Conference on Robotics and Automation · September 18, 2008 Distributed task assignment for multiple agents raises fundamental and novel problems in control theory and robotics. A new challenge is the development of distributed algorithms that dynamically assign tasks to multiple agents, not relying on a priori ass ... Full text Cite

Dynamic assignment in distributed motion planning with local coordination

Journal Article IEEE Transactions on Robotics · February 1, 2008 Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile sensor networks or multiple target tracking, a great new challenge is the develop ... Full text Cite

A distributed auction algorithm for the assignment problem

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2008 The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the areas of distributed control and facility allocation, where the problems' size and ... Full text Cite

Dynamic assignment in distributed motion planning with limited information

Journal Article Proceedings of the American Control Conference · December 1, 2007 Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In this paper, we consider the problem of designing distributed motion algorithms that dynamically assign targets or destinations to multip ... Full text Cite

Sensor-based dynamic assignment in distributed motion planning

Journal Article Proceedings - IEEE International Conference on Robotics and Automation · November 27, 2007 Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. Recently, one such great challenge has been the development of motion planning algorithms that dynamically assign targets or destinations t ... Full text Cite

Potential fields for maintaining connectivity of mobile networks

Journal Article IEEE Transactions on Robotics · August 1, 2007 The control of mobile networks of multiple agents raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In this paper, we consider the problem of controlling a network of agents so that the resulting motion alw ... Full text Cite

Distributed formation control with permutation symmetries

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2007 In distributed control applications such as coverage or consensus by multiple mobile agents, a great new challenge is the development of motion algorithms that dynamically determine the positions of the agents in the formation using only local information. ... Full text Cite

Distributed connectivity control of mobile networks

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2007 Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile sensor networks and multi-agent systems, a great new challenge is the development ... Full text Cite

Flocking while preserving network connectivity

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2007 Coordinated motion of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as consensus seeking or flocking by a group of mobile agents, a great new challenge is the development of robust ... Full text Cite

Distributed hybrid control for multiple-pursuer multiple-evader games

Journal Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) · January 1, 2007 Multiple-pursuer multiple-evader games raise fundamental and novel problems in control theory and robotics. In this paper, we propose a distributed solution to this problem that simultaneously addresses the discrete assignment of pursuers to evaders as wel ... Full text Cite

A feedback stabilization and collision avoidance scheme for multiple independent non-point agents

Journal Article Automatica · February 1, 2006 A navigation functions' based methodology, established in our previous work for centralized multiple robot navigation, is extended to address the problem of decentralized navigation. In contrast to the centralized case, each agent plans its actions without ... Full text Cite

A dynamical systems approach to weighted graph matching

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2006 Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal graph matching problem for weighted graphs, which is computationally challe ... Full text Cite

Controlling connectivity of dynamic graphs

Journal Article Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05 · December 1, 2005 The control of mobile networks of multiple agents raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In this paper, we consider the problem of controlling a network of agents so that the resulting motion alw ... Full text Cite

Decentralized Motion Control of Multiple Holonomic Agents under Input Constraints

Journal Article Proceedings of the IEEE Conference on Decision and Control · January 1, 2003 The navigation function methodology, established in previous work for centralized multiple robot navigation, is extended for decentralized navigation with input constraints. In contrast to the centralized case, each agent plans its actions without knowing ... Full text Cite