Multicolor spraying path planning method and system based on hybrid heuristic algorithm
A hybrid heuristic, path planning technology, applied in knowledge-based model computer systems, manufacturing computing systems, and specific mathematical models, etc., can solve the problems of high color change cost and high cost of spray gun moving path, high cost of spray gun moving path, To achieve the effect of shortening the moving distance of the spray gun, ensuring diversity, and avoiding circulation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0051] The present embodiment provides a multi-color spraying path planning method based on a hybrid heuristic algorithm;
[0052] like figure 1 shown, a multi-color spraying path planning method based on a hybrid heuristic algorithm, applied to a single-nozzle spray gun; including:
[0053] S101: Obtain the color of the target color block of the object to be sprayed, the position of the target color block of the object to be sprayed, and the distance between the center points of the adjacent target color blocks;
[0054] S102: According to the acquired data, describe the multi-color spraying path planning based on the hybrid heuristic algorithm of the single-nozzle spray gun as a cluster traveling salesman problem; wherein, the cluster traveling salesman problem includes: an objective function and a constraint condition;
[0055] S103: Use a greedy random adaptive search algorithm to solve the cluster traveling salesman problem to obtain an initial solution;
[0056] S104: us...
Embodiment 2
[0118] This embodiment provides a multi-color spraying path planning system based on a hybrid heuristic algorithm;
[0119] A multi-color spraying path planning system based on a hybrid heuristic algorithm, applied to a single-nozzle spray gun; including:
[0120] A first acquisition module, which is configured to: acquire the color of the target color block of the object to be sprayed, the position of the target color block of the object to be sprayed, and the distance between the center points of the adjacent target color blocks;
[0121] The first problem description module is configured to: according to the acquired data, describe the multi-color spraying path planning based on the hybrid heuristic algorithm of the single-nozzle spray gun as a cluster traveling salesman problem; wherein, the cluster traveling salesman problem includes: Objective function and constraints;
[0122] The first problem solving module is configured to: adopt a greedy random adaptive search algo...
Embodiment 3
[0128] The present embodiment provides a multi-color spraying path planning method based on a hybrid heuristic algorithm;
[0129] like figure 2 shown, a multi-color spraying path planning method based on a hybrid heuristic algorithm, applied to a dual-nozzle spray gun; including:
[0130] S301: Obtain the color of the target color block of the object to be sprayed, the position of the target color block of the object to be sprayed, and the distance between the center points of the adjacent target color blocks;
[0131] S302: According to the acquired data, the multi-color spraying path planning based on the hybrid heuristic algorithm of the dual-nozzle spray gun is described as a clustered traveling salesman problem; wherein, the clustered traveling salesman problem includes: an objective function and a constraint condition;
[0132] S303: Initialize the color combination probability during the first execution; combine the two clusters into a set according to the color comb...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


