Planning on discrete events systems: a logical approach
Carregando...
Data
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Federal de Minas Gerais
Descrição
Tipo
Artigo de evento
Título alternativo
Primeiro orientador
Membros da banca
Resumo
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 paral
lelism 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.
Abstract
Assunto
Controle automático, Automação industrial, Grafos aleatórios
Palavras-chave
Citação
Departamento
Curso
Endereço externo
https://ieeexplore.ieee.org/document/7743520