Abstract

It is known that the minimum fuel control problem is equivalent to a minimum l1 norm problem with linear equality constraints. By applying the dual space theory of linear vector spaces, the minimum l1 norm can be found by maximizing a linear functional with a l𝓁 norm constraint. This maximization enables the application of a linear programming technique which is usually very efficient. The control sequence which achieves the minimum fuel cost is then found by applying the alignment property in the dual space.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.