首页> 外文期刊>Symmetry >Graph Cellular Automata with Relation-Based Neighbourhoods of Cells for Complex Systems Modelling: A Case of Traffic Simulation
【24h】

Graph Cellular Automata with Relation-Based Neighbourhoods of Cells for Complex Systems Modelling: A Case of Traffic Simulation

机译:图元自动机与基于关系的单元格邻域的复杂系统建模:交通仿真案例

获取原文
       

摘要

A complex system is a set of mutually interacting elements for which it is possible to construct a mathematical model. This article focuses on the cellular automata theory and the graph theory in order to compare various types of cellular automata and to analyse applications of graph structures together with cellular automata. It proposes a graph cellular automaton with a variable configuration of cells and relation-based neighbourhoods (r?¢????GCA). The developed mechanism enables modelling of phenomena found in complex systems (e.g., transport networks, urban logistics, social networks) taking into account the interaction between the existing objects. As an implementation example, modelling of moving vehicles has been made and r?¢????GCA was compared to the other cellular automata models simulating the road traffic and used in the computer simulation process.
机译:复杂的系统是一组相互影响的元素,可以为它们构建数学模型。本文重点讨论元胞自动机理论和图论,以比较各种类型的元胞自动机,并分析图结构与元胞自动机的应用。它提出了一个具有可变单元格配置和基于关系的邻域(r ?????????? GCA)的图元细胞自动机。考虑到现有对象之间的交互作用,开发的机制可以对复杂系统(例如,运输网络,城市物流,社交网络)中发现的现象进行建模。作为一个实施例,已经对移动车辆进行了建模,并且将GCA与其他模拟道路交通的元胞自动机模型进行了比较,并在计算机模拟过程中使用了GCA。

著录项

  • 来源
    《Symmetry》 |2017年第12期|共页
  • 作者

    Krzysztof Ma?ecki;

  • 作者单位
  • 收录信息
  • 原文格式 PDF
  • 正文语种
  • 中图分类 生理学;
  • 关键词

  • 入库时间 2022-08-18 13:50:46

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号