Searcharxiv⌕ Search

arXiv subjects

Isaac E. Weintraub

Publications and source records attributed to Isaac E. Weintraub.

22 records · Page 2Linked to original sources

Surveillance of a Faster Fixed-Course Target

The maximum surveillance of a target which is holding course is considered, wherein an observer vehicle aims to maximize the time that a faster target remains within a fixed-range of the observer. This entails two coupled phases: an approach phase and observation phase. In the approach phase, the observer strives to make contact with the faster target, such that in the observation phase, the observer is able to maximize the time where the target remains within range. Using Pontryagin's Minimum Principle, the optimal control laws for the observer are found in closed-form. Example scenarios highlight various aspects of the engagement.

math.OC↗

Path Planning and Energy Management of Hybrid Air Vehicles for Urban Air Mobility

A novel coupled path planning and energy management problem for a hybrid unmanned air vehicle is considered, where the hybrid vehicle is powered by a dual gas/electric system. Such an aerial robot is envisioned for use in an urban setting where noise restrictions are in place in certain zones necessitating battery only operation. We consider the discrete version of this problem, where a graph is constructed by sampling the boundaries of the restricted zones, and develop a path planning algorithm. The planner simultaneously solves the path planing along with the energy mode switching control, under battery constraints and noise restrictions. This is a coupled problem involving discrete decision making to find the path to travel, and determining the state of charge of the battery along the path, which is a continuous variable. A sampling based algorithm to find near optimal solution to this problem is presented. To quantify the efficacy of the solution, an algorithm that computes tight lower bounds is also presented. The algorithms presented are verified using numerical simulations, and the average gap between the feasible solutions (upper bounds) and the lower bounds are, empirically, shown to be within 15% of each other.

math.OC↗

An Optimal Engagement Zone Avoidance Scenario in 2-D

In this paper, an optimal control problem is considered where a target vehicle aims to reach a desired location in minimum time while avoiding a dynamic engagement zone. Using simple motion, four potential approaches are considered. First, the min-time strategy which ignores the engagement zone is posed and solved. Second, the min-time strategy which avoids the engagement zone entirely is considered. Third, the min-time strategy which allows for some time in the engagement zone; but, still strives to stay away from the center of the engagement zone is posed. Lastly, a fixed final-time strategy is considered, wherein the target tries to avoid the engagement zone; but, is required to arrive at the desired location at a specific time. Using a nonlinear program solver, the optimal strategies are numerically solved. From the results of the numeric solutions, the optimal strategies are discussed and comparisons are drawn.

math.OC↗

An Introduction to Pursuit-evasion Differential Games

Pursuit and evasion conflicts represent challenging problems with important applications in aerospace and robotics. In pursuit-evasion problems, synthesis of intelligent actions must consider the adversary's potential strategies. Differential game theory provides an adequate framework to analyze possible outcomes of the conflict without assuming particular behaviors by the opponent. This article presents an organized introduction of pursuit-evasion differential games with an overview of recent advances in the area. First, a summary of the seminal work is outlined, highlighting important contributions. Next, more recent results are described by employing a classification based on the number of players: one-pursuer-one-evader, N-pursuers-one-evader, one-pursuer-M-evaders, and N-pursuer-M-evader games. In each scenario, a brief summary of the literature is presented. Finally, two representative pursuit-evasion differential games are studied in detail: the two-cutters and fugitive ship differential game and the active target defense differential game. These problems provide two important applications and, more importantly, they give great insight into the realization of cooperation between friendly agents in order to form a team and defeat the adversary.

math.OC↗