Symbolic Reachability Computation Using the Disjunctive Partitioning Technique in Supervisory Control Theory

摘要：

Supervisory Control Theory (SCT) is a modelbased framework for automatically synthesizing a supervisor that minimally restricts the behavior of a plant such that a given specification is fulfilled. A problem, which prevents SCT from having a major breakthrough industrially, is that the supervisory synthesis often suffers from the state-space explosion problem. To alleviate this problem, a well-known strategy is to represent and explore the state-space symbolically by using Binary Decision Diagrams. Based on this principle, an efficient symbolic state-space traversal approach, depending on the disjunctive partitioning technique, is presented and the correctness of it is proved. Finally, the efficiency of the presented approach is demonstrated on a set of benchmark examples.

作者: Z. Fei K. (A)kesson B. Lennartson

会议类型: 国际会议

会议名称: 2011 IEEE International Conference on Robotics and Automation(2011年IEEE世界机器人与自动化大会 ICRA 2011)

会议地点: 上海

会议语种:英文

页码: 4364-4369

在线出版日期: 2011-05-09（万方平台首次上网日期，不代表论文的发表时间）