CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Reduced-order synthesis of operation sequences

Mohammad Reza Shoaei (Institutionen för signaler och system, Automation) ; Sajed Miremadi (Institutionen för signaler och system, Automation) ; Kristofer Bengtsson (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, Automation)
IEEE 16th Conference on Emerging Technologies and Factory Automation, ETFA 2011, Toulouse, 5-9 September 2011 (1946-0740). p. 8. (2011)
[Konferensbidrag, refereegranskat]

In flexible manufacturing systems a large number of operations need to be coordinated and supervised to avoid blocking and deadlock situations. The synthesis of such supervisors soon becomes unmanageable for industrial manufacturing systems, due to state space explosion. In this paper we therefore develop some reduction principles for a recently presented model based on self-contained operations and sequences of operations. First sequential operation behaviors are identified and related operation models are simplified into one model. Then local transitions without interaction with other operation models are removed. This reduction principle is applied to a synthesis of non-blocking operation sequences, where collisions among moving devices are guaranteed to be avoided by a flexible booking process. The number of states in the synthesis procedure and the computation time is reduced dramatically by the suggested reduction principle.

Nyckelord: supervisory control theory (SCT), extended finite automata, model abstraction



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-12-02. Senast ändrad 2016-09-14.
CPL Pubid: 149417

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)