pith. sign in

arxiv: 1211.5761 · v1 · pith:OPYHS5IOnew · submitted 2012-11-25 · 💻 cs.SY · math.OC

Computationally Efficient Trajectory Optimization for Linear Control Systems with Input and State Constraints

classification 💻 cs.SY math.OC
keywords linearmethodconstraintsoptimizationproblemtrajectorycomputationallyefficient
0
0 comments X
read the original abstract

This paper presents a trajectory generation method that optimizes a quadratic cost functional with respect to linear system dynamics and to linear input and state constraints. The method is based on continuous-time flatness-based trajectory generation, and the outputs are parameterized using a polynomial basis. A method to parameterize the constraints is introduced using a result on polynomial nonpositivity. The resulting parameterized problem remains linear-quadratic and can be solved using quadratic programming. The problem can be further simplified to a linear programming problem by linearization around the unconstrained optimum. The method promises to be computationally efficient for constrained systems with a high optimization horizon. As application, a predictive torque controller for a permanent magnet synchronous motor which is based on real-time optimization is presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.