会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 84. 发明专利
    • METHOD FOR PLANNING PATH OF PARKING AGV BASED ON IMPROVED DIJKSTRA ALGORITHM
    • AU2020101761A4
    • 2020-09-17
    • AU2020101761
    • 2020-08-11
    • NANJING UNIV OF SCIENCE & TECHNOLOGY
    • QI YONGNI YIHUI
    • G08G1/09B60W30/06B60W30/095B60W60/00G05D1/02G06F16/29
    • A method for planning path of a parking AGV based on an improved Dijkstra algorithm, includes the following steps: creating a running scene model of the parking AGV; initializing each parameter of the algorithm; introducing a priority strategy to distribute a task to the parking AGV; selecting different weights for different task attributes (parking and retrieving) according to requirements of a practical application, and improving a traditional Dijkstra algorithm based on the different weights; and planning the path of the parking AGV using the improved Dijkstra algorithm. With the method, an optimal path from a starting node to a target node is found for the parking AGV to ensure that the AGV may rapidly and smoothly complete tasks of parking and retrieving a vehicle without collisions according to different task requirements in a short time. The method may be applied to planning the parking-retrieving path of the parking AGV in a parking lot, ensures that the AGV may safely park and retrieve the vehicle rapidly, improves an operational efficiency of the parking lot and saves a waiting time of a social person for parking or retrieving the vehicle. Start Creating an environment model Initializing each parameter introducing a priority strategy to distribute a task judging a task attribute parking retrieving Setting a distance as a weight Setting time as a weight Introducing a time window principle for calculation +An improved Dijkstra algorithm An optimal path CEndD