Automated Guided Vehicles(AGVs)have been introduced into various applications,such as automated warehouse systems,flexible manufacturing systems,and container terminal systems.However,few publications have outlined pr...Automated Guided Vehicles(AGVs)have been introduced into various applications,such as automated warehouse systems,flexible manufacturing systems,and container terminal systems.However,few publications have outlined problems in need of attention in AGV applications comprehensively.In this paper,several key issues and essential models are presented.First,the advantages and disadvantages of centralized and decentralized AGVs systems were compared;second,warehouse layout and operation optimization were introduced,including some omitted areas,such as AGVs fleet size and electrical energy management;third,AGVs scheduling algorithms in chessboardlike environments were analyzed;fourth,the classical route-planning algorithms for single AGV and multiple AGVs were presented,and some Artificial Intelligence(AI)-based decision-making algorithms were reviewed.Furthermore,a novel idea for accelerating route planning by combining Reinforcement Learning(RL)andDijkstra’s algorithm was presented,and a novel idea of the multi-AGV route-planning method of combining dynamic programming and Monte-Carlo tree search was proposed to reduce the energy cost of systems.展开更多
With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path...With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path finding(MAPF) algorithm is urgently needed to ensure the efficiency and realizability of the whole system. The complex terrain of outdoor scenarios is fully considered by using different values of passage cost to quantify different terrain types. The objective of the MAPF problem is to minimize the cost of passage while the Manhattan distance of paths and the time of passage are also evaluated for a comprehensive comparison. The pre-path-planning and real-time-conflict based greedy(PRG) algorithm is proposed as the solution. Simulation is conducted and the proposed PRG algorithm is compared with waiting-stop A^(*) and conflict based search(CBS) algorithms. Results show that the PRG algorithm outperforms the waiting-stop A^(*) algorithm in all three performance indicators,and it is more applicable than the CBS algorithm when a large number of AGVs are working collaboratively with frequent collisions.展开更多
This paper investigates the problem of path tracking control for autonomous ground vehicles(AGVs),where the input saturation,system nonlinearities and uncertainties are considered.Firstly,the nonlinear path tracking s...This paper investigates the problem of path tracking control for autonomous ground vehicles(AGVs),where the input saturation,system nonlinearities and uncertainties are considered.Firstly,the nonlinear path tracking system is formulated as a linear parameter varying(LPV)model where the variation of vehicle velocity is taken into account.Secondly,considering the noise effects on the measurement of lateral offset and heading angle,an observer-based control strategy is proposed,and by analyzing the frequency domain characteristics of the derivative of desired heading angle,a finite frequency H_∞index is proposed to attenuate the effects of the derivative of desired heading angle on path tracking error.Thirdly,sufficient conditions are derived to guarantee robust H_∞performance of the path tracking system,and the calculation of observer and controller gains is converted into solving a convex optimization problem.Finally,simulation examples verify the advantages of the control method proposed in this paper.展开更多
在静态栅格地图中,针对传统蚁群算法进行AGV(Automated Guided Vehicle,自动引导车)路径规划收敛慢且搜索结果容易陷入局部最优的问题,提出一种融合跳点搜索(Jump Point Search,JPS)和双向并行蚁群搜索的改进算法.首先,对实际研究环境...在静态栅格地图中,针对传统蚁群算法进行AGV(Automated Guided Vehicle,自动引导车)路径规划收敛慢且搜索结果容易陷入局部最优的问题,提出一种融合跳点搜索(Jump Point Search,JPS)和双向并行蚁群搜索的改进算法.首先,对实际研究环境进行栅格化建模,使用改进的跳点搜索算法生成双向搜索的初始次优路径,为双向蚁群搜索提供初始搜索方向参考.其次,在双向并行蚁群搜索过程中采用改进的转移概率启发函数,该函数在确定下一个转移节点时考虑了避免AGV与障碍物碰撞的因素,同时通过设计信息素共享机制并结合改进的信息素增量及浓度两种融合模型,共享和更新全局信息素浓度,以更好地探索和优化路径,保证双向路径连结.最后,与传统蚁群算法进行实验结果对比,验证了改进算法的全局搜索能力、效率和安全性.展开更多
文摘Automated Guided Vehicles(AGVs)have been introduced into various applications,such as automated warehouse systems,flexible manufacturing systems,and container terminal systems.However,few publications have outlined problems in need of attention in AGV applications comprehensively.In this paper,several key issues and essential models are presented.First,the advantages and disadvantages of centralized and decentralized AGVs systems were compared;second,warehouse layout and operation optimization were introduced,including some omitted areas,such as AGVs fleet size and electrical energy management;third,AGVs scheduling algorithms in chessboardlike environments were analyzed;fourth,the classical route-planning algorithms for single AGV and multiple AGVs were presented,and some Artificial Intelligence(AI)-based decision-making algorithms were reviewed.Furthermore,a novel idea for accelerating route planning by combining Reinforcement Learning(RL)andDijkstra’s algorithm was presented,and a novel idea of the multi-AGV route-planning method of combining dynamic programming and Monte-Carlo tree search was proposed to reduce the energy cost of systems.
基金Supported by the National Key Research and Development Program of China(No.2020YFC1807904).
文摘With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path finding(MAPF) algorithm is urgently needed to ensure the efficiency and realizability of the whole system. The complex terrain of outdoor scenarios is fully considered by using different values of passage cost to quantify different terrain types. The objective of the MAPF problem is to minimize the cost of passage while the Manhattan distance of paths and the time of passage are also evaluated for a comprehensive comparison. The pre-path-planning and real-time-conflict based greedy(PRG) algorithm is proposed as the solution. Simulation is conducted and the proposed PRG algorithm is compared with waiting-stop A^(*) and conflict based search(CBS) algorithms. Results show that the PRG algorithm outperforms the waiting-stop A^(*) algorithm in all three performance indicators,and it is more applicable than the CBS algorithm when a large number of AGVs are working collaboratively with frequent collisions.
基金supported by the National Natural Science Foundation of China(62173029,62273033,U20A20225)the Fundamental Research Funds for the Central Universities,China(FRF-BD-19-002A)。
文摘This paper investigates the problem of path tracking control for autonomous ground vehicles(AGVs),where the input saturation,system nonlinearities and uncertainties are considered.Firstly,the nonlinear path tracking system is formulated as a linear parameter varying(LPV)model where the variation of vehicle velocity is taken into account.Secondly,considering the noise effects on the measurement of lateral offset and heading angle,an observer-based control strategy is proposed,and by analyzing the frequency domain characteristics of the derivative of desired heading angle,a finite frequency H_∞index is proposed to attenuate the effects of the derivative of desired heading angle on path tracking error.Thirdly,sufficient conditions are derived to guarantee robust H_∞performance of the path tracking system,and the calculation of observer and controller gains is converted into solving a convex optimization problem.Finally,simulation examples verify the advantages of the control method proposed in this paper.
文摘在静态栅格地图中,针对传统蚁群算法进行AGV(Automated Guided Vehicle,自动引导车)路径规划收敛慢且搜索结果容易陷入局部最优的问题,提出一种融合跳点搜索(Jump Point Search,JPS)和双向并行蚁群搜索的改进算法.首先,对实际研究环境进行栅格化建模,使用改进的跳点搜索算法生成双向搜索的初始次优路径,为双向蚁群搜索提供初始搜索方向参考.其次,在双向并行蚁群搜索过程中采用改进的转移概率启发函数,该函数在确定下一个转移节点时考虑了避免AGV与障碍物碰撞的因素,同时通过设计信息素共享机制并结合改进的信息素增量及浓度两种融合模型,共享和更新全局信息素浓度,以更好地探索和优化路径,保证双向路径连结.最后,与传统蚁群算法进行实验结果对比,验证了改进算法的全局搜索能力、效率和安全性.