Boolean XOR Endpoint Constraints in Continuous-Time Optimal Control Problems

Abstract

In continuous-time optimal control problems, constraints must be satisfied as a set of logical conjunctions. In many practical space missions, however, the end-point functions may contain disjunctions. This thesis presents an approach for handling these end-point function disjunctions as part of a single continuous-time trajectory optimization problem. The approach embeds continuous representations of discrete logic operators as part of the problem formulation in order to model the disjunctions. The application of this new concept is first analyzed and illustrated for a canonical double integrator model as a proxy for practical space flight applications. It is then shown how the approach can be used to efficiently allow an algorithm to choose the minimum effort or minimum time attitude rotation for a rigid spacecraft amongst a set of possible terminal attitudes.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 2020
Accession Number
AD1126666

Entities

People

  • Elliott L Vonweller

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Space
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Angular Acceleration
  • Angular Momentum
  • Booster Rocket Engines
  • Cosmic Rays
  • Detectors
  • Electrical Engineering
  • Engineering
  • Equations
  • Logic Gates
  • Lunar Exploration
  • Maneuvers
  • Neural Networks
  • Pattern Recognition
  • Radiation
  • Reliability
  • Simulations
  • Solar System
  • Space Exploration
  • Space Flight
  • Spacecraft
  • Three Dimensional
  • Trajectories
  • Two Dimensional

Readers

  • Computational Linguistics
  • Control Systems Engineering.
  • Mathematical Modeling and Probability Theory.

Technology Areas

  • Space
  • Space - Spacecraft Maneuvers