Отрывок: Let T :M (cA; cB)→ R the functional of time which is required to going through cellular route. If values of the ui j do not change in a time of the movement from the point A to the point B, then the problem (1)–(3) can be represented as discrete problem T (M) = th ∑ (i, j)∈M ‖di j‖ui j → min . It is clear that possible to minimize functional Th(M) = ∑ (i, j)∈M ‖di j‖ui j → min instead functional T . It is possibly (but not very easy) to proof that the aforementioned CA act...
Полная запись метаданных
Поле DC Значение Язык
dc.contributor.authorKuznetsov, Al.V .-
dc.date.accessioned2017-05-19 15:16:51-
dc.date.available2017-05-19 15:16:51-
dc.date.issued2017-
dc.identifierDspace\SGAU\20170517\63853ru
dc.identifier.citationKuznetsov Al.V. Cellular automata-based models of group motion and interaction of agents with memory // Сборник трудов III международной конференции и молодежной школы «Информационные технологии и нанотехнологии» (ИТНТ-2017) - Самара: Новая техника, 2017. - С. 1090-1095.ru
dc.identifier.urihttp://repo.ssau.ru/handle/Informacionnye-tehnologii-i-nanotehnologii/Cellular-automatabased-models-of-group-motion-and-interaction-of-agents-with-memory-63853-
dc.description.abstractThe paper is devoted to the construction of the motion and interaction model for agents with memory. Agents move on the landscape consisting of squares with different passability. We briefly described the cellular automata-based model with one common to all agents layer corresponding to the landscape and many agent-specific layers corresponding to an agent’s memory. Methods for the random landscape generation and for the simulation of a communication system are developed. Also, we studied a connection between the discrete and the continuous formulation of the agent motion model and found several dependencies between parameters of the model.ru
dc.language.isoenru
dc.publisherНовая техникаru
dc.subjectcellular automatonru
dc.subjectmotion modelru
dc.subjectconflict modelru
dc.subjectagent systemru
dc.subjectrandom landscape generationru
dc.subjectlandscape metricsru
dc.titleCellular automata-based models of group motion and interaction of agents with memoryru
dc.typeArticleru
dc.textpartLet T :M (cA; cB)→ R the functional of time which is required to going through cellular route. If values of the ui j do not change in a time of the movement from the point A to the point B, then the problem (1)–(3) can be represented as discrete problem T (M) = th ∑ (i, j)∈M ‖di j‖ui j → min . It is clear that possible to minimize functional Th(M) = ∑ (i, j)∈M ‖di j‖ui j → min instead functional T . It is possibly (but not very easy) to proof that the aforementioned CA act...-
Располагается в коллекциях: Информационные технологии и нанотехнологии

Файлы этого ресурса:
Файл Описание Размер Формат  
paper 192_1090-1095.pdfОсновная статья399.79 kBAdobe PDFПросмотреть/Открыть
Показать базовое описание ресурса Просмотр статистики
Поделиться:



Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.