Gasket of optimal routes on digital raster maps
Main Article Content
Abstract
In-process offered approach to the decision of navigation task of tracing of routes of motion of mobile objects on a rectangular cartographic area. It is shown that for the decision of task to optimization of gasket of route on digital maps most suitable is the use of algorithm of Bellman. It is suggested to bring a raster map over to the type of rectangular grate, suitable to treatment the method of Bellman by a sectional quantum. Job of the worked out software performances over are brought.
Reference 8, figures 4.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
Gelfand I.M., Fomin S.V. (1961), “Variation calculation”. М.: “Fizmatlit”, P. 227. (Rus)
Scherbina O.A. (2007), “Methodological aspects of the dynamic programming”. Dynamic systems. No 22. Pp. 21-36. (Rus)
Bellman P., Dreyfus S. (1965), “Applied tasks of the dynamic programming of”. Moscow. P. 247. (Rus)
Sigal I.H., Ivanova A.P. (2003), “Introduction to the application discrete programming: models and computational algorithms. it is a 2th publ”. М.: "Fizmalit", P.p. 134-136 (Rus)
Guzman I.S., Kirichuk V.S., Kosih V.P., Peretyzgin G.I. (2000), “Digital processing of images in the informative systems”. Novosibirsk: NGTU, p. 14-20. (Rus)
Liu, S., Liu, F. and Tang, F. (2010), “Cooperative transport strategy for formation control of multiple mobile robots,” Journal of Zhejiang University, Science C, vol 11, pp. 1-13.
Chamoun, P. (2012), “Rigorous Movement of Convex Polygons on a Path Using Multiple Robots”. Master's Thesis, School of Computer Science, Carleton University, Ottawa, Canada.
Stout B. SmartMoves: IntelligentPathfinding. http://algolist.manual.ru/games/ smartmove.php).
