Search

Show simple item record

dc.contributor.authorKrasnov, E. S.
dc.contributor.authorBagaev, D. V.
dc.coverage.spatialБрест
dc.date.accessioned2024-03-04T12:36:29Z
dc.date.available2024-03-04T12:36:29Z
dc.date.issued2014
dc.identifier.citationKrasnov, E. S. Pathfinding algorithms efficiency estimating in discrete labyrinth based on software simulation / E. S. Krasnov, D.V. Bagaev // Робототехника и искусственный интеллект. Проблемы и перспективы = Robotics and Artificial Intelligence. Problems and Perspectives : материалы международной научно-практической конференции, Брест, 4–6 ноября 2013 г. / Министерство образования Республики Беларусь, Брестский государственный технический университет ; редкол.: В. С. Рубанов (гл. ред.) [и др.]. – Брест : БрГТУ, 2014 – С. 35-41. – Библиогр.: с. 41 (1 назв.).
dc.identifier.urihttps://rep.bstu.by/handle/data/41695
dc.language.isoenru
dc.publisherБрГТУ
dc.titlePathfinding algorithms efficiency estimating in discrete labyrinth based on software simulationru
dc.typeНаучный доклад (Working Paper)
dc.abstract.alternativeThis article continues the research, started in the first article - «Strategy о/ analyzing most соттоп algorithms for path finding in discrete labyrinth using softwore statistic data collector» (1). lt is dedicated to experiment's overview and summarizing its results . The соттоn structure оf the experiment, its stages, collecting data and methods оf its processing аrе described. The main conclusions аrе made at the end оf this article. Keywords - algorithms, maze solving, data analyzing, software simulation


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record