Logan E. Beaver
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
Logan E. Beaver has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Andreas A. Malikopoulos
School of Civil and Environmental Engineering, Cornell University, Ithaca, NY, USA
16 shared publications Andreas A. Malikopoulos
University of Delaware,Department of Mechanical Engineering,Newark,DE,USA,19716
2 shared publicationsCalin Belta
Department of Electrical and Computer Engineering University of Maryland College Park Maryland USA
2 shared publications- Christopher Kroninger
Combat Capabilities Development Command, Army Research Laboratory, Adelphi, MD, USA
2 shared publications Filippos N. Tzortzoglou
2 shared publications- Max Sokolich
Department of Mechanical Engineering University of Delaware Newark Delaware USA
2 shared publications
Latest Publications
- Open Access
- 21 October 2026
- Published by Wiley in Advanced Robotics Research
Model Predictive Control for Magnetically Actuated Cellbots
This article presents a control strategy for, which are magnetically actuated, micron‐scale robots embedded into living cells. Our approach combines model predictive control, which provides low computational complexity and adaptability to changing environments, with Gaussian Processes (GPs), which are used as disturbance estimators for precise path tracking. To address the challenges posed by unmodeled dynamics, we integrate data‐driven modeling with model‐based control to accurately track desired trajectories using relatively small data. To the best of our knowledge, this is the first work to integrate data‐driven modeling with model‐based control for magnetically actuated cellbots. The GP effectively learns and predicts unmodeled disturbances, providing uncertainty bounds as well. The experimental results show that our controllers perform very well, even in environments cluttered with cells.
- 21 October 2026
- Published by Wiley in Advanced Robotics Research
Open AccessModel Predictive Control for Magnetically Actuated Cellbots
This article presents a control strategy for, which are magnetically actuated, micron‐scale robots embedded into living cells. Our approach combines model predictive control, which provides low computational complexity and adaptability to changing environments, with Gaussian Processes (GPs), which are used as disturbance estimators for precise path tracking. To address the challenges posed by unmodeled dynamics, we integrate data‐driven modeling with model‐based control to accurately track desired trajectories using relatively small data. To the best of our knowledge, this is the first work to integrate data‐driven modeling with model‐based control for magnetically actuated cellbots. The GP effectively learns and predicts unmodeled disturbances, providing uncertainty bounds as well. The experimental results show that our controllers perform very well, even in environments cluttered with cells.
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2795-2800
Trajectory Tracking With Reachability-Guided Quadratic Programming and Freeze-Resume
Many robotic systems must follow planned paths yet pause safely and resume when people or objects intervene. We present an output–space method for systems whose tracked output can be feedback-linearized to a double integrator (e.g., manipulators). The approach has two parts. Offline, we perform a pre-run reachability check to verify that the motion plan respects speed and acceleration magnitude limits. Online, we apply a quadratic program to track the motion plan under the same limits. We use a one-step reachability test to bound the maximum disturbance the system is capable of rejecting. When the state coincides with the reference path we recover perfect tracking in the deterministic case, and we correct errors using a KKT-inspired weight. We demonstrate that safety stops and unplanned deviations are handled efficiently, and the system returns to the motion plan without replanning. We demonstrate our system’s improved performance over pure pursuit in simulation.
- 10 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2795-2800
Trajectory Tracking With Reachability-Guided Quadratic Programming and Freeze-Resume
Many robotic systems must follow planned paths yet pause safely and resume when people or objects intervene. We present an output–space method for systems whose tracked output can be feedback-linearized to a double integrator (e.g., manipulators). The approach has two parts. Offline, we perform a pre-run reachability check to verify that the motion plan respects speed and acceleration magnitude limits. Online, we apply a quadratic program to track the motion plan under the same limits. We use a one-step reachability test to bound the maximum disturbance the system is capable of rejecting. When the state coincides with the reference path we recover perfect tracking in the deterministic case, and we correct errors using a KKT-inspired weight. We demonstrate that safety stops and unplanned deviations are handled efficiently, and the system returns to the motion plan without replanning. We demonstrate our system’s improved performance over pure pursuit in simulation.
- Open Access
Trajectory Tracking with Reachability-Guided Quadratic Programming and Freeze-Resume
Many robotic systems must follow planned paths yet pause safely and resume when people or objects intervene. We present an output-space method for systems whose tracked output can be feedback-linearized to a double integrator (e.g., manipulators). The approach has two parts. Offline, we perform a pre-run reachability check to verify that the motion plan respects speed and acceleration magnitude limits. Online, we apply a quadratic program to track the motion plan under the same limits. We use a one-step reachability test to bound the maximum disturbance the system is capable of rejecting. When the state coincides with the reference path we recover perfect tracking in the deterministic case, and we correct errors using a KKT-inspired weight. We demonstrate that safety stops and unplanned deviations are handled efficiently, and the system returns to the motion plan without replanning. We demonstrate our system's improved performance over pure pursuit in simulation.
Open AccessTrajectory Tracking with Reachability-Guided Quadratic Programming and Freeze-Resume
Many robotic systems must follow planned paths yet pause safely and resume when people or objects intervene. We present an output-space method for systems whose tracked output can be feedback-linearized to a double integrator (e.g., manipulators). The approach has two parts. Offline, we perform a pre-run reachability check to verify that the motion plan respects speed and acceleration magnitude limits. Online, we apply a quadratic program to track the motion plan under the same limits. We use a one-step reachability test to bound the maximum disturbance the system is capable of rejecting. When the state coincides with the reference path we recover perfect tracking in the deterministic case, and we correct errors using a KKT-inspired weight. We demonstrate that safety stops and unplanned deviations are handled efficiently, and the system returns to the motion plan without replanning. We demonstrate our system's improved performance over pure pursuit in simulation.
- 15 July 2025
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 362 (12)
Flatness-based finite-horizon multi-UAV formation trajectory planning and directionally aware collision avoidance tracking
- 15 July 2025
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 362 (12)
Flatness-based finite-horizon multi-UAV formation trajectory planning and directionally aware collision avoidance tracking
- Open Access
Mixed Traffic: A Perspective from Long Duration Autonomy
The rapid adoption of autonomous vehicle has established mixed traffic environments, comprising both autonomous and human-driven vehicles (HDVs), as essential components of next-generation mobility systems. Along these lines, connectivity between autonomous vehicles and infrastructure (V2I) is also a significant factor that can effectively support higher-level decision-making. At the same time, the integration of V2I within mixed traffic environments remains a timely and challenging problem. In this paper, we present a long-duration autonomy controller for connected and automated vehicles (CAVs) operating in such environments, with a focus on intersections where right turns on red are permitted. We begin by deriving the optimal control policy for CAVs under free-flow traffic. Next, we analyze crossing time constraints imposed by smart traffic lights and map these constraints to controller bounds using Control Barrier Functions (CBFs), with the aim to drive a CAV to cross the intersection on time. We also introduce criteria for identifying, in real-time, feasible crossing intervals for each CAV. To ensure safety for the CAVs, we present model-agnostic safety guarantees, and demonstrate their compatibility with both CAVs and HDVs. Ultimately, the final control actions are enforced through a combination of CBF constraints, constraining CAVs to traverse the intersection within the designated time intervals while respecting other vehicles. Finally, we guarantee that our control policy yields always a feasible solution and validate the proposed approach through extensive simulations in MATLAB.
Open AccessMixed Traffic: A Perspective from Long Duration Autonomy
The rapid adoption of autonomous vehicle has established mixed traffic environments, comprising both autonomous and human-driven vehicles (HDVs), as essential components of next-generation mobility systems. Along these lines, connectivity between autonomous vehicles and infrastructure (V2I) is also a significant factor that can effectively support higher-level decision-making. At the same time, the integration of V2I within mixed traffic environments remains a timely and challenging problem. In this paper, we present a long-duration autonomy controller for connected and automated vehicles (CAVs) operating in such environments, with a focus on intersections where right turns on red are permitted. We begin by deriving the optimal control policy for CAVs under free-flow traffic. Next, we analyze crossing time constraints imposed by smart traffic lights and map these constraints to controller bounds using Control Barrier Functions (CBFs), with the aim to drive a CAV to cross the intersection on time. We also introduce criteria for identifying, in real-time, feasible crossing intervals for each CAV. To ensure safety for the CAVs, we present model-agnostic safety guarantees, and demonstrate their compatibility with both CAVs and HDVs. Ultimately, the final control actions are enforced through a combination of CBF constraints, constraining CAVs to traverse the intersection within the designated time intervals while respecting other vehicles. Finally, we guarantee that our control policy yields always a feasible solution and validate the proposed approach through extensive simulations in MATLAB.
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (13) , 13597-13604
Multi-Robot Task Allocation Using Global Games with Negative Feedback: The Colony Maintenance Problem
In this article we address the multi-robot task allocation problem, where robots must cooperatively assign themselves to accomplish a set of tasks in their environment. We consider the colony maintenance problem as an example, where a team of robots are tasked with continuously maintaining the energy supply of a central colony. We model this as a global game, where each robot measures the energy level of the colony, and the current number of assigned robots, to determine whether or not to forage for energy sources. The key to our approach is introducing a negative feedback term into the robots' utility, which also eliminates the trivial solution where foraging or not foraging are strictly dominant strategies. We compare our approach qualitatively to existing global games, where a positive positive feedback term admits threshold-based decision making, and encourages many robots to forage simultaneously. We show how positive feedback can lead to a cascading failure in the presence of a human who recruits robots, and we demonstrate the resilience of our approach in simulation.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (13) , 13597-13604
Open AccessMulti-Robot Task Allocation Using Global Games with Negative Feedback: The Colony Maintenance Problem
In this article we address the multi-robot task allocation problem, where robots must cooperatively assign themselves to accomplish a set of tasks in their environment. We consider the colony maintenance problem as an example, where a team of robots are tasked with continuously maintaining the energy supply of a central colony. We model this as a global game, where each robot measures the energy level of the colony, and the current number of assigned robots, to determine whether or not to forage for energy sources. The key to our approach is introducing a negative feedback term into the robots' utility, which also eliminates the trivial solution where foraging or not foraging are strictly dominant strategies. We compare our approach qualitatively to existing global games, where a positive positive feedback term admits threshold-based decision making, and encourages many robots to forage simultaneously. We show how positive feedback can lead to a cascading failure in the presence of a human who recruits robots, and we demonstrate the resilience of our approach in simulation.
- Open Access
Safe and Efficient Coexistence of Autonomous Vehicles with Human-Driven Traffic at Signalized Intersections
The proliferation of connected and automated vehicles (CAVs) has positioned mixed traffic environments, which encompass both CAVs and human driven vehicles (HDVs), as critical components of emerging mobility systems. Signalized intersections are paramount for optimizing transportation efficiency and enhancing energy economy, as they inherently induce stop and go traffic dynamics. In this paper, we present an integrated framework that concurrently optimizes signal timing and CAV trajectories at signalized intersections, with the dual objectives of maximizing traffic throughput and minimizing energy consumption for CAVs. We first formulate an optimal control strategy for CAVs that prioritizes trajectory planning to circumvent state constraints, while incorporating the impact of signal timing and HDV behavior. Furthermore, we introduce a traffic signal control methodology that dynamically adjusts signal phases based on vehicular density per lane, while mitigating disruption for CAVs scheduled to traverse the intersection. Acknowledging the system's inherent dynamism, we also explore event triggered replanning mechanisms that enable CAVs to iteratively refine their planned trajectories in response to the emergence of more efficient routing options. The efficacy of our proposed framework is evaluated through comprehensive simulations in MATLAB.
Open AccessSafe and Efficient Coexistence of Autonomous Vehicles with Human-Driven Traffic at Signalized Intersections
The proliferation of connected and automated vehicles (CAVs) has positioned mixed traffic environments, which encompass both CAVs and human driven vehicles (HDVs), as critical components of emerging mobility systems. Signalized intersections are paramount for optimizing transportation efficiency and enhancing energy economy, as they inherently induce stop and go traffic dynamics. In this paper, we present an integrated framework that concurrently optimizes signal timing and CAV trajectories at signalized intersections, with the dual objectives of maximizing traffic throughput and minimizing energy consumption for CAVs. We first formulate an optimal control strategy for CAVs that prioritizes trajectory planning to circumvent state constraints, while incorporating the impact of signal timing and HDV behavior. Furthermore, we introduce a traffic signal control methodology that dynamically adjusts signal phases based on vehicular density per lane, while mitigating disruption for CAVs scheduled to traverse the intersection. Acknowledging the system's inherent dynamism, we also explore event triggered replanning mechanisms that enable CAVs to iteratively refine their planned trajectories in response to the emergence of more efficient routing options. The efficacy of our proposed framework is evaluated through comprehensive simulations in MATLAB.
- Open Access
A Global Games-Inspired Approach to Multi-Robot Task Allocation for Heterogeneous Teams
In this article we propose a game-theoretic approach to the multi-robot task allocation problem using the framework of global games. Each task is associated with a global signal, a real-valued number that captures the task execution progress and/or urgency. We propose a linear objective function for each robot in the system, which, for each task, increases with global signal and decreases with the number assigned robots. We provide conditions on the objective function hyperparameters to induce a mixed Nash equilibrium, i.e., solutions where all robots are not assigned to a single task. The resulting algorithm only requires the inversion of a matrix to determine a probability distribution over the robot assignments. We demonstrate the performance of our algorithm in simulation and provide direction for applications and future work.
Open AccessA Global Games-Inspired Approach to Multi-Robot Task Allocation for Heterogeneous Teams
In this article we propose a game-theoretic approach to the multi-robot task allocation problem using the framework of global games. Each task is associated with a global signal, a real-valued number that captures the task execution progress and/or urgency. We propose a linear objective function for each robot in the system, which, for each task, increases with global signal and decreases with the number assigned robots. We provide conditions on the objective function hyperparameters to induce a mixed Nash equilibrium, i.e., solutions where all robots are not assigned to a single task. The resulting algorithm only requires the inversion of a matrix to determine a probability distribution over the robot assignments. We demonstrate the performance of our algorithm in simulation and provide direction for applications and future work.
- 29 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (1) , 438-449
A Constraint-Driven Approach to Line Flocking: The V Formation as an Energy-Saving Strategy
In this article, we present a constraint-driven control algorithm that minimizes the energy consumption of individual agents and yields an emergent V formation. As the formation emerges from the decentralized interaction between agents, our approach is robust to the spontaneous addition or removal of agents to the system. We start from an analytical model for the trailing upwash behind a fixed-wing uncrewed aerial vehicle (UAV), and we derive the optimal air speed for trailing UAVs to maximize their travel endurance. Next, we prove that simply flying at the optimal airspeed will never lead to emergent flocking behavior and propose a new decentralized “ aneroid” behavior that yields emergent V formations. We encode these behaviors in a constraint-driven control algorithm that minimizes the locomotive power of each UAV. Finally, we prove that UAVs initialized in an approximate V or echelon formation will converge under our proposed control law, and we demonstrate this emergence occurs in real time in simulation and in physical experiments with a fleet of Crazyflie quadrotors despite the noise and disturbances inherent in physical systems.
- 29 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (1) , 438-449
A Constraint-Driven Approach to Line Flocking: The V Formation as an Energy-Saving Strategy
In this article, we present a constraint-driven control algorithm that minimizes the energy consumption of individual agents and yields an emergent V formation. As the formation emerges from the decentralized interaction between agents, our approach is robust to the spontaneous addition or removal of agents to the system. We start from an analytical model for the trailing upwash behind a fixed-wing uncrewed aerial vehicle (UAV), and we derive the optimal air speed for trailing UAVs to maximize their travel endurance. Next, we prove that simply flying at the optimal airspeed will never lead to emergent flocking behavior and propose a new decentralized “ aneroid” behavior that yields emergent V formations. We encode these behaviors in a constraint-driven control algorithm that minimizes the locomotive power of each UAV. Finally, we prove that UAVs initialized in an approximate V or echelon formation will converge under our proposed control law, and we demonstrate this emergence occurs in real time in simulation and in physical experiments with a fleet of Crazyflie quadrotors despite the noise and disturbances inherent in physical systems.