Alexander Von Moll
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Alexander Von Moll has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- David W. Casbeer
Control Science Center, Air Force Research Laboratory, Wright-Patterson Air Force Base, OH, USA
11 shared publications - Meir Pachter
Department of Electrical Engineering, Air Force Institute of Technology, Wright-Patterson AFB, OH, USA
11 shared publications - Daigo Shishika
Department of Mechanical Engineering, George Mason University, Fairfax, VA, USA
6 shared publications David Casbeer
6 shared publications- Isaac E. Weintraub
Control Science Center of Excellence, Aerospace Systems Directorate, Air Force Research Laboratory, Wright-Patterson Air Force Base, OH, USA
6 shared publications - Shaunak D. Bopardikar
Michigan State University
6 shared publications
Latest Publications
- 18 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2921-2926
Target Defense Using a Turret and Mobile Defender Team
A scenario is considered wherein a stationary, turn constrained agent (Turret) and a mobile agent (Defender) cooperate to protect the former from an adversarial mobile agent (Attacker). The Attacker wishes to reach the Turret prior to getting captured by either the Defender or Turret, if possible. Meanwhile, the Defender and Turret seek to capture the Attacker as far from the Turret as possible. This scenario is formulated as a differential game and solved using a geometric approach. Necessary and sufficient conditions for the Turret-Defender team winning and the Attacker winning are given. In the case of the Turret-Defender team winning equilibrium strategies for the terminal distance of the Attacker to the Turret are given. Three cases arise corresponding to solo capture by the Defender, solo capture by the Turret, and capture simultaneously by both Turret and Defender.
- 18 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2921-2926
Target Defense Using a Turret and Mobile Defender Team
A scenario is considered wherein a stationary, turn constrained agent (Turret) and a mobile agent (Defender) cooperate to protect the former from an adversarial mobile agent (Attacker). The Attacker wishes to reach the Turret prior to getting captured by either the Defender or Turret, if possible. Meanwhile, the Defender and Turret seek to capture the Attacker as far from the Turret as possible. This scenario is formulated as a differential game and solved using a geometric approach. Necessary and sufficient conditions for the Turret-Defender team winning and the Attacker winning are given. In the case of the Turret-Defender team winning equilibrium strategies for the terminal distance of the Attacker to the Turret are given. Three cases arise corresponding to solo capture by the Defender, solo capture by the Turret, and capture simultaneously by both Turret and Defender.
- 17 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2849-2854
Safe Navigation in the Presence of Range-Limited Pursuers
This paper examines the degree to which an evader seeking a safe and efficient path to a target location can benefit from increasing levels of knowledge regarding one or more range-limited pursuers seeking to intercept it. Unlike previous work, this research considers the time of flight of the pursuers actively attempting interception. It is shown that additional knowledge allows the evader to safely steer closer to the threats, shortening paths without accepting additional risk of capture. A control heuristic is presented, suitable for real-time implementation, which capitalizes on all knowledge available to the evader.
- 17 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2849-2854
Safe Navigation in the Presence of Range-Limited Pursuers
This paper examines the degree to which an evader seeking a safe and efficient path to a target location can benefit from increasing levels of knowledge regarding one or more range-limited pursuers seeking to intercept it. Unlike previous work, this research considers the time of flight of the pursuers actively attempting interception. It is shown that additional knowledge allows the evader to safely steer closer to the threats, shortening paths without accepting additional risk of capture. A control heuristic is presented, suitable for real-time implementation, which capitalizes on all knowledge available to the evader.
- 17 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 3017-3022
Heterogeneous Pursuit of an Active Target Under Sensing Constraints
This paper studies a heterogeneous three-agent pursuit-evasion scenario in which a sensor–attacker team attempts to capture an active target capable of changing its heading at fixed time intervals. The sensor has a limited sensing range, and the attacker must intercept the target before it escapes sensing. We formulate this problem as a game of kind and extend the optimal sensor and attacker strategies from prior work on passive targets to the active target setting. The sensor updates its heading in each interval by assuming that the target will keep its heading fixed for the rest of the engagement, while the attacker uses an Apollonius circle-based approach for minimum-time interception and updating its heading corresponding to the target heading in every interval. We show that the conditions for capture or escape of a passive target also extend to the case of an active target. In particular, if the speed of the active target is less than a critical value identified for passive targets in our prior work, then capture is guaranteed.
- 17 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 3017-3022
Heterogeneous Pursuit of an Active Target Under Sensing Constraints
This paper studies a heterogeneous three-agent pursuit-evasion scenario in which a sensor–attacker team attempts to capture an active target capable of changing its heading at fixed time intervals. The sensor has a limited sensing range, and the attacker must intercept the target before it escapes sensing. We formulate this problem as a game of kind and extend the optimal sensor and attacker strategies from prior work on passive targets to the active target setting. The sensor updates its heading in each interval by assuming that the target will keep its heading fixed for the rest of the engagement, while the attacker uses an Apollonius circle-based approach for minimum-time interception and updating its heading corresponding to the target heading in every interval. We show that the conditions for capture or escape of a passive target also extend to the case of an active target. In particular, if the speed of the active target is less than a critical value identified for passive targets in our prior work, then capture is guaranteed.
- Open Access
- 19 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Control Systems
- Vol. 4, 418-432
Mutual Support by Sensor-Attacker Team for a Passive Target
We introduce a pursuit game played between a team of a sensor and an attacker and a mobile target in the unbounded Euclidean plane. The target is faster than the sensor, but slower than the attacker. The sensor's objective is to keep the target within a sensing radius so that the attacker can capture the target, whereas the target seeks to escape by reaching beyond the sensing radius from the sensor without getting captured by the attacker. We assume that as long as the target is within the sensing radius from the sensor, the sensor-attacker team is able to measure the target's instantaneous position and velocity. We pose and solve this problem as a game of kind in which the target uses an open-loop strategy (passive target). Aside from the novel formulation, our contributions are four-fold. First, we present optimal strategies for both the sensor and the attacker, according to their respective objectives. Specifically, we design a sensor strategy that maximizes the duration for which the target remains within its sensing range, while the attacker uses proportional navigation to capture the target. Second, we characterize the sensable region – the region in the plane in which the target remains within the sensing radius of the sensor during the game – and show that capture is guaranteed if and only if the Apollonius circle between the attacker and the target is fully contained within this region. Third, we derive a lower bound on the target's speed below which capture is guaranteed, and an upper bound on the target speed above which there exists an escape strategy for the target, from an arbitrary initial orientation between the agents. Fourth, for a given initial orientation between the agents, we present a sharper upper bound on the target speed above which there exists an escape strategy for the target.
- 19 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Control Systems
- Vol. 4, 418-432
Open AccessMutual Support by Sensor-Attacker Team for a Passive Target
We introduce a pursuit game played between a team of a sensor and an attacker and a mobile target in the unbounded Euclidean plane. The target is faster than the sensor, but slower than the attacker. The sensor's objective is to keep the target within a sensing radius so that the attacker can capture the target, whereas the target seeks to escape by reaching beyond the sensing radius from the sensor without getting captured by the attacker. We assume that as long as the target is within the sensing radius from the sensor, the sensor-attacker team is able to measure the target's instantaneous position and velocity. We pose and solve this problem as a game of kind in which the target uses an open-loop strategy (passive target). Aside from the novel formulation, our contributions are four-fold. First, we present optimal strategies for both the sensor and the attacker, according to their respective objectives. Specifically, we design a sensor strategy that maximizes the duration for which the target remains within its sensing range, while the attacker uses proportional navigation to capture the target. Second, we characterize the sensable region – the region in the plane in which the target remains within the sensing radius of the sensor during the game – and show that capture is guaranteed if and only if the Apollonius circle between the attacker and the target is fully contained within this region. Third, we derive a lower bound on the target's speed below which capture is guaranteed, and an upper bound on the target speed above which there exists an escape strategy for the target, from an arbitrary initial orientation between the agents. Fourth, for a given initial orientation between the agents, we present a sharper upper bound on the target speed above which there exists an escape strategy for the target.
- Open Access
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Control Systems
- Vol. 4, 385-399
Deception in Turret Defense Game: Information Limiting Strategy to Induce Dilemma
Can deception exist in differential games? We provide a case study for a Turret-Attacker differential game, where two Attackers seek to score points by reaching a target region while a Turret tries to minimize the score by aligning itself with the Attackers before they reach the target. In contrast to the original problem solved with complete information, we assume that the Turret only has partial information about the maximum speed of the Attackers. We investigate whether there is any incentive for the Attackers to move slower than their maximum speed in order to “deceive” the Turret into taking suboptimal actions. We first describe the existence of a dilemma that the Turret may face. Then we derive a set of initial conditions from which the Attackers can force the Turret into a situation where it must take a guess.
- 17 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Control Systems
- Vol. 4, 385-399
Open AccessDeception in Turret Defense Game: Information Limiting Strategy to Induce Dilemma
Can deception exist in differential games? We provide a case study for a Turret-Attacker differential game, where two Attackers seek to score points by reaching a target region while a Turret tries to minimize the score by aligning itself with the Attackers before they reach the target. In contrast to the original problem solved with complete information, we assume that the Turret only has partial information about the maximum speed of the Attackers. We investigate whether there is any incentive for the Attackers to move slower than their maximum speed in order to “deceive” the Turret into taking suboptimal actions. We first describe the existence of a dilemma that the Turret may face. Then we derive a set of initial conditions from which the Attackers can force the Turret into a situation where it must take a guess.
- Open Access
Target Defense Using a Turret and Mobile Defender Team
A scenario is considered wherein a stationary, turn constrained agent (Turret) and a mobile agent (Defender) cooperate to protect the former from an adversarial mobile agent (Attacker). The Attacker wishes to reach the Turret prior to getting captured by either the Defender or Turret, if possible. Meanwhile, the Defender and Turret seek to capture the Attacker as far from the Turret as possible. This scenario is formulated as a differential game and solved using a geometric approach. Necessary and sufficient conditions for the Turret-Defender team winning and the Attacker winning are given. In the case of the Turret-Defender team winning equilibrium strategies for the min max terminal distance of the Attacker to the Turret are given. Three cases arise corresponding to solo capture by the Defender, solo capture by the Turret, and capture simultaneously by both Turret and Defender.
Open AccessTarget Defense Using a Turret and Mobile Defender Team
A scenario is considered wherein a stationary, turn constrained agent (Turret) and a mobile agent (Defender) cooperate to protect the former from an adversarial mobile agent (Attacker). The Attacker wishes to reach the Turret prior to getting captured by either the Defender or Turret, if possible. Meanwhile, the Defender and Turret seek to capture the Attacker as far from the Turret as possible. This scenario is formulated as a differential game and solved using a geometric approach. Necessary and sufficient conditions for the Turret-Defender team winning and the Attacker winning are given. In the case of the Turret-Defender team winning equilibrium strategies for the min max terminal distance of the Attacker to the Turret are given. Three cases arise corresponding to solo capture by the Defender, solo capture by the Turret, and capture simultaneously by both Turret and Defender.
- Open Access
Mutual Support by Sensor-Attacker Team for a Passive Target
We introduce a pursuit game played between a team of a sensor and an attacker and a mobile target in the unbounded Euclidean plane. The target is faster than the sensor, but slower than the attacker. The sensor's objective is to keep the target within a sensing radius so that the attacker can capture the target, whereas the target seeks to escape by reaching beyond the sensing radius from the sensor without getting captured by the attacker. We assume that as long as the target is within the sensing radius from the sensor, the sensor-attacker team is able to measure the target's instantaneous position and velocity. We pose and solve this problem as a \emph{game of kind} in which the target uses an open-loop strategy (passive target). Aside from the novel formulation, our contributions are four-fold. First, we present optimal strategies for both the sensor and the attacker, according to their respective objectives. Specifically, we design a sensor strategy that maximizes the duration for which the target remains within its sensing range, while the attacker uses proportional navigation to capture the target. Second, we characterize the \emph{sensable region} -- the region in the plane in which the target remains within the sensing radius of the sensor during the game -- and show that capture is guaranteed {if and only if} the Apollonius circle between the attacker and the target is fully contained within this region. Third, we {derive a lower bound} on the target's speed below which capture is guaranteed, and an upper bound on the target speed above which there exists an escape strategy for the target, from an arbitrary initial orientation between the agents. Fourth, for a given initial orientation between the agents, we present a sharper upper bound on the target speed above which there exists an escape strategy for the target.
Open AccessMutual Support by Sensor-Attacker Team for a Passive Target
We introduce a pursuit game played between a team of a sensor and an attacker and a mobile target in the unbounded Euclidean plane. The target is faster than the sensor, but slower than the attacker. The sensor's objective is to keep the target within a sensing radius so that the attacker can capture the target, whereas the target seeks to escape by reaching beyond the sensing radius from the sensor without getting captured by the attacker. We assume that as long as the target is within the sensing radius from the sensor, the sensor-attacker team is able to measure the target's instantaneous position and velocity. We pose and solve this problem as a \emph{game of kind} in which the target uses an open-loop strategy (passive target). Aside from the novel formulation, our contributions are four-fold. First, we present optimal strategies for both the sensor and the attacker, according to their respective objectives. Specifically, we design a sensor strategy that maximizes the duration for which the target remains within its sensing range, while the attacker uses proportional navigation to capture the target. Second, we characterize the \emph{sensable region} -- the region in the plane in which the target remains within the sensing radius of the sensor during the game -- and show that capture is guaranteed {if and only if} the Apollonius circle between the attacker and the target is fully contained within this region. Third, we {derive a lower bound} on the target's speed below which capture is guaranteed, and an upper bound on the target speed above which there exists an escape strategy for the target, from an arbitrary initial orientation between the agents. Fourth, for a given initial orientation between the agents, we present a sharper upper bound on the target speed above which there exists an escape strategy for the target.
- Open Access
- 1 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Control Systems
- Vol. 4, 360-372
Cooperative Pursuit-Evasion Games With a Flat Sphere Condition
In planar pursuit-evasion differential games considering a faster pursuer and a slower evader, the interception points resulting from equilibrium strategies lie on the Apollonius circle. This property is instrumental for leveraging geometric approaches for solving multiple pursuit-evasion scenarios in the plane. In this paper, we study a pursuit-evasion differential game on a sphere and generalize the planar Apollonius circle to the spherical domain. For the differential game, we provide equilibrium strategies for all initial positions of the pursuer and evader, including a special case when they are on the opposite sides of the sphere and on the same line with the center of the sphere when there are infinitely many geodesics between the two players. In contrast to planar scenarios, on the sphere we find that the interception point from the equilibrium strategies can leave the Apollonius domain boundary. We present a condition to ensure the intercept point remains on the boundary of the Apollonius domain. This condition allows for generalizing planar pursuit-evasion strategies to the sphere, and we show how these results are applied by analyzing the scenarios of target guarding and two-pursuer, single evader differential games on the sphere.
- 1 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Control Systems
- Vol. 4, 360-372
Open AccessCooperative Pursuit-Evasion Games With a Flat Sphere Condition
In planar pursuit-evasion differential games considering a faster pursuer and a slower evader, the interception points resulting from equilibrium strategies lie on the Apollonius circle. This property is instrumental for leveraging geometric approaches for solving multiple pursuit-evasion scenarios in the plane. In this paper, we study a pursuit-evasion differential game on a sphere and generalize the planar Apollonius circle to the spherical domain. For the differential game, we provide equilibrium strategies for all initial positions of the pursuer and evader, including a special case when they are on the opposite sides of the sphere and on the same line with the center of the sphere when there are infinitely many geodesics between the two players. In contrast to planar scenarios, on the sphere we find that the interception point from the equilibrium strategies can leave the Apollonius domain boundary. We present a condition to ensure the intercept point remains on the boundary of the Apollonius domain. This condition allows for generalizing planar pursuit-evasion strategies to the sphere, and we show how these results are applied by analyzing the scenarios of target guarding and two-pursuer, single evader differential games on the sphere.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1940-1945
Dubins Path With Terminal Range and Field-of-View Constraints
This paper addresses a path planning problem for a turn-constrained vehicle equipped with a sensor that has a limited range and field of view (FOV). The vehicle is modeled using Dubins kinematics, and the objective is to determine the shortest path to point where that the target is detectable, i.e., within the sensor’s range and FOV. The limited sensor range imposes a constraint requiring the vehicle to reach a circle centered at the target’s position, with a radius equal to the sensor range. The field-of-view constraints are expressed as coupled conditions on the terminal position and heading. Pontryagin’s minimum principle restricts the optimal path to straight lines and arcs of minimum turn radius. Further analysis shows that the paths are limited to at most two segments. Straight-line segments occur exclusively when the final position lies on the boundary of the target circle. Furthermore, we present an analytical approach for computing optimal paths in scenarios where the optimality conditions result in complex geometric configurations.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1940-1945
Dubins Path With Terminal Range and Field-of-View Constraints
This paper addresses a path planning problem for a turn-constrained vehicle equipped with a sensor that has a limited range and field of view (FOV). The vehicle is modeled using Dubins kinematics, and the objective is to determine the shortest path to point where that the target is detectable, i.e., within the sensor’s range and FOV. The limited sensor range imposes a constraint requiring the vehicle to reach a circle centered at the target’s position, with a radius equal to the sensor range. The field-of-view constraints are expressed as coupled conditions on the terminal position and heading. Pontryagin’s minimum principle restricts the optimal path to straight lines and arcs of minimum turn radius. Further analysis shows that the paths are limited to at most two segments. Straight-line segments occur exclusively when the final position lies on the boundary of the target circle. Furthermore, we present an analytical approach for computing optimal paths in scenarios where the optimality conditions result in complex geometric configurations.
- 3 January 2025
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 16 (2) , 458-475
Complete Solution of the Lady in the Lake Scenario
- 3 January 2025
- Published by Springer Nature in Dynamic Games and Applications
- Vol. 16 (2) , 458-475
Complete Solution of the Lady in the Lake Scenario