IWIsaac E. Weintraub

Isaac E. Weintraub

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Isaac E. Weintraub has a total of 39 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Safe Navigation in the Presence of Range-Limited Pursuers

    by Thomas Chapman, Alexander Von Moll, Isaac E. Weintraub

    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.


  • Heterogeneous Pursuit of an Active Target Under Sensing Constraints

    by Prajakta Surve, Shaunak D. Bopardikar, Alexander Von Moll, Isaac Weintraub, David W. Casbeer

    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.

  • Macroscopic-Model-Based Learning for Detection of Cyber-Attacks in UAV Swarms

    by Abhishek Kashyap, Animesh Chakravarthy, Kamesh Subbarao, David Casbeer, Isaac Weintraub, Brandon Hencey

    This paper considers a class of cyber-attacks aimed at a swarm of unmanned aerial vehicles (UAVs). Our focus is on scenarios wherein an attacker may hack into a subset of vehicles in the swarm and subtly modify their flight parameters. These hacked vehicles (referred to as malicious vehicles) are subsequently able to modify the behavior of the overall swarm. The swarm comprising the mix of malicious and normal vehicles is modeled using a system of coupled partial differential equations (PDEs) in a two-dimensional Lighthill–Whitham–Richards model. We develop a methodology that combines Gaussian processes with wave propagation analysis of this two-species PDE model and use this method for detecting the presence of malicious vehicles in the swarm. Simulation results demonstrate that this methodology performs successful detection of the malicious vehicles and also identifies their mode of attack on the UAV swarm.

  • Open Access

    Mutual Support by Sensor-Attacker Team for a Passive Target

    by Prajakta Surve, Shaunak D. Bopardikar, Alexander Von Moll, Isaac Weintraub, David W. Casbeer

    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

    Cooperative Pursuit-Evasion Games With a Flat Sphere Condition

    by Dejan Milutinović, Alexander Von Moll, Satyanarayana Gupta Manyam, David W. Casbeer, Isaac E. Weintraub, Meir Pachter

    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.

  • Dubins Path With Terminal Range and Field-of-View Constraints

    by Satyanarayana G. Manyam, David W. Casbeer, Alexander Von Moll, Isaac E. Weintraub

    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.

  • Top Cited Papers

    Relational Maneuvering of Leader-Follower Unmanned Aerial Vehicles for Flexible Formation

    by Praveen Kumar Ranjan, Abhinav Sinha, Yongcan Cao, David Casbeer, Isaac Weintraub

    In this article, we propose a new formation scheme for a leader-follower unmanned aerial vehicle (UAV) system inspired by a human pilot’s behavior wherein the formation geometry does not necessarily remain fixed as the vehicles maneuver. In other words, the position and the orientation of the follower with respect to the leader are subject to change as they maneuver while satisfying some constraints. Our strategy ensures that the follower UAV maintains a desired fixed relative distance with respect to the leader UAV, whereas its orientation with respect to the leader UAV may change to reduce its control effort and provide it with a tactical advantage. We call this new relational maneuvering scheme flexible since the set of feasible positions for the follower UAV is not fixed, as is common in close proximity two-ship formations in air-to-air combat. By assigning the follower UAV’s linear and angular velocities as its control inputs, our approach tries to emulate a human pilot’s behavior in UAVs by taking anticipatory maneuvers when the leader UAV makes aggressive turns. The proposed flexible-geometry formation scheme is robust to the leader’s maneuver changes since the follower UAV’s control law does not need the information of the leader’s angular speed control and only uses relative measurements. This makes the design lucrative even when the vehicles are heterogeneous, global measurements are unavailable, or if the leader UAV is noncooperative. Finally, we present multiple simulations to highlight the merits of the flexible formation control laws.


  • Open Access

    Multi Agent Pathfinding for Noise Restricted Hybrid Fuel Unmanned Aerial Vehicles

    by Drew Scott, Satyanarayana G. Manyam, David W. Casbeer, Manish Kumar, Isaac E. Weintraub

    Multi Agent Path Finding (MAPF) seeks the optimal set of paths for multiple agents from respective start to goal locations such that no paths conflict. We address the MAPF problem for a fleet of hybrid-fuel unmanned aerial vehicles which are subject to location-dependent noise restrictions. We solve this problem by searching a constraint tree for which the subproblem at each node is a set of shortest path problems subject to the noise and fuel constraints and conflict zone avoidance. A labeling algorithm is presented to solve this subproblem, including the conflict zones which are treated as dynamic obstacles. We present the experimental results of the algorithms for various graph sizes and number of agents.