eprintid: 4687 rev_number: 5 eprint_status: archive userid: 351 dir: disk0/00/00/46/87 datestamp: 2016-01-15 02:06:52 lastmod: 2021-08-27 17:36:15 status_changed: 2016-01-15 02:06:52 type: article metadata_visibility: show item_issues_count: 1 creators_name: Heymann, V.I. creators_name: Kryazhimskiy, A.V. creators_id: 1514 title: On finite-dimensional parametrizations of attainability sets ispublished: pub internal_subjects: iis_met internal_subjects: iis_mod internal_subjects: iis_sys divisions: prog_dyn abstract: The attainability set is defined to be a finite-dimensional integral-type image of the set of all absolutely continuous scalar functions of time whose derivatives take values in a given interval. For a class of control systems with scalar controls restricted to the above interval (the class comprises, in particular, some bilinear systems), the attainability set has the traditional meaning. A method of finite-dimensional parametrization of the attainability set is described. The parametrization is universal, i.e., the same for all attainability sets of a fixed dimension. For the case of control systems, the result provides an upper estimate on the number of switchings sufficient to bring the system to an arbitrary reachable state at a prescribed time. date: 1996-09 date_type: published publisher: Elsevier id_number: 10.1016/0096-3003(96)00004-5 iiasapubid: XJ-96-014 iiasa_bibref: Applied Mathematics and Computation; 78(2-3):137-151 (1 September 1996) (Published online 11 June 1999) iiasa_bibnotes: [doi:10.1016/0096-3003(96)00004-5] Special Issue creators_browse_id: 1393 full_text_status: none publication: Applied Mathematics and Computation volume: 78 number: 2 pagerange: 137-151 refereed: TRUE issn: 1873-5649 coversheets_dirty: FALSE fp7_type: info:eu-repo/semantics/article citation: Heymann, V.I. & Kryazhimskiy, A.V. (1996). On finite-dimensional parametrizations of attainability sets. Applied Mathematics and Computation 78 (2) 137-151. 10.1016/0096-3003(96)00004-5 .