Based on the SIEMENS PLC control system, a multi agent system model of e workshop is established. The real-time data transmission problem and delay model are analyzed. On this basis, the traditional Greedy algorithm is improved and applied to multi Agent systems. The simulation results show that the algorithm can effectively improve the efficiency of system scheduling. The more tasks the system has, the longer the scheduling time saved.
REFERENCES
1.
F.
Dopatka
and R.
Wismuller
, “A top-down approach for realtime industrial-ethernet networks using edge-colouring of conflict multigraphs
,” in International Symposium on Power Electronics, Electrical Drives, Automation and Motion, 2006. (SPEEDAM 2006. may
2006
), pp. 883
–890
.2.
L.
Wisniewski
, M.
Schumacher
, J.
Jasperneite
, and S.
Schriegel
, “Fast and simple scheduling algorithm for profinet irt networks
,” in Factory Communication Systems
(WFCS, 2012 9th IEEE International Workshop on
, May 2012
), pp. 141
–144
.3.
W.
Steiner
, “An evaluation of smt-based schedule synthesis for time-triggered multi-hop networks
,” in Real-Time Systems Symposium
(RTSS, 2010 IEEE 31st
, Nov 2010
), pp. 375
–384
.4.
Z.
Hanzalek
, P.
Burget
, and P.
Sucha
, “Profinet io irt message scheduling with temporal constraints
,” IEEE Transactions on Industrial Informatics
, (Aug. 2010
), vol. 6
, no. 3
, pp. 369
–380
.5.
Z. Y.
Xie
, “Searching Algorithm of Greedy Chemical Trees with Minimal Atom-bond Connectivity Index
.” Proceedings of 2016 International Conference on Mathematical, Computational and Statistical Sciences and Engineering (MCSSE, 2016
). Science And Engineering Research Center
, 2016
(8
), pp. 235
–242
.6.
S.
Höme
, S.
Palis
, and C.
Diedrich
, Design of communication systems for networked control system running on PROFINET
. IEEE
, 2014
, 14
(3
), pp. 1025
–1032
.
This content is only available via PDF.
© 2019 Author(s).
2019
Author(s)
You do not currently have access to this content.
