A platform for research: civil engineering, architecture and urbanism
Implementation method for scheduling parking robot based on path planning
The invention discloses an implementation method for scheduling a parking robot based on path planning. The method comprises the steps that firstly, a data set diagram is made based on parking spacesand a destination of a whole parking lot, the related distance between a point of each parking space and a positioning point of the destination is explored, and exploration data is stored in a database; secondly, coordinate points in the database are excluded according to real-time data of the parking lot, nearest distance operation is conducted according to a Dijkstra algorithm, equipment data ina parking system is taken, and that no object exists on a path is ensured; and thirdly, the identity of a user can be judged, the grade is determined, and finally an instruction is sent to the robotto execute carrying operation. According to the implementation method, the Dijkstra algorithm is utilized for conducting nearest distance operation, the running path of the parking robot is greatly optimized, and the carrying efficiency is significantly improved.
本发明公开了一种基于路径规划用于调度停车机器人的实现方法,首先基于整个停车场的停车位和目的地制定一个数组图,对每个停车位的点和目的地的定位点之间的相关距离进行勘查,并将勘察数据保存进数据库。然后根据停车场的实时数据,对数据库中的坐标点进行排除,根据Dijkstra算法进行最近距离运算,取停车系统中的设备数据,确保路径上不会有物体。还可以对用户身份做判断,确定等级,最后发送指令给机器人执行搬运操作。本发明利用了Dijkstra算法进行最近距离的运算,就可以确保停车机器人的运行路径得到大幅的优化,显著提高了搬运的效率。
Implementation method for scheduling parking robot based on path planning
The invention discloses an implementation method for scheduling a parking robot based on path planning. The method comprises the steps that firstly, a data set diagram is made based on parking spacesand a destination of a whole parking lot, the related distance between a point of each parking space and a positioning point of the destination is explored, and exploration data is stored in a database; secondly, coordinate points in the database are excluded according to real-time data of the parking lot, nearest distance operation is conducted according to a Dijkstra algorithm, equipment data ina parking system is taken, and that no object exists on a path is ensured; and thirdly, the identity of a user can be judged, the grade is determined, and finally an instruction is sent to the robotto execute carrying operation. According to the implementation method, the Dijkstra algorithm is utilized for conducting nearest distance operation, the running path of the parking robot is greatly optimized, and the carrying efficiency is significantly improved.
本发明公开了一种基于路径规划用于调度停车机器人的实现方法,首先基于整个停车场的停车位和目的地制定一个数组图,对每个停车位的点和目的地的定位点之间的相关距离进行勘查,并将勘察数据保存进数据库。然后根据停车场的实时数据,对数据库中的坐标点进行排除,根据Dijkstra算法进行最近距离运算,取停车系统中的设备数据,确保路径上不会有物体。还可以对用户身份做判断,确定等级,最后发送指令给机器人执行搬运操作。本发明利用了Dijkstra算法进行最近距离的运算,就可以确保停车机器人的运行路径得到大幅的优化,显著提高了搬运的效率。
Implementation method for scheduling parking robot based on path planning
一种基于路径规划用于调度停车机器人的实现方法
JIA BAOHUA (author) / CHEN XINJIAN (author)
2020-12-18
Patent
Electronic Resource
Chinese
IPC:
E04H
Gebäude oder ähnliche Bauwerke für besondere Zwecke
,
BUILDINGS OR LIKE STRUCTURES FOR PARTICULAR PURPOSES
Parking implementation method of parking robot based on center coincidence
European Patent Office | 2022
|Dragging type clamping parking robot and parking implementation method
European Patent Office | 2021
|Novel parking robot with free blocking arm and parking implementation method of novel parking robot
European Patent Office | 2022
|European Patent Office | 2021
|