Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 29 tok/s Pro
GPT-4o 102 tok/s
GPT OSS 120B 462 tok/s Pro
Kimi K2 181 tok/s Pro
2000 character limit reached

Flat Hybrid Automata as a Class of Reachable Systems: Introductory Theory and Examples (1906.02790v1)

Published 6 Jun 2019 in cs.SY and eess.SY

Abstract: Controlling hybrid systems is mostly very challenging due to the variety of dynamics these systems can exhibit. Inspired by the concept of differential flatness of nonlinear continuous systems and their inherent invertibility property, the present contribution is focused on explicit input trajectory calculation. To this end, a new class of hybrid systems called Flat Hybrid Automata is introduced as a realisation of deterministic, reachable and explicitly invertible hybrid automata. Relevant system properties are derived, an approach for construction and for trajectory calculation is proposed and two demonstrative examples are presented. The results constitute a generalisation of control of invertible hybrid systems which is very useful if, e.g., fast reaction for stabilisation or transitions is relevant.

Citations (2)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.