{"title":"用图探索方法求解混合系统的优化问题","authors":"K. Hiraishi","doi":"10.1109/WODES.2006.1678443","DOIUrl":null,"url":null,"abstract":"The aim of this research is to give a systematic way to solve optimization problems on hybrid systems. The target classes of hybrid systems are linear hybrid automata and piecewise linear systems. The behavior of a hybrid system is represented by a directed acyclic graph such that each node is associated with a convex polyhedron on continuous state variables, and each edge corresponds to a discrete transition. Then the problem is solved by finding a trajectory in the graph that fulfills given specifications and also optimizes a given objective function. The procedure is implemented on a constraint logic programming language","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Solving Optimization Problems on Hybrid Systems by Graph Exploration\",\"authors\":\"K. Hiraishi\",\"doi\":\"10.1109/WODES.2006.1678443\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of this research is to give a systematic way to solve optimization problems on hybrid systems. The target classes of hybrid systems are linear hybrid automata and piecewise linear systems. The behavior of a hybrid system is represented by a directed acyclic graph such that each node is associated with a convex polyhedron on continuous state variables, and each edge corresponds to a discrete transition. Then the problem is solved by finding a trajectory in the graph that fulfills given specifications and also optimizes a given objective function. The procedure is implemented on a constraint logic programming language\",\"PeriodicalId\":285315,\"journal\":{\"name\":\"2006 8th International Workshop on Discrete Event Systems\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 8th International Workshop on Discrete Event Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2006.1678443\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 8th International Workshop on Discrete Event Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2006.1678443","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving Optimization Problems on Hybrid Systems by Graph Exploration
The aim of this research is to give a systematic way to solve optimization problems on hybrid systems. The target classes of hybrid systems are linear hybrid automata and piecewise linear systems. The behavior of a hybrid system is represented by a directed acyclic graph such that each node is associated with a convex polyhedron on continuous state variables, and each edge corresponds to a discrete transition. Then the problem is solved by finding a trajectory in the graph that fulfills given specifications and also optimizes a given objective function. The procedure is implemented on a constraint logic programming language
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
