Pursuer’s Control Strategy for Orbital Pursuit-Evasion-Defense Game with Continuous Low Thrust Propulsion
نویسندگان
چکیده
منابع مشابه
Game Theory Models for Pursuit Evasion Games
In a pursuit evasion game, the pursuer tries to capture the evader while the evader tries to prevent this capture. A classical approach is to model this game as an infinite differential game. In this report, we model a pursuit-evasion game as a finite extensive form game, and show that the differential game is a generalization of this game. We prove that a pure-strategy Nash equilibrium always ...
متن کاملHierarchical Strategy Synthesis for Pursuit-Evasion Problems
We present a novel approach for solving pursuit-evasion problems where multiple pursuers with limited sensing capabilities are used to detect all possible mobile evaders in a given environment. We make no assumptions about the number, the speed, or the maneuverability of evaders. Our algorithm takes as input a map of the environment and sensor models for the pursuers. We then obtain a graph rep...
متن کاملNonlinear Control Tools for Low Thrust Orbital Transfer
We consider the problem of orbital transfer under propulsion constraints. The solution is arrived at by appealing to several recent nonlinear control design methods including backstepping, forwarding, and a modified form of JurdjevicQuinn control.
متن کاملOrbital Maneuvers Using Low-thrust
To perform the orbital maneuvers, a software that calculates an optimal maneuver is developed. This method will be used as a reference for comparison and analises of the suboptimal methods to be used on board. This method id based on an analytical development that generate equations that can be computed in a shorter time, allowing real time applications. Key-Words: Orbital maneuvers, low thrust...
متن کاملA Complete Pursuit-Evasion Algorithm for Two Pursuers using Beam Detection
We present an algorithm for a pair of pursuers, each with one rotating beam (flashlight, laser or a camera), searching for an unpredictable, moving target in a 2D environment (simple polygon). Given a polygon with n edges, the algorithm decides in time O(n) whether it can be cleared by the pursuers, and if so, constructs a search schedule. The pursuers are allowed to move on the boundary and in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2019
ISSN: 2076-3417
DOI: 10.3390/app9153190