Optimal Control aims to find the optimal trajectory of a system, which is the path that minimizes a given cost function or maximizes a given performance measure over time.

The Calculus of Variations, a key component of Optimal Control, is based on Lagrange's Principle, which states that the optimal trajectory of a system is the one that minimizes a certain integral, known as the action.

Dynamic Programming is an iterative technique that solves complex optimization problems by breaking them down into smaller, more manageable subproblems and solving them sequentially.

In Optimal Control, the Hamiltonian function is a mathematical expression that combines the state variables, control variables, and a cost function. It plays a crucial role in deriving the necessary conditions for optimality, known as the Pontryagin's Minimum Principle.

Optimal Control finds applications in a wide range of fields, including aerospace engineering, chemical engineering, economics, and robotics. It is used to solve complex optimization problems involving dynamic systems.

The cost function in Optimal Control quantifies the performance of the system over time. It is a mathematical expression that assigns a numerical value to each possible trajectory of the system, and the goal is to find the trajectory that minimizes the cost function.

Pontryagin's Minimum Principle provides necessary conditions for optimality in Optimal Control. These conditions include minimizing the Hamiltonian function along the optimal trajectory, satisfying the equations of motion for the state variables, and ensuring that the control variables are continuous and bounded.

Model Predictive Control (MPC) is an alternative approach to Optimal Control that is particularly suitable for systems with constraints and uncertainties. MPC solves a finite-horizon optimal control problem at each time step, using a receding horizon strategy.

Adjoint variables in Optimal Control represent the sensitivity of the cost function to changes in the state variables. They play a crucial role in deriving the necessary conditions for optimality, as they provide information about how the cost function changes with respect to the state variables.

Dynamic programming is a common numerical method for solving Optimal Control problems, particularly when the system dynamics are discrete and the cost function can be decomposed into stages. It involves breaking down the problem into smaller subproblems and solving them sequentially.

Feedback control in Optimal Control aims to adjust the control variables in real-time based on measurements of the system's state. This allows the system to adapt to changes in the environment and disturbances, ensuring that the optimal trajectory is maintained.

In the classical formulation of Optimal Control, it is typically assumed that the system is deterministic, meaning that the state of the system at any given time can be predicted with certainty based on the initial conditions and the control inputs.

The transversality condition in Optimal Control ensures that the cost function is minimized at the final time. It is a boundary condition that must be satisfied by the adjoint variables at the final time.

Linearization is a common approach for solving nonlinear Optimal Control problems. It involves approximating the nonlinear system with a linear model around an operating point, and then applying classical Optimal Control techniques to the linearized model.

Controllability and observability are important concepts in Optimal Control. Controllability determines whether it is possible to steer the system from any initial state to any final state using an admissible control law, while observability determines whether it is possible to reconstruct the state of the system from its outputs. These properties play a crucial role in determining the feasibility of finding an optimal control law.