Feedback control logic for forbidden state problem of marked graphs : Application to a real manufacturing system
Identifieur interne : 003756 ( Crin/Corpus ); précédent : 003755; suivant : 003757Feedback control logic for forbidden state problem of marked graphs : Application to a real manufacturing system
Auteurs : Asma Ghaffari ; Nidhal Rezg ; Xiaolan XieSource :
- IEEE Transactions on Automatic Control ; 2003.
English descriptors
- KwdEn :
Abstract
This paper addresses the forbidden state problem of general marked graphs with uncontrollable transitions. The models need not to be safe nor cyclic. Control requirements are expressed as the conjunction of General Mutual Exclusion Constraints (GMEC) of markings of so-called critical places. Structural properties such as influence paths and influence zones are proposed to perform the worst-case analysis for each GMEC specification with any given initial marking when only uncontrollable transitions are allowed. Efficient solutions are proposed for the determination of the maximal uncontrollably reachable marking of any critical place, and this for many possible, more or less general, configurations of the net structure, even for the case of overlapping paths of critical places. Besides, we demonstrate that these results can be easily extended to unbounded nets and when critical places have negative weights. For the most general case, when analytical solution is not available, a linear programming approach is proposed. The great advantage of the proposed approach over existing methods is emphasized by using it to solve the supervisory control problem of the automated manufacturing system of AIP-RAO of Lyon, France (Atelier Inter-établissements de Productique Rhône Alpes Ouest).
Links to Exploration step
CRIN:ghaffari03bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="455">Feedback control logic for forbidden state problem of marked graphs : Application to a real manufacturing system</title></titleStmt><publicationStmt><idno type="RBID">CRIN:ghaffari03b</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003756</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Feedback control logic for forbidden state problem of marked graphs : Application to a real manufacturing system</title><author><name sortKey="Ghaffari, Asma" sort="Ghaffari, Asma" uniqKey="Ghaffari A" first="Asma" last="Ghaffari">Asma Ghaffari</name></author><author><name sortKey="Rezg, Nidhal" sort="Rezg, Nidhal" uniqKey="Rezg N" first="Nidhal" last="Rezg">Nidhal Rezg</name></author><author><name sortKey="Xie, Xiaolan" sort="Xie, Xiaolan" uniqKey="Xie X" first="Xiaolan" last="Xie">Xiaolan Xie</name></author></analytic><series><title level="j">IEEE Transactions on Automatic Control</title><imprint><date when="2003" type="published">2003</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>manufacturing systems</term><term>marked graphs</term><term>state feedback</term><term>supervisory control</term><term>uncontrollable transitions</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="3552">This paper addresses the forbidden state problem of general marked graphs with uncontrollable transitions. The models need not to be safe nor cyclic. Control requirements are expressed as the conjunction of General Mutual Exclusion Constraints (GMEC) of markings of so-called critical places. Structural properties such as influence paths and influence zones are proposed to perform the worst-case analysis for each GMEC specification with any given initial marking when only uncontrollable transitions are allowed. Efficient solutions are proposed for the determination of the maximal uncontrollably reachable marking of any critical place, and this for many possible, more or less general, configurations of the net structure, even for the case of overlapping paths of critical places. Besides, we demonstrate that these results can be easily extended to unbounded nets and when critical places have negative weights. For the most general case, when analytical solution is not available, a linear programming approach is proposed. The great advantage of the proposed approach over existing methods is emphasized by using it to solve the supervisory control problem of the automated manufacturing system of AIP-RAO of Lyon, France (Atelier Inter-établissements de Productique Rhône Alpes Ouest).</div></front></TEI><BibTex type="article"><ref>ghaffari03b</ref><crinnumber>A03-R-013</crinnumber><category>1</category><equipe>MACSI</equipe><author><e>Ghaffari, Asma</e><e>Rezg, Nidhal</e><e>Xie, Xiaolan</e></author><title>Feedback control logic for forbidden state problem of marked graphs : Application to a real manufacturing system</title><journal>IEEE Transactions on Automatic Control</journal><year>2003</year><volume>48</volume><number>1</number><pages>18-29</pages><month>Jan</month><keywords><e>manufacturing systems</e><e>marked graphs</e><e>state feedback</e><e>supervisory control</e><e>uncontrollable transitions</e></keywords><abstract>This paper addresses the forbidden state problem of general marked graphs with uncontrollable transitions. The models need not to be safe nor cyclic. Control requirements are expressed as the conjunction of General Mutual Exclusion Constraints (GMEC) of markings of so-called critical places. Structural properties such as influence paths and influence zones are proposed to perform the worst-case analysis for each GMEC specification with any given initial marking when only uncontrollable transitions are allowed. Efficient solutions are proposed for the determination of the maximal uncontrollably reachable marking of any critical place, and this for many possible, more or less general, configurations of the net structure, even for the case of overlapping paths of critical places. Besides, we demonstrate that these results can be easily extended to unbounded nets and when critical places have negative weights. For the most general case, when analytical solution is not available, a linear programming approach is proposed. The great advantage of the proposed approach over existing methods is emphasized by using it to solve the supervisory control problem of the automated manufacturing system of AIP-RAO of Lyon, France (Atelier Inter-établissements de Productique Rhône Alpes Ouest).</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003756 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 003756 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Corpus
|type= RBID
|clé= CRIN:ghaffari03b
|texte= Feedback control logic for forbidden state problem of marked graphs : Application to a real manufacturing system
}}
| This area was generated with Dilib version V0.6.33. |  |