Parking AGV path planning method based on improved Dijkstra algorithm
A path planning and algorithm technology, applied in vehicle position/route/altitude control, motor vehicle, two-dimensional position/channel control and other directions, can solve the problem of limited AGV operating efficiency, and achieve convenient task allocation and shortening of waiting time. Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0050] The content of the present invention will be further described below in combination with specific embodiments.
[0051] The present invention is based on the improved Dijkstra algorithm parking AGV path planning method, image 3 Implementation flowchart for the present invention, concrete content comprises the following steps:
[0052] ⑴Create the operating scene model of the parking automatic guided transport vehicle AGV, and represent the environment of the parking lot as a strongly connected graph. The optimal path of connectivity abstracts the distribution of parking spaces into a weighted connection network G(V, E, W ij ), where V represents the set of edges composed of two connected nodes, E represents the set of nodes, and W ij Represents nodes i and j forming an edge V ij The weight of the AGV, the running path of the AGV is represented by an ordered array of nodes, and the order of the nodes is the order of the running path of the AGV.
[0053] (2) Initial...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com