Abstract
The state determinability of continuous-time bilinear systems and its dependence on the class of admissible inputs are investigeted. The input which makes possible the determination of the initial state is shwon to be constructed as a piecewise constant function. Moreover, the piecewise constant function may be a bang-bang with arbitrary binary values. The upper bound on the minimal number of switchings of these inputs are explicitly given. If analytic functions or polynomials is admitted, one analytic function or one polynomial input is sufficient to determine the state instantaneously.
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.
