No Initial Guess Required: Rapidly Computing the Feasible Set of Fuel-Optimal Electric Propulsion Trajectories

Abstract

We discuss our automated algorithm (no initial guess) that can map out the fuel optimal feasible set including the reachable/controllable set for electric propulsion missions. We provide a detailed discussion of why an indirect multi-stage formulation is well suited to solving this problem over direct and indirect continuous approaches and present an in depth discussion of the theoretical and mathematical underpinnings of our formulation. Our approach also generates the fuel-optimal control law to points in the feasible set. Reachable sets for electric propulsion spacecraft are important to many problems including: dynamic re-planning, robust mission design, space situational awareness, advanced concept development, and threat assessments. Feasible solutions are important for trajectory design and maneuver. Our automated and fast algorithm has applications to many different space maneuver problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 2022
Accession Number
AD1207894

Entities

People

  • Daniel J. Scheeres
  • Prashant R. Patel

Organizations

  • Institute for Defense Analyses

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Calculus Of Variations
  • Electric Propulsion
  • Ellipsoids
  • Engineering
  • Equations
  • Equations Of State
  • Inequalities
  • Law
  • Maneuvers
  • Orbits
  • Spacecraft
  • Threat Evaluation
  • Thrust
  • Trajectories
  • Uncertainty

Readers

  • Operations Research
  • Robotics and Automation.

Technology Areas

  • Space
  • Space - Hall-Effect Thruster
  • Space - Spacecraft Maneuvers