TrajectoryOptimization:

Path: Orbit/Optimization

% Performs indirect trajectory optimization on costates with fminsearch.
 Available methods are: 'downhill simplex' and 'genetic algorithm' (Sail module
 only). d is an array of datastructures defining the different methods. You can
 set up the methods to operate sequentially, i.e. on the end condition of the
 previous method, or to use the new initial lambda (costate) and redo the
 problem.

 This function has a built-in demo for a low thrust 2D trajectory.
--------------------------------------------------------------------------
   Form:
                d = TrajectoryOptimization; % init data structure
                d = TrajectoryOptimization( costFun )
   [lambda,xF,tF] = TrajectoryOptimization( d )
--------------------------------------------------------------------------

   ------
   Inputs
   ------
   d              (:)  Input data structure
                       .method (1,:) Method
                       .repeat (1,1) 1 means use the last lambda for the next
                                     pass; implies length(d) > 1
                       .d            Data structure with method parameters

   -------
   Outputs
   -------
   lambda         (:)  The computed costates
   xF            (1,:) The final state achieved
   tF            (1,:) Time of final state

--------------------------------------------------------------------------

Children:

Orbit: Optimization/CostLowThrust2D
Common: General/IsVersionAfter

Back to the Orbit Module page