arXiv (OAI Expanded)
open access
Convex Pursuit-Evasion Games for Spacecraft Proximity Operations on Circular and Elliptical Orbits
Inspecting or servicing a non-cooperative spacecraft is a two-player game: the target can thrust to defeat the inspector's plan. Hamilton-Jacobi-Isaacs reachability answers such games exactly but its cost grows exponentially with state dimension, while learning-based controllers scale yet certify no
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
- Collision Orbit#60488
- Decentralized Guidance and Control for Rendezvous and Docking with a Tumbling Target using Multiple Servicers#1062481
- RENDEZVOUS TRAJECTORY OPTIMIZATION WITH AN UNCOOPERATIVE SATELLITE USING UNCERTAINTY ANALYSIS#657679
- Information-Based Trajectory Planning for Spacecraft-to-Spacecraft Tracking and Navigation in Cislunar Space#1013224
- A Distributed Computing Framework for Satellite Swarms#1012997
Record · ID 1083784
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