一种基于双空间知识转移与融合的动态多目标优化方法

By constructing a knowledge base for decision and objective spaces and using KD Tree and inverse distance weighted fusion, high-quality candidate solutions are generated, which solves the problem of slow response speed of dynamic multi-objective optimization methods in human-machine joint assembly systems, and enables rapid adaptation to environmental changes and efficient task allocation.

CN122413342APending Publication Date: 2026-07-17GUIZHOU UNIV

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
GUIZHOU UNIV
Filing Date
2026-06-16
Publication Date
2026-07-17

AI Technical Summary

Technical Problem

Existing dynamic multi-objective optimization methods cannot fully utilize the complementary information between the decision space and the target space in human-machine collaborative assembly systems, resulting in slow algorithm response speed after environmental changes, and the convergence and diversity of solutions are difficult to meet actual production needs.

Method used

A knowledge base is constructed for the decision space and the goal space, storing the statistical characteristics of elite populations in the historical environment. A KD Tree is used to retrieve similar historical samples, and a weighted fusion is performed using inverse distance weights to generate candidate solutions for the decision and goal spaces. The optimal individual is selected by combining non-dominated ranking and crowding distance to form a new initial population.

Benefits of technology

It can quickly respond to environmental changes, generate high-quality initial populations, shorten convergence time, ensure solution diversity, improve the operational efficiency of human-machine collaborative assembly systems, rationally allocate worker workloads, and meet actual production needs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122413342A_ABST
    Figure CN122413342A_ABST
Patent Text Reader

Abstract

本申请涉及人机联合装配任务规划技术领域,公开了一种基于双空间知识转移与融合的动态多目标优化方法。该方法针对现有动态多目标优化方法仅在单一空间进行知识转移、无法充分利用不同空间互补信息的问题,构建决策空间知识库和目标空间知识库,通过KD Tree检索与当前环境相似的历史样本,分别在双空间进行知识转移生成候选解,基于种群质量计算自融合权重对候选解进行线性融合,合并多来源种群并筛选最优个体组成新初始种群。本申请能够提升算法对动态环境的响应速度,改善解的收敛性和多样性,适用于人机联合装配动态任务规划等复杂动态多目标优化场景。
Need to check novelty before this filing date? Find Prior Art