检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蒋敏敏 添玉[2] JIANG Minmin;TIAN Yu(Business School,Nanfang College Guangzhou,Guangzhou 510970;Logistics Engineering College,Shanghai Maritime University,Shanghai 201306,China)
机构地区:[1]广州南方学院商学院,广东广州510970 [2]上海海事大学物流工程学院,上海201306
出 处:《物流技术》2022年第12期74-79,共6页Logistics Technology
摘 要:围绕智能码头的应用需求,以最新的典型智能码头工艺为研究对象,采用栅格法对智能车辆运行区域构建环境地图,考虑路径长度、车辆转弯次数等因素,提出改进A^(*)算法,创新构建了估价函数和适应度函数,确保为车辆在线搜索到一条全局最优路径方案;为验证上述算法的有效性,开展了大规模场景下的数值模拟实验,分析比较不同路径规划算法的性能和路径优化指标,结果表明改进A^(*)算法所搜寻到的路径在转弯次数、路径长度、车辆到达状态等指标明显优于传统A^(*)算法。Based on the requirement of the intelligent port application, we took the latest typical intelligent port process as the research object, and used the grid method to build an environment map of the intelligent vehicle operation area. Considering factors such as path length and vehicle turn times, etc., we proposed an improved A^(*) algorithm, and innovatively constructed an evaluation function and fitness function to ensure that a global optimal path can be found for the vehicles through online search. To verify the effectiveness of said algorithm, we carried out a numerical simulation experiment in large-scale scenarios, analyzed and compared the performance and path optimization indexes of different route planning algorithms. The result showed that the path obtained through the improved A^(*) algorithm is obviously superior to that through the traditional A^(*) algorithm in terms of turn times, path length, and vehicle arrival state, etc.
分 类 号:F224.0[经济管理—国民经济] U653.93[交通运输工程—港口、海岸及近海工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30