FZFederico M. Zegers

Federico M. Zegers

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Federico M. Zegers has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Timer-Based Coverage Control for Mobile Sensors

    by Federico M. Zegers, Sean Phillips, Gregory P. Hicks

    This work investigates the coverage control problem over a static, compact, and convex workspace and develops a hybrid extension of the continuous-time Lloyd algorithm. Each agent in a multi-agent system (MAS) is equipped with a timer mechanism that generates intermittent measurement and control update events, which may occur asynchronously between agents. Between consecutive event times, as determined by the corresponding timer mechanism, the controller of each agent is held constant. These controllers are shown to drive the configuration of the MAS into a neighborhood of the set of centroidal Voronoi configurations, i.e., the minimizers of the standard locational cost. The combination of continuous-time dynamics with intermittently updated control inputs is modeled as a hybrid system. The coverage objective is posed as a set attractivity problem for hybrid systems, where an invariance-based convergence analysis yields sufficient conditions that ensure maximal solutions of the hybrid system asymptotically converge to a desired set. A brief simulation example is included to showcase the result.


  • Event-Triggered Multiagent System Rendezvous With Graph Maintenance in Varied Hybrid Formulations: A Comparative Study

    by Federico M. Zegers, Dan P. Guralnik, Warren E. Dixon

    This paper explores the rendezvous problem for a multi-agent system (MAS) with distance-limited, intermittent communication and sensing. Unlike previous works that provide specific event-triggered controllers, we provide a framework that characterizes a family of distributed event-triggered controllers leveraging non-singular edge-potentials to achieve approximate rendezvous while maintaining the initial distance-limited graph. The proposed framework excludes the possibility of Zeno behavior and accommodates the development of self-triggered controllers. The combination of continuous and impulsive dynamics results in a hybrid system, where the closed-loop dynamics of the MAS are presented and analyzed using hybrid differential inclusions. In particular, three distinct hybrid system formulations are presented, where the advantages and disadvantages of each construction are discussed in terms of their solution spaces. The approximate rendezvous problem is recast into a set stabilization problem and sufficient conditions of the rendezvous set are obtained through a Lyapunov-based analysis. Simulation results are provided to validate the development, where a specific instance of an event trigger mechanism satisfying the requirements of the proposed design achieves approximate rendezvous while preserving the edges of an initially connected communication graph.


  • Plug-and-Play Cooperative Navigation: From Single-Agent Navigation Fields to Graph- Maintaining Distributed MAS Controllers

    by Dan P. Guralnik, Peter F. Stiller, Federico M. Zegers, Warren E. Dixon

    A class of closed-form distributed controllers achieving leader-following in a multi-agent system (MAS) with distance-limited communications in a compact obstructed environment is developed: given a user-provided navigation field for a single point agent as an input, the desired MAS PnP (“Plug-and-Play”) controller is obtained through a closed-form expression. In particular, cooperative navigation of an environment of arbitrary complexity is achievable whenever an adequate single-agent navigation solution is available. Sufficient conditions on the navigation field in relation to the communication radius are developed, guaranteeing that a prescribed initial graph of agents retains all of its edges while following a leader. In contrast with existing work, the standard radial symmetric interactions among agents are replaced with an asymmetrically rescaled version of the provided navigation field, removing the need for assumptions such as the sphericity or convexity of obstacles, and enabling the switching of the attractive interactions between neighbors on and off as needed. This approach elucidates the trade-offs between communication range, the size of the MAS, the control effort required for cooperation, and the complexity of navigating in the provided environment. The reliance of the approach on navigation fields enables the use of state-of-the-art sensing-based reactive navigation methods designed for settings with incomplete prior knowledge of the environment and based on a sphere-world model layer. For this reason, two case studies are provided—one of sphere worlds, and the other of topological sphere worlds with star-convex obstacles—comparing different variations of the PnP controller derived from state-of-the-art single-agent navigation fields.


  • Open Access

    Controller Synthesis for Multi-Agent Systems With Intermittent Communication and Metric Temporal Logic Specifications

    by Zhe Xu, Federico M. Zegers, Nasim Baharisangari, Bo Wu, Alexander J. Phillips, Warren E. Dixon, Ufuk Topcu

    This paper investigates the controller synthesis problem for a multi-agent system (MAS) with intermittent communication. We adopt a relay-explorer scheme, where a mobile relay agent with absolute position sensors switches among a set of explorers with relative position sensors to provide intermittent state information. We model the MAS as a switched system where the explorers’ dynamics can be either fully-actuated or under-actuated. The objective of the explorers is to reach approximate consensus to a predetermined goal region. To guarantee the uniform boundedness of the state estimation errors and the approximate consensus of the explorers, we derive maximum dwell-time conditions to constrain the length of time each explorer goes without state feedback (from the relay agent). Furthermore, the relay agent needs to satisfy practical constraints such as charging its battery and staying in specific regions of interest. Both the maximum dwell-time conditions and these practical constraints can be expressed by metric temporal logic (MTL) specifications. We iteratively compute the optimal control inputs for the relay agent to satisfy theMTL specifications, while guaranteeing the uniform boundedness of the state estimation errors and approximate consensus of the explorers. We implement the proposed method on a case study with the CoppeliaSim robot simulator.


  • A Switched Systems Approach to Multiagent System Consensus: A Relay–Explorer Perspective

    by Federico M. Zegers, Patryk Deptula, Hsi-Yuan Chen, Axton Isaly, Warren E. Dixon

    The rendezvous or position consensus problem is a fundamental topic within the multiagent system (MAS) literature and has numerous engineering applications. The majority of recent results that solve the position consensus problem rely on communication networks and each agent's ability to obtain position information via direct measurements and communication. Distributed coordination strategies for MASs that are network free and have agents that cannot directly measure position information are scarce. In this work, we develop a relay–explorer strategy to achieve position consensus at a common, desired location. In particular, a group of explorer agents, lacking global position sensors, use open-loop estimators of their position to independently dead reckon toward the desired location. To prevent the difference between the estimated and true position of each explorer from growing beyond a user-defined threshold, a mobile information service provider (relay agent) that is capable of measuring its position in the global coordinate frame, intermittently visits each explorer to provide position information as determined by a maximum dwell-time condition. The relay agent has a position estimator for each explorer, and each estimator is synchronized with the corresponding explorer. The relay agent uses these position estimators to locate each explorer, maneuver to them, and provide position feedback. The contribution of this work over our precursory results is the consideration of uncertain explorer agent dynamics, which are estimated online using recurrent neural networks and integral concurrent learning. The estimated dynamics serve as feed-forward model approximations in the position estimators used by the explorers and relay agent, which generate more accurate position estimates once a finite excitation condition is satisfied. The MAS is modeled as a switched system, and a Lyapunov-based analysis is used to derive a maximum dwell-time condition for each explorer, prove the MAS is exponentially regulated to the desired location, and show the error between the estimated and true explorer dynamics is uniformly ultimately bounded. Experiments and multiple simulation examples are provided to verify the theoretical development, explore the scalability and learning performance of the approach, and shed light on future extensions.


  • Distributed State Estimation With Deep Neural Networks for Uncertain Nonlinear Systems Under Event-Triggered Communication

    by Federico M. Zegers, Runhan Sun, Girish Chowdhary, Warren E. Dixon

    This work explores the distributed state estimation problem for an uncertain, nonlinear, and continuous-time system. Given a sensor network, each agent is assigned a deep neural network (DNN) that is used to approximate the system's dynamics. Each agent updates the weights of their DNN through a multiple timescale approach, i.e., the outer layer weights are updated online with a Lyapunov-based gradient descent update law, and the inner layer weights are updated concurrently using a supervised learning strategy. To promote the efficient use of network resources, the distributed observer uses event-triggered communication. A nonsmooth Lyapunov analysis demonstrates that the distributed event-triggered observer achieves uniformly ultimately bounded state reconstruction. A simulation example of a five-agent sensor network estimating the state of a two-link robotic manipulator tracking a desired trajectory is provided to validate the result and showcase the performance improvements afforded by DNNs.


  • Secure Control Design for Networked Control Systems With Nonlinear Dynamics Under Time-Delay-Switch Attacks

    by Arman Sargolzaei, Federico M. Zegers, Alireza Abbaspour, Carl D. Crane, Warren E. Dixon

    A continuous controller is developed for a centralized network control system (NCS) that is composed of agents with nonlinear dynamics subject to a Time-Delay-Switch (TDS) attack and additive disturbances. Since the state tracking error is unmeasurable during TDS attacks, controllers cannot use the state tracking error to coordinate the NCS. Therefore, a novel error signal is designed to address this unique challenge and enable the NCS to achieve a formation control objective. Furthermore, a TDS attack mitigation strategy is developed, which uses both learning and model-based approaches to estimate an agent's state for TDS attack detection and compensation. Lyapunov-Krasovskii (LK) functionals are used in the stability analysis to prove that the tracking errors converge to a steady-state residual, which is a function of the system uncertainty and TDS attack properties. The leader-follower formation control problem for Unmanned Aerial Vehicles (UAVs) based on a pure pursuit guidance law is selected for a simulation study to validate the performance of the proposed method.


  • A Hybrid Systems Approach to Dual-Objective Functional Electrical Stimulation Cycling

    by Saiedeh Akbari, Glen Merritt, Federico M. Zegers, Christian A. Cousin

    Motorized functional electrical stimulation (FES) cycling can serve as a physical rehabilitation strategy for individuals whose lower limbs are affected by neurological injuries. Motorized FES cycling is unique among human-robot interaction tasks because the cycle’s motor and rider’s leg muscles must be simultaneously controlled. In this paper, two tracking objectives are proposed for the combined cycle-rider system. First, the rider’s leg muscles are stimulated to pedal the cycle at a desired cadence, and second, the cycle’s motor is used to regulate the interaction torque between the cycle and rider using an admittance controller. A novel hybrid systems analysis using Lyapunov-and passivity-based techniques is conducted to prove that the cycle’s motor can globally exponentially regulate the admittance error system and prove that the cadence error system is output feedback passive. Experiments conducted on five participants illustrate the efficacy of the controllers with an average admittance error of -0.01±0.70 RPM at an average cadence of 45.51±1.77 RPM for a desired cadence of 50 RPM.


  • Consensus over Clustered Networks with Asynchronous Inter-Cluster Communication

    by Federico M. Zegers, Sean Phillips, Warren E. Dixon

    Within this work, the consensus problem for a clustered multi-agent system (C-MAS) is investigated. Given a multi-agent system (MAS), the agents are organized into disjoint clusters, where each cluster forms a connected network. The agents that are within the same cluster can communicate continuously with their neighbors. Between some cluster pairs, there exists an inter-cluster that enables the relay of information between the two clusters. Agents that have neighbors in clusters different from their own can communicate intermittently and asynchronously with their different-cluster neighbors. The goal of each agent in the C-MAS is to converge to an agreement value by sharing local information of a continuous-time homogeneous process. Note that the intermittent communication events of the continuous-time process are inherently hybrid. Therefore, a unique coupling between a static consensus protocol and a hybrid consensus protocol is designed. The closed-loop network model is presented using a hybrid systems framework. The consensus problem is then recast into a set stability problem and sufficient conditions of the consensus set are presented through leveraging a Lyapunov-based stability analysis. A C-MAS composed of 16 agents that is partitioned into 3 clusters and 2 inter-clusters is used to illustrate the results through numerical simulations and shown to achieve consensus using the proposed control strategy.