ABSTRACT
Chapter 10 described the mathematical techniques to handle dynamic optimization problems in the presence of dynamic equations, path constraints and endpoint constraints. All of these constraints were taken to be equalities. Calculus of variation provided the underlying mathematical tools to handle the optimization problem for dynamic systems described in first order and higher order forms. This chapter extends these results to address feasible and optimaltrajectory planning problems in the presence of inequality constraints.
