检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张康帅 彭磊[2] ZHANG Kangshuai;PENG Lei(School of Mechanical&Automotive Engineering,South China University of Technology,Guangzhou 510641,China;Shenzhen Institutes of Advanced Technology,Chinese Academy of Sciences,Shenzhen 518055,China)
机构地区:[1]华南理工大学机械与汽车工程学院,广州510641 [2]中国科学院深圳先进技术研究院,深圳518055
出 处:《集成技术》2020年第5期48-57,共10页Journal of Integration Technology
基 金:深圳市基础研究学科布局项目(JCYJ20180507182628567)。
摘 要:覆盖模型通常用于评估空间网络站点规划及网络健壮性,而可视化的覆盖模型可以快速清晰地传递信息,有助于用户理解和分析相关空间数据。该研究基于城市级停车场服务能力空间网络模型,提出了一种可视的动态覆盖方法,其通过ParkingRank算法对各停车场的服务能力进行动态量化,采用具有边界约束的改进加权Voronoi图,将各停车场的量化值映射到地理空间,实现了对整个城市区域无缝且不重叠的覆盖。该模型最大的优点是每个停车场的覆盖范围可随其量化值的变化而动态调整,实现了停车场网络模型的动态可视化,可为未来城市级停车管理与服务提供强大的决策支持。Visualized coverage model is usually applied for the evaluation of site planning and networks robustness in the spatial networks, which can help the users to understand and analyse the spatial data. In this work, a spatial network model of city-wide carparks service capabilities is studied in a visual dynamic coverage way. Firstly, the ParkingRank algorithm was used to model dynamic service capability of each parking lots in real time. Then, an improved weighted Voronoi diagram featuring boundary constraint was introduced to map the ranking value of each carpark to the geospatial space, forming a seamless and nonoverlap coverage over the city. Advantage of the proposed model is that, the coverage scope of each carpark can be adjusted dynamically according to its changing ranking value. By visualizing the parking lots network, it can provide great helps for the city-wide parking management.
关 键 词:停车引导信息系统 动态覆盖 ParkingRank 加权Voronoi图
分 类 号:TG156[金属学及工艺—热处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145