Dispatching of robotic control programs. (English) Zbl 1357.93065

Summary: The problem of dispatching discipline choice when managing programs are linked into unified multi-loop computer control system is considered. It is shown that a problem of control of such a system may be reduced to the problem of evaluation of states both robot and controller. In multi-circuit computer control systems time intervals of residence of robot in any state depends on both time complexity of control algorithm and dispatching discipline. Two simplest disciplines of most common use are investigated: the cyclic dispatching and foreground (quasi-stochastic) one. With use the formalism of semi-Markov process models of functioning of control programs under investigated dispatching disciplines are worked out. Mathematical relationships for time of return to any state of semi-Markov process and time between switches are obtained. The parameters obtained are essential for choice the efficient regimes of data processing when control of robots.


93C85 Automated systems (robots, etc.) in control theory
Full Text: DOI


[1] [1] S.G. Tzafestas, Introduction to mobile robot control, Elsevier, 2013, ISBN: 978-0-12-417049-0
[2] [2] S. Kahar, R. Sulaiman, A. Prabuwono, N. Ahmad, ”Review of Wireless Technology Usage for Mobile Robot Controller”, International Conference on System Engineering and Modeling (ICSEM 2012), IPCSIT, 43, 2012, 7–12
[3] [3] Z. Wang, M. Liang, P.G. Maropoulos, ”High accuracy mobile robot positioning using external large volume metrology instruments”, International Journal of Computer Integrated Manufacturing, 24:5 (2011), 484–492
[4] [4] Г. Олссон, Д. Пиани, Цифровые системы автоматизации и управления, Невский диалект, СПб., 2001, 557 с. [G. Olsson, D. Piani, Computer Systems for Automation and Control, Nevskij dialekt, Sant Petersburg, 2001, 557 pp.] · Zbl 0342.02023
[5] [5] E. Hyytiä, A. Penttinen, S. Aalto, ”Size-and state-aware dispatching problem with queue-specific job sizes”, European Journal of Operational Research, 217:2 (2011), 357–370 · Zbl 1244.90065
[6] [6] V. Vishnevsky, A. Dudin, V. Klimenok, O. Semenova, S. Shpilev, ”Approximate Method to Study M/G/1-Type Polling System with Adaptive Polling Mechanism”, Quality Technology & Quantitative Management, 9:2 (2011), 211–228
[7] [7] A. Howard, Dynamic Probabilistic Systems, v. I, Markov Models, Courier Corporation, 2012, 608 pp.
[8] [8] A. Howard, Dynamic Probabilistic Systems, v. II, Semi-Markov and Decision Processes, Courier Corporation, 2013, 576 pp.
[9] [9] M. Meerschaert, P. Straka, et al., ”Semi-Markov approach to continuous time random walk limit processes”, The Annals of Probability, 42:4 (2014), 1699–1723 · Zbl 1305.60089
[10] [10] M. Iverson, F. Özgüner, G. Follen, ”Run-time statistical estimation of task execution times for heterogeneous distributed computing”, High Performance Distributed Computing, Proceedings 5th IEEE International Symposium, IEEE, 1996, 263–270
[11] [11] A. Ivutin, E. Larkin, ”Estimation of latency in embedded real-time systems”, 2014 3rd Mediterranean Conference on Embedded Computing (MECO) (Institute of Electrical & Electronics Engineers (IEEE), 2014), 236–239
[12] [12] A. Ivutin, E. Larkin, Y. Lutskov, ”Evaluation of program controlled objects states”, Embedded Computing (MECO), 2015 4th Mediterranean Conference on IEEE, IEEE, 2015, 250–253
[13] [13] A. Ivutin, E. Larkin, V. Kotov, ”Established Routine of Swarm Monitoring Systems Functioning”, Advances in Swarm and Computational Intelligence, Springer Science + Business Media, 2015, 415–422
[14] [14] G. Fishman, Monte Carlo: concepts, algorithms, and applications, Springer Series in Operations Research and Financial Engineering, Springer Science & Business Media, New York, 2003, 698 pp.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.