Multiple Swarm Relay-Races with Alternative Routes | SpringerLink
Skip to main content
Springer Nature Link
Log in

Multiple Swarm Relay-Races with Alternative Routes

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10941))

Included in the following conference series:

  • 1583 Accesses

Abstract

Competition of swarms, every of which performs a conveyor cooperation of units, operated in physical time, is considered. Such sort of races objectively exists in economics, industry, defense, etc. It is shown, that natural approach to modeling of multiple relay-race with alternative routes is M-parallel semi-Markov process. Due to alternation there are multiple arks in the graph, represented the structure of semi-Markov process. Notion «the space of switches» is introduced. Formulae for calculation the number of routes in the space of switches, stochastic and time characteristics of wandering through M-parallel semi-Markov process are obtained. Conception of distributed forfeit, which depends on stages difference of swarm units, competed in pairs, is proposed. Dependence for evaluation of total forfeit of every participant is obtained. It is shown, that sum of forfeit may be used as optimization criterion in the game strategy optimization task.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Heymann, M.: Concurrency and discrete event control. IEEE Control Syst. Mag. 10, 103–112 (1990)

    Article  Google Scholar 

  2. Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 100–113. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45220-1_11

    Chapter  Google Scholar 

  3. Ivutin, A.N., Larkin, E.V.: Simulation of concurrent games. Bull. South Ural State Univ. Ser. Math. Model. Program. Comput. Softw. Chelyabinsk 8(2), 43–54 (2015)

    MATH  Google Scholar 

  4. Valk, R.: Concurrency in communicating object petri nets. In: Agha, Gul A., De Cindio, F., Rozenberg, G. (eds.) Concurrent Object-Oriented Programming and Petri Nets. LNCS, vol. 2001, pp. 164–195. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45397-0_5

    Chapter  MATH  Google Scholar 

  5. Larkin, E.V., Ivutin, A.N., Kotov, V.V., Privalov, A.N.: Simulation of relay-races. Bull. South Ural State Univ. Math. Model. Program. Comput. Softw. 9(4), 117–128 (2016)

    MATH  Google Scholar 

  6. Mark, S.: Squillante stochastic analysis and optimization of multiserver systems. In: Ardagna, D., Zhang, L. (eds.) Run-Time Models for Self-managing Systems and Applications. Mathematic Subject Classification, pp. 1–25. Springer, Basel (2010). https://doi.org/10.1007/978-3-0346-0433-8_1

    Chapter  Google Scholar 

  7. Larkin, E.V., Ivutin, A.N.: Estimation of latency in embedded real-time systems. In: 3rd Mediterranean Conference on Embedded Computing (MECO 2014), Budva, Montenegro, pp. 236–239 (2014)

    Google Scholar 

  8. Korolyuk, V., Swishchuk, A.: Semi-Markov Random Evolutions. Springer, Dordrecht (1995). https://doi.org/10.1007/978-94-011-1010-5. 309 p.

    Book  MATH  Google Scholar 

  9. Iverson, M.A., Ozguner, F., Follen, G.J.: Run-time statistical estimation of task execution times for heterogeneous distributed computing. In: Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing, pp. 263–270 (1996)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  11. Markov, A.A.: Extension of the law of large numbers to dependent quantities. Izvestiia Fiz.-Matem. Obsch. Kazan Univ., 2nd Ser., pp. 135–156 (1906)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Janssen, J., Manca, R.: Applied Semi-Markov processes. Springer, Boston (2006). https://doi.org/10.1007/0-387-29548-8. 310 p.

    Book  MATH  Google Scholar 

  14. Larkin, E., Ivutin, A., Kotov, V., Privalov, A.: Semi-Markov modelling of commands execution by mobile robot. In: Ronzhin, A., Rigoll, G., Meshcheryakov, R. (eds.) ICR 2016. LNCS (LNAI), vol. 9812, pp. 189–198. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-43955-6_23

    Chapter  Google Scholar 

  15. Bauer, H.: Probability Theory, 523 p. Walter de Gruyter, Berlin (1993)

    MATH  Google Scholar 

  16. Shiryaev, A.N.: Probability. Springer, New York (1996). https://doi.org/10.1007/978-1-4757-2539-1. 611 p.

    Book  MATH  Google Scholar 

  17. Bellman, R.E.: Dynamic Programming. Dover Publications, Inc., New York (2003). 339 p.

    MATH  Google Scholar 

  18. Myerson, R.B.: Game Theory. Harvard University Press, Cambridge (1997). 568 p.

    MATH  Google Scholar 

  19. Goetz, B., Peierls, T.: Java Concurrency in Practice. Addison Wesley, Reading (2006). 403 p.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tula State University, 300012, Tula, Russia

    Eugene Larkin, Vladislav Kotov & Alexey Bogomolov

  2. Tula State Pedagogical University, 300026, Tula, Russia

    Aleksandr Privalov

Authors
  1. Eugene Larkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladislav Kotov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Aleksandr Privalov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexey Bogomolov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eugene Larkin .

Editor information

Editors and Affiliations

  1. Peking University, Beijing, China

    Ying Tan

  2. Southern University of Science and Technology, Shenzhen, China

    Yuhui Shi

  3. Tongji University, Shanghai, China

    Qirong Tang

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Larkin, E., Kotov, V., Privalov, A., Bogomolov, A. (2018). Multiple Swarm Relay-Races with Alternative Routes. In: Tan, Y., Shi, Y., Tang, Q. (eds) Advances in Swarm Intelligence. ICSI 2018. Lecture Notes in Computer Science(), vol 10941. Springer, Cham. https://doi.org/10.1007/978-3-319-93815-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93815-8_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93814-1

  • Online ISBN: 978-3-319-93815-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation