检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:朴美燕 胡毅[2,3] 叶迎萍 PIAO Mei-Yan;HU Yi;YE Ying-Ping(University of Chinese Academy of Sciences,Beijing 100049,China;National Engineering Research Center for High-End CNC,Shenyang Institute of Computing Technology,Chinese Academy of Sciences,Shenyang 110168,Chin;Shenyang Golding NC Technology Corporation Ltd.,Shenyang 110168,China)
机构地区:[1]中国科学院大学,北京100049 [2]中国科学院沈阳计算技术研究所高档数控国家工程研究中心,沈阳110168 [3]沈阳高精数控技术有限公司,沈阳110168
出 处:《计算机系统应用》2018年第10期196-201,共6页Computer Systems & Applications
基 金:"高档数控机床与基础制造装备"国家科技重大专项(2017ZX04011004)~~
摘 要:针对基于Unity引擎的车间仿真系统加载过程中内存占用大,导致系统在运行时存在卡顿、不流畅的现象,从模型资源加载角度设计一种资源动态调度算法.首先通过四叉树算法将场景递归的分割成多个叶子节点进行存储,然后结合资源动态调度算法以摄像机位置为中心对周边节点的资源进行预设实例化和预设销毁完成内存的管理.最后根据Unity的内存管理机制,设计并实现了对场景资源的动态调度和内存优化,实验结果表明资源动态管理算法有效控制某时刻内存中加载的数据量相对稳定降低了IO总量,避免了漫游移动时造成的内存颠簸,使系统的运行更加流畅.Unity engine-based manufacturing simulation system occupies large memory when loading, resulting that the system is not fluent at run time and cannot run smoothly. In response to this phenomenon, we design a resource dynamic scheduling algorithm from the perspective of model resource loading. Firstly, the scene is recursively divided into a plurality of leaf nodes for storing through a quad-tree algorithm. Then, combined with the resource dynamic scheduling algorithm, taking the camera position as the center, the resources of surrounding nodes are defaulted instance and destruction of the prefab to complete the memory management. Finally, according to Unity's memory management mechanism, the dynamic scheduling and memory optimization of scene resources are designed and implemented.
关 键 词:UNITY 数字化车间系统 性能优化 资源动态调度算法 四叉树算法
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.233