利索-全球专利检索

  1. 登录
  2. 注册
发明公开
CN104965485A 面阵列凸点按需喷射打印控制系统的路径规划方法 无效 - 撤回

面阵列凸点按需喷射打印控制系统的路径规划方法
摘要：
面阵列凸点按需喷射打印控制系统的路径规划方法，属于按需喷射打印技术领域。为了解决目前凸点在打印时运动路径规划效率低的问题。它包括：一：读入待打印数据，循环次数k＝1；二：判断k是否小于x，若是，输出当前计算最短路径及距离，若否，从起点出发访问，转三；三：从当前点移动到下一允许选择点，利用蚁群算法计算路径，转四；四：判断当前点是否还存在下一允许选择点，若是转三，若否转五；五：判断当前蚂蚁是否已走过所有点，若是，计算该条路径长度，转六；若否，将该路径长度设无穷大，转六；六：判断得到的路径长度是否现有最短，若是，更新最短路径及长度，转七；若否，转七；七：更新最短路径上各边的信息素，k加1，转二。用于面阵列凸点打印。
摘要（英）：

A path planning method of a surface array salient point on-demand jet printing control system belongs to the technical field of on-demand jet printing, and aims to solve the problem that at present motion path planning efficiency is low in printing of salient points. The method includes: 1. reading in data to be printed, the number of cycles k=1; 2. judging whether k is smaller than x, if yes, outputting a current calculated shortest path and distance, and if no, departing from a starting point to visit, and turning to 3; 3. moving from a current point to the next allowable selection point, using an ant colony algorithm to calculate a path, and turning to 4; 4. judging whether the next allowable selection point exists for the current point, if yes, turning to 3, and if no, turning to 5; 5. judging whether the current ant has walked through all points, if yes, calculating the length of the path, and turning to 6, and if no, setting the length of the path to be infinite, and turning to 6; 6. judging whether the acquired length of the path is the shortest among existing paths, if yes, updating the shortest path and length, and turning to 7, and if no, turning to 7; and 7. updating pheromones of each side on the shortest path, plus 1 to k, and turning to 2. The path planning method of the surface array salient point on-demand jet-printing control system is used for surface array salient point printing.

0/0