[
  {"id":"ModelFreePlantTuning","accessed":{"date-parts":[["2024",7,10]]},"citation-key":"ModelFreePlantTuning","title":"Model-Free Plant Tuning | IEEE Journals & Magazine | IEEE Xplore","type":"webpage","URL":"https://ieeexplore.ieee.org/abstract/document/7586127"},
  {"id":"blanchiniModelFreePlantTuning2017","abstract":"Given a static plant described by a differentiable input-output function, which is completely unknown, but whose Jacobian takes values in a known polytope in the matrix space, this paper considers the problem of tuning (i.e., driving to a desired value) the output, by suitably choosing the input. It is shown that, if the polytope is robustly nonsingular (or has full rank, in the nonsquare case), then a suitable tuning scheme drives the output to the desired point. The proof exploits a Lyapunov-like function and applies a well-known game-theoretic result, concerning the existence of a saddle point for a min-max zero-sum game. When the plant output is represented in an implicit form, it is shown that the same result can be obtained, resorting to a different Lyapunov-like function. The case in which proper input or output constraints must be enforced during the transient is considered as well. Some application examples are proposed to show the effectiveness of the approach.","accessed":{"date-parts":[["2024",7,10]]},"author":[{"family":"Blanchini","given":"Franco"},{"family":"Fenu","given":"Gianfranco"},{"family":"Giordano","given":"Giulia"},{"family":"Pellegrino","given":"Felice Andrea"}],"citation-key":"blanchiniModelFreePlantTuning2017","container-title":"IEEE Transactions on Automatic Control","DOI":"10.1109/TAC.2016.2616025","ISSN":"1558-2523","issue":"6","issued":{"date-parts":[["2017",6]]},"page":"2623-2634","source":"IEEE Xplore","title":"Model-Free Plant Tuning","type":"article-journal","URL":"https://ieeexplore.ieee.org/abstract/document/7586127","volume":"62"},
  {"id":"ZoteroConnectors","accessed":{"date-parts":[["2024",7,2]]},"citation-key":"ZoteroConnectors","title":"Zotero | Connectors","type":"webpage","URL":"https://www.zotero.org/download/connectors"},
  {"id":"ZoteroConnectorsa","accessed":{"date-parts":[["2024",7,2]]},"citation-key":"ZoteroConnectorsa","title":"Zotero | Connectors","type":"webpage","URL":"https://www.zotero.org/download/connectors"},
  {"id":"ZoteroConnectorsb","accessed":{"date-parts":[["2024",7,2]]},"citation-key":"ZoteroConnectorsb","title":"Zotero | Connectors","type":"webpage","URL":"https://www.zotero.org/download/connectors"},
  {"id":"millerDistributedTrustedWeb2020","abstract":"Most computer checked proofs are tied to the particular technology of a prover’s software. While sharing results between proof assistants is a recognized and desirable goal, the current organization of theorem proving tools makes such sharing an exception instead of the rule. In this talk, I argue that we need to turn the current architecture of proof assistants and formal proofs inside-out. That is, instead of having a few mature theorem provers include within them their formally checked theorems and proofs, I propose that proof assistants should sit on the edge of a web of formal proofs and that proof assistant should be exporting their proofs so that they can exist independently of any theorem prover. While it is necessary to maintain the dependencies between definitions, theories, and theorems, no explicit library structure should be imposed on this web of formal proofs. Thus a theorem and its proofs should not necessarily be located at a particular URL or within a particular prover’s library. While the world of symbolic logic and proof theory certainly allows for proofs to be seen as global and permanent objects, there is a lot of research and engineering work that is needed to make this possible. I describe some of the required research and development that must be done to achieve this goal.","author":[{"family":"Miller","given":"Dale"}],"citation-key":"millerDistributedTrustedWeb2020","container-title":"Distributed Computing and Internet Technology","DOI":"10.1007/978-3-030-36987-3_2","editor":[{"family":"Hung","given":"Dang Van"},{"family":"D´Souza","given":"Meenakshi"}],"event-place":"Cham","ISBN":"978-3-030-36987-3","issued":{"date-parts":[["2020"]]},"language":"en","page":"21-40","publisher":"Springer International Publishing","publisher-place":"Cham","source":"Springer Link","title":"A Distributed and Trusted Web of Formal Proofs","type":"paper-conference"}
]
