{"title":"制造业中的流体模型和混合自动机","authors":"F. Balduzzi","doi":"10.1109/ROBOT.2000.846427","DOIUrl":null,"url":null,"abstract":"In this paper we discuss a hybrid formulation for the modeling and control of automated manufacturing systems within a framework that distinguishes two levels of aggregation. At the lower level the discrete flows of parts are approximated by first-order fluid models. At the higher level a finite automaton represents the transitions of the system through a sequence of admissible macro-states at the occurrence of the macro-events. We describe both levels with a single formalism by a hybrid automaton and we approach the safety verifcation of the system requirements by addressing the reachability problem in terms of the timing information associated with the verification problem.","PeriodicalId":286422,"journal":{"name":"Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fluid models and hybrid automata in manufacturing\",\"authors\":\"F. Balduzzi\",\"doi\":\"10.1109/ROBOT.2000.846427\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we discuss a hybrid formulation for the modeling and control of automated manufacturing systems within a framework that distinguishes two levels of aggregation. At the lower level the discrete flows of parts are approximated by first-order fluid models. At the higher level a finite automaton represents the transitions of the system through a sequence of admissible macro-states at the occurrence of the macro-events. We describe both levels with a single formalism by a hybrid automaton and we approach the safety verifcation of the system requirements by addressing the reachability problem in terms of the timing information associated with the verification problem.\",\"PeriodicalId\":286422,\"journal\":{\"name\":\"Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROBOT.2000.846427\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBOT.2000.846427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we discuss a hybrid formulation for the modeling and control of automated manufacturing systems within a framework that distinguishes two levels of aggregation. At the lower level the discrete flows of parts are approximated by first-order fluid models. At the higher level a finite automaton represents the transitions of the system through a sequence of admissible macro-states at the occurrence of the macro-events. We describe both levels with a single formalism by a hybrid automaton and we approach the safety verifcation of the system requirements by addressing the reachability problem in terms of the timing information associated with the verification problem.