Lesson 1  Lesson 2  Lesson 3  Lesson 4  Lesson 5  Lesson 6  Lesson 7  Lesson 8  Lesson 9  Lesson 10

Applied Mathematics |Прикладная математика

LESSON 6

Read the text: ENGINEERING SPECIALIST

The Aerospace Corporation Trajectory Prescribed Path Control Problem

In a trajectory optimal control or prescribed path control problem, a trajectory is determined which satisfies simultaneously both the equations of motion for the vehicle and additional mission constraints. In general, the equations of motion form a nonlinear system of ordinary differential equations (ODEs). In a prescribed path control problem, additional path constraints are imposed to dictate the shape of the trajectory. In an optimal control problem, a performance index (or cost functional) is minimized or maximized subject to the satisfaction of the differential equations, path constraints, and associated boundary conditions. In both cases, the control profile along the trajectory, as well as the state profile, must be determined.

The first-order necessary conditions for a solution to the optimal control problem generate the Euler-Lagrange system of equations. The Euler-Lagrange system is most generally a boundary value problem for a system of differential-algebraic equations (DAEs). Typically, these DAEs have the semi-explicit form of a set of differential equations coupled with some algebraic equations. The differential equations include the equations of motion and are dependent on both the state and control variables in general. The algebraic equations arise from explicit path constraints specified in the problem, or more subtly from the necessary conditions for an optimal solution. The algebraic constraints may or may not involve the control variables. Hence, there is the potential that the underlying DAE system has an index greater than one.

Over the past 35 years, many methods have been developed to solve these trajectory problems. One such technique, known as the direct transcription method, has been implemented in the trajectory optimization and sizing code FONSIZE. In the direct transcription method, a discretization based on a collocation formula is applied to the differential equations and mission constraints to obtain a parameter optimization problem.

In theory, any nonlinear programming (NLP) algorithm can be used to solve the parameter optimization problem resulting from the direct transcription of an optimal control problem. However, it is critical to the efficiency and ultimate success of this approach to employ an NLP algorithm designed for {\em sparse, large-scale} parameter optimization problems. The sparsity has two origins: the collocation method and the inherent sparse character of the trajectoryproblems (i.e., each variable is involved in relatively few constraints). It is important to exploit the sparsity properties in order to reduce storage requirements and to increase efficiency of the solution of linear systems required by the NLP algorithm.

FONSIZE is used to design new space vehicles, specifically the size of fuel tanks ("sizing") in conjunction with optimally flying the trajectory. For example, in a launch vehicle, one might want to minimize the ascent fuel required, satisfy some trajectory constraints along with the equations of motion, and design the fuel tank lengths.

 

1. Match the left part with the right:

 

1) In a prescribed path control problem, additional path constraints

a)generate the Euler-Lagrange system of equations.

2)One such technique, known as the direct transcription method,.

b)subtly from the necessary conditions for an optimal solution.

3)The first-order necessary conditions for a solution to the optimal control problem

c) has been implemented in the trajectory optimization and sizing code FONSIZE.

4)The algebraic equations arise from explicit path constraints specified in the problem, or more

d) are imposed to dictate the shape of the trajectory.

 

2. Complete the sentences with the suggested words: to exploit, to reduce, to increase, trajectory, linear, collocation

          The sparsity has two origins: ______________method and the inherent sparse character of the______________ problems (i.e., each variable is involved in relatively few constraints). It is important______________ the sparsity properties in order______________ storage requirements and______________ efficiency of the____________ solution of systems required by the NLP algorithm.