arXiv (OAI Expanded)
open access
Solution and Optimal Strategies for a Differential Game of Pursuit-Evasion with Point-Wise Constraints
This work study a differential game of pursuit-evasion involving countably many pursuers $p_{1},p_{2},\cdots,p_{m}$ and a single evader $e$ under point-wise (geometric) constraints in the sequence space $l_{2}.$ The pursuers evolve according to specified differential equations of $1^{st}$ order whil
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Solution and Optimal Strategies for a Differential Game of Pursuit-Evasion with Point-Wise Constraints#799359
- MLN-EIGS: A multilayer network framework for solving Stackelberg escape interdiction games on dynamic transportation networks#997562
- Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards#158736
- Optimal Impulse Control for Cyber Risk Management#309950
- Trajectory tracking control of parafoil systems via soft actor-critic with benchmark task set generation.#326980
Record · ID 797936
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive