基于指引可达性的指路标志布设优化模型

发布时间：2018-03-20 02:34

本文选题：指路标志　切入点：指引可达性　出处：《中山大学学报(自然科学版)》2014年03期 　论文类型：期刊论文

【摘要】：为了更好地实现指路标志的指引可达性,结合已有研究对指路标志的布设优化进行了探讨。以指引可达性分析模型为基础,定义指路标志布设的连续路径(指引可达)与初级路径(指引不可达)。然后构建把初级路径扩展为连续路径的优化算法模型。模型中,定义衡量扩展指引路径选取的两大优化指标即指引距离和需增设的指引信息数量,基于网络分析算法,在路网中搜索指引路径,动态更新优化指标,并在最优扩展指引路径中增设指引信息,实现指路标志的指引可达。把算法模型应用广州大学城指路标志诱导系统中,对指定的道路进行优化,使所有指引信息构成路径都是可达的。实例表明:该优化算法模型是有效可行的。
[Abstract]:In order to realize the guidance accessibility of the guide mark better, this paper discusses the layout optimization of the guide mark based on the analysis model of the guide accessibility. Define the continuous path (directive reachability) and the primary path (unreachable). Then construct the optimization algorithm model to extend the primary path to continuous path. In the model, This paper defines two optimization indexes to measure the selection of extended guidance path, that is, the guidance distance and the amount of guidance information to be added. Based on the network analysis algorithm, we search for the guide path in the road network and dynamically update the optimization index. In addition, the guidance information is added to the optimal extended guidance path to realize the guidance of the guide sign. The algorithm model is applied to the guidance guidance system of Guangzhou University City to optimize the designated road. An example shows that the optimization algorithm model is effective and feasible.
【作者单位】：中山大学工学院∥广东省智能交通系统重点实验室;
【基金】：国家自然科学基金资助项目(51178475) 广东省科技计划资助项目(2012B010100023) 广州市科技计划资助项目(2011Y3-00061)
【分类号】：U491.52

【参考文献】