计算机工程与应用2019，Vol.55Issue(5)：129-134,6.DOI:10.3778/j.issn.1002-8331.1805-0056
基于改进A*算法的导购路径规划方法
Method of Shopping Guide Path Planning Based on Modified A*Algorithm
钟志峰 1易明星 1陈智军 1谭普 1曾张帆1
作者信息
- 1. 湖北大学 计算机与信息工程学院,武汉 430062
- 折叠
摘要
Abstract
Due to the large number of products in large supermarkets and the complex space environment, customers often spend a lot of time shopping to find the purchase of goods. In response to this problem, the genetic&modified A*algorithm is proposed to help customers find a shortest path to the desired purchase. First, the matrix is used to model the spatial layout of the supermarket. Then, the shortest path between any two commodities can be found by using the modified A* algorithm. Next, according to the customer’s shopping list a shortest path can be optimized by genetic algorithm, which includes the supermarket entrance, the shopping list, and the supermarket exit. Finally, the simulation results show that in a large supermarket with multiple floors, the more different commodities the customer purchases, the better optimi-zation ability the genetic&modified A*algorithm has, the better quality of solution is, the shorter running time is required, which can efficiently solve the shortest path planning problem.关键词
超市导购/环境建模/遗传-改进A*算法Key words
supermarket shopping guide/ environmental modeling/ genetic&modified A*algorithm分类
信息技术与安全科学引用本文复制引用
钟志峰,易明星,陈智军,谭普,曾张帆..基于改进A*算法的导购路径规划方法[J].计算机工程与应用,2019,55(5):129-134,6.
