Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 30 for “"Pursuit-Evasion"”.

  1. Optimal hypersonic pursuit evasion.

    Thesis. 1975. Sc.D.--Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.

    mit Repository record for Optimal hypersonic pursuit evasion. (opens in a new tab)

  2. Pursuit-evasion games in mobile networks

    … in this area, we model the intrusion as a pursuit-evasion game in continuous time and space. We model the intruder as an antagonistic agent and apply tools from differential game theory in order to obtain the optimal motion strategies for the agents to track the intruder as well as evade …

    uiuc Repository record for Pursuit-evasion games in mobile networks (opens in a new tab)

  3. Multi-agent Coordination Algorithms for Pursuit-Evasion

    … intelligence is a paramount concern. Based on pursuit-evasion games, this thesis investigates the safe distributed implicit coordination of large-scale multi-agent systems, as some self-organizing systems in nature. Particularly, five research questions are answered in the thesis: (1) how to …

    uts Repository record for Multi-agent Coordination Algorithms for Pursuit-Evasion (opens in a new tab)

  4. Visibility-Based Pursuit-Evasion with Probabilistic Evader Models

    <p>We propose an algorithm for a visibility-based pursuit-evasion problem in a simply-connected two-dimensional environment, in which a single pursuer has access to a probabilistic model describing how the evaders are likely to move in the environment. The application of our algorithm can be best …

    south-carolina Repository record for Visibility-Based Pursuit-Evasion with Probabilistic Evader Models (opens in a new tab)

  5. Learning in the Multi-Robot Pursuit Evasion Game

    … robots playing the differential forms of the pursuit-evasion (PE) game by proposing different learning algorithms. The intended learning algorithms are used to reduce (1) the computational requirements as much as possible, without affecting the overall performance of the learning algorithm, …

    carleton Repository record for Learning in the Multi-Robot Pursuit Evasion Game (opens in a new tab)

  6. Problems in list coloring, triangle covering, and pursuit-evasion games

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-07-14T16:02:09Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 11 littletuza.tex: 12675 bytes, checksum: addf3766f19108432eeb6fc23765de37 (MD5) uiucthesis2009.cls: 17082 bytes, checksum: …

    uiuc Repository record for Problems in list coloring, triangle covering, and pursuit-evasion games (opens in a new tab)

  7. Optimal pursuit/evasion spacecraft trajectories in the hill reference frame

    The pursuit/evasion game for two spacecraft is significantly simplified by being described with a linearized system of equations of motion. A pursuit/evasion game is also known as a “minimax” problem, because the objective of the pursuer is to minimize the time to capture, while the evader's goal …

    uiuc Repository record for Optimal pursuit/evasion spacecraft trajectories in the hill reference frame (opens in a new tab)

  8. Pursuit-evasion and time-dependent gradient flow in singular spaces

    … we consider an applied problem, namely, pursuit-evasion games. These problems are related to robotics, control theory and computer simulations. We want to find the solution curves of differential equations for pursuit-evasion games, and investigate the properties of solution curves. …

    uiuc Repository record for Pursuit-evasion and time-dependent gradient flow in singular spaces (opens in a new tab)

  9. A tensor-train-decomposition-based algorithm for high-dimensional pursuit-evasion games

    … feedback strategies for high-dimensional pursuit-evasion games. When a problem is high-dimensional or involves a state space that is defined by several variables, various methods used to solve pursuit-evasion games often require unrealistic computation time. This problem, called the curse …

    mit Repository record for A tensor-train-decomposition-based algorithm for high-dimensional pursuit-evasion games (opens in a new tab)

  10. A State Space Partitioning Scheme for Vehicle Control in Pursuit-Evasion Scenarios

    Pursuit-evasion games are the subject of a variety of research initiatives seeking to provide some level of autonomy to mobile, robotic vehicles with on-board controllers. Applications of these controllers include defense topics such as unmanned aerial vehicle (UAV) and unmanned underwater vehicle …

    vt Repository record for A State Space Partitioning Scheme for Vehicle Control in Pursuit-Evasion Scenarios (opens in a new tab)

  11. Optimal Control for a Two Player Dynamic Pursuit Evasion Game; The Herding Problem

    In this dissertation we introduce a new class of pursuit-evasion games; the herding problem. Unlike regular pursuit evasion games where the pursuer aims to hunt the evader the objective of the pursuer in this game is to drive the evader to a certain location on the x-y grid. The dissertation deals …

    vt Repository record for Optimal Control for a Two Player Dynamic Pursuit Evasion Game; The Herding Problem (opens in a new tab)

  12. Using Multiplayer Differential Game Theory to Derive Efficient Pursuit-Evasion Strategies for Unmanned Aerial Vehicles

    … less computationally demanding differential pursuit-evasion game-based algorithms are presented. The purpose of the algorithms is to quickly derive interception strategies for a team of autonomous vehicles. The algorithms are applicable to scenarios with different base assumptions, that is, …

    gatech Repository record for Using Multiplayer Differential Game Theory to Derive Efficient Pursuit-Evasion Strategies for Unmanned Aerial Vehicles (opens in a new tab)

  13. Data-driven predictive pursuit-evasion engagement guidance and fast posture reconstruction of soft continuum arm

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms

    uiuc Repository record for Data-driven predictive pursuit-evasion engagement guidance and fast posture reconstruction of soft continuum arm (opens in a new tab)

  14. Optimal control problems, curves of pursuit

    We study a class of problems known as pursuit-evasion problems (PE). These problems can be understood as special cases of optimal control problems. After describing the two main principles to study optimal control problems, namely Pontryagin's maximum principle and Bellman's method of dynamic …

    unm Repository record for Optimal control problems, curves of pursuit (opens in a new tab)

  15. On Multi-Agent Reinforcement Learning in Matrix, Stochastic and Differential Games

    … a new fuzzy reinforcement learning algorithm for pursuit-evasion games so that the pursuer trained by the proposed algorithm can capture the evader even when the environment of the game is different from the training environment. Third, we propose a new decentralized fuzzy reinforcement learning …

    carleton Repository record for On Multi-Agent Reinforcement Learning in Matrix, Stochastic and Differential Games (opens in a new tab)

  16. Guidance laws for partially-observable UAV interception based on linear covariance analysis

    … to the limited payload of drones, we consider pursuit-evasion games characterized by partial state observability. Specifically, we consider bearing-only measurements, as can easily be obtained from a single camera sensor. In this work, an optimal control formulation for a drone pursuit-evasion

    mit Repository record for Guidance laws for partially-observable UAV interception based on linear covariance analysis (opens in a new tab)

  17. Variations on Zombies and Survivor in Simple Polygons

    We study the pursuit-evasion game of a zombie and a survivor on point visibility graphs of simple polygons. A zombie has one objective: catch a survivor by occupying the vertex occupied by the survivor. On its turn, a zombie can only move on the first edge of a \textit{geodesic} path to the …

    carleton Repository record for Variations on Zombies and Survivor in Simple Polygons (opens in a new tab)

  18. Collocation With Nonlinear Programming for Two-Sided Flight Path Optimization

    … is then used to solve a very complicated pursuit-evasion problem; optimal air combat for realistic fighter aircraft models in three dimensions. Characteristics of the optimal air combat maneuvers for both aircraft are identified for many different initial conditions.

    uiuc Repository record for Collocation With Nonlinear Programming for Two-Sided Flight Path Optimization (opens in a new tab)

  19. Cooperative collision avoidance control and coordination for multiagent Lagrangian systems with disturbances

    … coverage control, consensus, target capture, pursuit evasion etc., while all at the same time aiming to be optimal in some sense, or following certain constraints imposed by the environment or communication limitations. Whatever is the objective, we always want to have a safety guarantee for …

    uiuc Repository record for Cooperative collision avoidance control and coordination for multiagent Lagrangian systems with disturbances (opens in a new tab)

Page 1 of 2