An Optimal Engagement Zone Avoidance Scenario in 2-D
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Nov 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026A Comparison of Reinforcement Learning and Optimal Control Methods for Path Planningcited by 1
- 2026Path Planning Using Deep Deterministic Policy Gradient: A Reinforcement Learning Approachcited by 1
- 2026Combining Reinforcement Learning with Arc-search Interior-Point Method for Path Planningcited by 0
- 2026Combining Reinforcement Learning with Arc-search Interior-Point Method for Path Planning6 Jun 2026
- 2026Path Planning Using Deep Deterministic Policy Gradient: A Reinforcement Learning Approach5 Jun 2026
- 2026A Comparison of Reinforcement Learning and Optimal Control Methods for Path Planning14 Apr 2026