Skip to main content

About Approach of the Transactions Flow to Poisson One in Robot Control Systems

  • Conference paper
  • First Online:
Interactive Collaborative Robotics (ICR 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10459))

Included in the following conference series:

Abstract

Flows of transactions in digital control systems of robots are investigated. On the base of the fact, that uses the conception of Poisson character of transactions flow permits to simplify analytical simulation of robot control process, the problem of estimation the degree of approach of real flow to Poisson one is putted on. Proposed the criterion based on evaluation of expectation of waiting function. On the example of investigation of “competition” in the swarm of robots it is shown that flow of transactions, generated by swarm, when quantity of robots aspire to infinity approximately aspire to Poisson one.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Tzafestas, S.G.: Introduction to Mobile Robot Control. Elsevier, Amsterdam (2014)

    Google Scholar 

  2. Kahar1, S., Sulaiman1, R., Prabuwono1, A.S., Akma, N., Ahmad, S.A., Abu Hassan, M.A.: A review of wireless technology usage for mobile robot controller. In: International Conference on System Engineering and Modeling (ICSEM 2012), International Proceedings of Computer Science and Information Technology IPCSIT, vol. 34, pp. 7–12 (2012)

    Google Scholar 

  3. Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics. Intelligent Robotics and Autonomous Agents series. MIT Press, Cambridge (2005)

    MATH  Google Scholar 

  4. Ching, W.-K., Huang, X., Ng, M.K., Siu, T.K.: Markov Chains: Models, Algorithms and Applications. International Series in Operations Research & Management Science, vol. 189. Springer Science+Business Media New York, New York (2013)

    MATH  Google Scholar 

  5. Pang, G., Zhou, Y.: Two-parameter process limits for an infinite-server queue with arrival dependent service times. Stoch. Process. Appl. 127(5), 1375–1416 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mathijsen, B., Zwart, B.: Transient error approximation in a Lévy queue. Queueing Syst. 85(3), 269–304 (2017)

    Article  MathSciNet  Google Scholar 

  7. Larkin, E.V., Ivutin, A.N., Kotov, V.V., Privalov, A.N.: Interactive generator of commands. In: Tan, Y., Shi, Y., Li, L. (eds.) ICSI 2016. LNCS, vol. 9713, pp. 601–609. Springer, Cham (2016). doi:10.1007/978-3-319-41009-8_65

    Google Scholar 

  8. Limnios, N., Swishchuk, A.: Discrete-time semi-Markov random evolutions and their applications. Adv. Appl. Probab. 45(1), 214–240 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Markov, A.A.: Extension of the law of large numbers to dependent quantities. Izvestiia Fiz.-Matem 2, 135–156 (1906)

    Google Scholar 

  10. Lu, H., Pang, G., Mandjes, M.: A functional central limit theorem for Markov additive arrival processes and its applications to queueing systems. Queueing Syst. 84(3), 381–406 (2016)

    Article  MathSciNet  Google Scholar 

  11. Bielecki, T.R., Jakubowski, J., Niewęgłowski, M.: Conditional Markov chains: properties, construction and structured dependence. Stoch. Process. Appl. 127(4), 1125–1170 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  12. Maronna, R.M., Victor, J., Yohai, V.J.: Robust functional linear regression based on splines. Comput. Stat. Data Anal. 65, 46–55 (2013)

    Article  MathSciNet  Google Scholar 

  13. Muler, N., Yohai, V.J.: Robust estimation for vector autoregressive models. Comput. Stat. Data Anal. 65, 68–79 (2013)

    Article  MathSciNet  Google Scholar 

  14. Rank, M.K.: Correlation Methods, vol. 196. Charles Griffin & Company, London (1955)

    Google Scholar 

  15. Boos, D.D., Stefanski, L.A.: Essential Statistical Inference: Theory and Methods, vol. 568 (XVII). Springer, New York (2013)

    Book  MATH  Google Scholar 

  16. Wang, B., Wertelecki, W.: Density estimation for data with rounding errors. Comput. Stat. Data Anal. 65, 4–12 (2013)

    Article  MathSciNet  Google Scholar 

  17. Luedicke, J., Bernacchia, A.: Self-consistent density estimation. Stata J. 14(2), 237–258 (2014)

    Google Scholar 

  18. Grigelionis, B.: On the convergence of sums of random step processes to a Poisson process. Theory Probab. 8, 177–182 (1963)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eugene Larkin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Larkin, E., Bogomolov, A., Gorbachev, D., Privalov, A. (2017). About Approach of the Transactions Flow to Poisson One in Robot Control Systems. In: Ronzhin, A., Rigoll, G., Meshcheryakov, R. (eds) Interactive Collaborative Robotics. ICR 2017. Lecture Notes in Computer Science(), vol 10459. Springer, Cham. https://doi.org/10.1007/978-3-319-66471-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66471-2_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66470-5

  • Online ISBN: 978-3-319-66471-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics