[1] 朱荔, 熊坚. 驾驶人对城市指路标志认知需求研究[J]. 昆明理工大学学报(自然科学版), 2019, 44(4): 143- 150. [ZHU L, XIONG J. A research on driver's cognitive demand for urban traffic guide signs[J]. Journal of Kunming University of Science and Technology (Natural Science), 2019, 44(4): 143-150.]
[2] 肖国荣, 余志, 黄敏. 基于偏离指数的指路标志优化模型研究[J]. 中山大学学报(自然科学版), 2008(1): 38- 41, 46. [XIAO G R, YU Z, HUANG M. Research on optimization model for guide sign planning based on straying index[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2008(1): 38-41, 46.]
[3] 郭敏, 楼晓寅. 标志指路体系的模型[J]. 公路交通科技, 2009, 26(10): 130- 134, 148. [GUO M, LOU X Y. Model of travel guide sign system[J]. Journal of Highway and Transportation Research and Development, 2009, 26 (10): 130-134, 148.]
[4] 黄敏, 钮中铭, 李尔达, 等. 基于双圈覆盖法的兴趣点指路标志布设模型[J]. 计算机应用研究, 2015, 32(9): 2609-2612. [HUANG M, NIU Z M, LI E D, et al. Road guide sign deployment model for POI based on double circle covering method[J]. Application Research of Computers, 2015, 32(9): 2609-2612.]
[5] ZHENG J, HUANG M, LIU F, et al. Artificial bee colony algorithm for guiding the accessibility optimization problem of a guide sign system[C]// Cota International Conference of Transportation Professionals, 2016.
[6] 张腾, 黄敏, 刘芳, 等. 基于人工蜂群算法的交叉口指路标志设置优化方法[J]. 中山大学学报(自然科学版), 2019, 58(3): 131-139. [ZHANG T, HUANG M, LIU F, et al. Optimization method of intersection guide sign setting based on artificial bee colony algorithm[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2019, 58(3): 131-139.]
[7] 黄敏, 钮中铭, 李尔达, 等. 基于多目标优化的兴趣点指路标志布设模型[J]. 公路交通科技, 2015, 32(2): 154-158. [HUANG M, NIU Z M, LI E D, et al. Guide sign deployment model of POI based on multi-objective optimization[J]. Journal of Highway and Transportation Research and Development, 2015, 32(2): 154-158.]
[8] 黄敏, 郑健, 刘芳. 城市兴趣点指路标志指引路径规划模型及算法[J]. 交通运输系统工程工程与信息, 2016, 16(5): 172- 177, 184. [HUANG M, ZHENG J, LIU F. Model and algorithm of guiding path planning for urban POI guide signs[J]. Journal of Transportation Systems Engineering and Information Technology, 2016, 16(5): 172-177, 184.]
[9] HART P E, NILSSON N J, RAPHAEL B. A formal basis for the heuristic determination of minimum cost paths[J]. IEEE Transactions on Systems ence and Cybernetics, 1968, 4(2): 100-107.
[10] SEO W J, OK S H, AHN J H, et al. An efficient hardware architecture of the a- star algorithm for the shortest path search engine[C]//Fifth International Joint Conference on Inc. IEEE Computer Society, 2009.
[11] DUCHO? F, BABINEC A, KAJAN M, et al. Path planning with modified a star algorithm for a mobile robot[J]. Procedia Engineering, 2014, 96: 59-69.
[12] 朱云虹, 袁一. 基于改进 A*算法的最优路径搜索[J]. 计算机技术与发展, 2018, 28(4): 55-59. [ZHU Y H, YUAN Y. Optimal path search based on improved A* algorithm[J]. Computer Technology and Development, 2018, 28(4): 55-59.]
[13] 刘小明, 王蔚, 姜明, 等. 组合交通标志信息量阈值研究[J]. 交通运输工程学报, 2016, 16(1): 141-148. [LIU X M, WANG W, JIANG M, et al. Investigation of information quantity threshold on combined traffic signs [J]. Journal of Traffic and Transportation Engineering, 2016, 16(1): 141-148.] |