A Path Planning Method for Industrial Manipulator Arms Based on Time-varying Directed Graph

A path planning and industrial machinery technology, applied in data processing applications, prediction, calculation, etc., can solve problems such as non-global optimal paths

Active Publication Date: 2020-12-04
中国大恒(集团)有限公司 +1
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] Aiming at the above-mentioned problems in the process of transporting products between the waiting area and the working area in the industrial field, the present invention discloses an efficient and fast method for planning the transport path of industrial manipulators based on time-varying directed graphs. The path planning method uses dynamic The weighting method solves the problem that the planned path is not globally optimal, ensures the predictability and uniqueness of the path planning results, makes the path planning method applicable to the industrial field, and solves the time-varying and simultaneous existence of work stations Application Scenarios of Multiple Shortest Paths

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Path Planning Method for Industrial Manipulator Arms Based on Time-varying Directed Graph
  • A Path Planning Method for Industrial Manipulator Arms Based on Time-varying Directed Graph
  • A Path Planning Method for Industrial Manipulator Arms Based on Time-varying Directed Graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] In order to enable those skilled in the art to better understand the technical solutions of the present application, the present invention will be further described in detail below in conjunction with specific embodiments and accompanying drawings.

[0046] In the industrial field, it is often necessary to move the product from the loading area to the working area, and then move the product to the unloading area after the operation is completed, such as figure 1 shown. When planning the moving path, the optimization problem of the moving path is generally transformed into the shortest path problem of directed graph traversal through the directed graph, and then a variety of path planning algorithms can be used to solve the design problem of the moving path. This embodiment records a method for planning a transport path of an industrial manipulator based on a time-varying directed graph, which solves the problem of unpredictability of the path in the prior art, and solve...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to an industrial mechanical arm carrying path planning method based on a time-varying directed graph, and the method comprises the following steps: (1) dividing stations into a static station and a dynamic station according to the condition whether nodes of a waiting area and a working area are in a working state or not; (2) adopting a mechanical arm to carry the product between the nodes of the two stations, and the time weight between the nodes is the sum of the carrying time Tm and the waiting time Tw between the two nodes; and (3) establishing a directed graph model through the time weight obtained in the above step, and after determining the directed graph, searching a shortest path for directed graph traversal based on the directed graph. The path planning method is suitable for an application scene with dynamically changing node weights, the problem that a planned path is not globally optimal is solved, the predictability and uniqueness of a path planning result are ensured, and the path planning method can be applied to the industrial field.

Description

technical field [0001] The invention relates to the field of path planning, in particular to a method for planning a transport path of an industrial manipulator based on a time-varying directed graph. Background technique [0002] In the field of industrial production, there is often the situation of moving products between the waiting area and the working area. In the process of handling, path planning problems are often encountered. At present, the traditional path planning algorithms are all based on static directed graphs with fixed weights. , such as: best-first search algorithm, random road map method PRM, rapid expansion random number method, dynamic programming algorithm, heuristic algorithm, etc. [0003] However, when the number of working stations and waiting stations is not equal, the state of working stations will change with time, and static weights cannot be used, but time-varying dynamic weights are needed for path planning. [0004] Because at this time, th...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06Q10/04
Inventor 蔺小康刘强强刘敏宋伟铭周中亚罗松彬
Owner 中国大恒(集团)有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap