ICRA 2011 Paper Abstract

Close

Paper WeP213.4

Fei, Zhennan (Chalmers University of Technology), Akesson, Knut (Chalmers University of Technology), Lennartson, Bengt (Chalmers University of Technoloogy)

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

Scheduled for presentation during the Regular Sessions "Factory Automation" (WeP213), Wednesday, May 11, 2011, 16:10−16:25, Room 5I

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on December 10, 2019

Keywords Discrete Event Dynamic Automation Systems, AI Reasoning Methods, Intelligent and Flexible Manufacturing

Abstract

Supervisory Control Theory (SCT) is a model-based 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.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2019 PaperCept, Inc.
Page generated 2019-12-10  04:39:35 PST  Terms of use