Abstract

This paper considers the task of computing (sub-) optimal continuous and discrete control trajectories for hybrid systems with a probabilistic discrete transition structure. The discrete inputs are used to block undesired transitions and to realize evolutions that are goal-attaining with high probability. An approach is proposed which combines the computation of discrete shortest-paths for given probability-levels with embedded continuous optimal control problems to fix the continuous controls. The result is a control strategy which leads to a system evolution that maximizes a weighted sum of performance and probability of success. The approach is illustrated for an automated transportation scenario.

Full Text
Paper version not known

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.