On Dynamical Systems for Transport Logistic and Communications
- Alexander Buslaev
- Alexander Tatashev
Abstract
In this paper a discrete dynamical system is considered . There is a dial with $N$ positions (vertices) and $M$ particles. Particles are located in vertices. Each particle moves, at every time unit, in accordance with its plan. The plan is logistics, given through a real number which belongs to the segment $[0,1].$ The number is represented in positional numeral system with base $N$ equal to the number of vertices. A competition takes place if particles must move in opposite directions simultaneously. A rule of competition resolution is given. Systems characteristics are investigated for sets of rational and irrational plans. Some algebraic constructions are introduced for this purpose. Probabilistic analogues (random walks) are also considered.- Full Text:
PDF
- DOI:10.5539/jmr.v8n4p195
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org