Planning on Discrete Events Systems: A logical approach

This paper deals with the planning problem in manufacturing systems, by proposing a method to find a sequence of events in a supervisor that maximizes the parallelism among equipment. The supervisor is obtained using the Supervisory Control Theory and it implements the supremal controllable sublangu...

Full description

Saved in:
Bibliographic Details
Published in2016 IEEE International Conference on Automation Science and Engineering (CASE) pp. 1055 - 1060
Main Authors Alves, Lucas V. R., Bravo, Hugo J., Pena, Patricia N., Takahashi, Ricardo H. C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2016
Subjects
Automata
Discrete-event systems
Fats
Planning
Production facilities
Supervisory control
Online AccessGet full text

Cover

More Information
Summary:This paper deals with the planning problem in manufacturing systems, by proposing a method to find a sequence of events in a supervisor that maximizes the parallelism among equipment. The supervisor is obtained using the Supervisory Control Theory and it implements the supremal controllable sublanguage contained in the desired behavior of the system. The main objective is to find, among all executions allowed by the supervisor, the one that accumulates more equipment working at the same time during the whole production process. To do so, a function that defines, for each state of the automaton, the information of how many tasks are active is established. Then, the problem can be transformed into a longest path problem in an acyclic graph.
ISSN:2161-8089
DOI:10.1109/COASE.2016.7743520