Abstract
Optimizing high-level mission planning constraints is traditionally solved in exponential time and requires to split the problem into several ones, making the connections between them a convoluted task. This paper aims at generalizing recent works on the convexification of Signal Temporal Logic (STL) constraints converting them into linear approximations. Graphs are employed to build general linguistic semantics based on key words (such as Not, And, Or, Eventually, Always), and super-operators (e.g., Until, Imply, If and Only If) based on already defined ones. Numerical validations demonstrate the performance of the proposed approach on two practical use-cases of satellite optimal guidance using a modified Successive Convexification scheme. Finally, a potential hybridization with generative pre-trained language models is showcased.
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 callDisclaimer: 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.
