In the heterogeneous and dynamically evolving Industrial Internet, industrial agents are required to possess cross-domain adaptability and self-learning capabilities to facilitate task generalization and scalable deployment across diverse operational contexts. However, existing domain adaptation approaches predominantly rely on static feature alignment or domain-invariant assumptions, lacking a systematic consideration of working condition variability and the interplay between self-learning and adaptation. This oversight hampers their effectiveness in real-world industrial scenarios, where agents must operate under complex conditions with limited target domain knowledge. Consequently, these methods often suffer from knowledge shift and insufficient policy generalization. To address these limitations, this article introduces the instance weighting-based domain-adaptive optimization (IW-DAO) framework. IW-DAO combines an instance weighting-based knowledge alignment mechanism with a Bayesian optimization strategy, forming a dynamic self-learning loop tailored for cross-domain adaptation. Specifically, the framework constructs an adaptive knowledge representation in a high-dimensional invariant feature space and formulates a cross-domain performance evaluation estimator to guide the unsupervised learning of knowledge transfer and adaptive optimization via Bayesian iterative search. Extensive experiments on industrial asset management tasks as well as a real-world industrial flow process dataset with various operating conditions demonstrate the effectiveness of IW-DAO. The proposed framework enables industrial agents to evolve autonomously and be deployed efficiently across diverse domains. IW-DAO consistently outperforms baseline and expert-tuned methods, demonstrating strong generalization and adaptability in both industrial asset management and complex flow process scenarios.
16 February 2024 in IEEE Transactions on Emerging Topics in Computing
In recent years, the cooperation structures of industrial chains have evolved into multiplex networks, in which product agents are connected through various types of links. Due to the constraints of the multi-coupled interaction structure of the multiplex networked industrial chains, the load imbalances generated by the industrial production processes will cascade in and between different network layers, thus affecting the load balance of the whole system. The challenges that arise when attempting such load balancing among multiplex networked industrial chains are twofold: (1) The multiplex networked interaction structure adds new constraints to traditional multiagent task migration problems, which increases the solution space dimension, and (2) The cascaded load imbalances require tasks to be migrated adaptively, which complicates the solution space structure, and it is proven $\mathcal {NP}$ -hard to achieve such load balancing. Then, a hierarchical cascade-triggered task migration algorithm is designed, where key agents are selected to cooperate with each other in a hierarchical control form to achieve load balancing between network layers, and appropriate agents are cascade-triggered to migrate tasks adaptively to achieve load balancing in network layers. Finally, the algorithm is extensively evaluated in experiments, concluding that it can significantly increase the resulting utility and task completion proportion, while efficiently reducing the task completion cost. In particular, the algorithm does not appear to be statistically different in the resulting optimization objectives from the optimal result computed by the CPLEX solver, but it may consume less runtime.
23 April 2026 in IEEE Transactions on Automation Science and Engineering
Partitioning a pool of capability-heterogeneous human and machine agents into effective teams for multiple concurrent tasks is a fundamental challenge in hybrid human–machine collaboration. We formalize this problem as a Multi-Task Additively Separable Hedonic Game (MT-ASHG), in which every agent is a self-interested player whose utility combines (i) a task-specific proficiency score measuring how well the agent’s skill vector aligns with task requirements, and (ii) an inter-agent compatibility score capturing synergistic or conflicting partnerships. Building on this formulation, we design an Iterative Best Response (IBR) algorithm that lets agents autonomously migrate between task groups to improve their individual payoffs. We prove that the IBR dynamics converge in a finite number of steps to an individually stable partition, in which no agent can unilaterally improve its utility by switching teams, and analyze the computational complexity of the convergence process. To bridge theory and practice, we further introduce an empirical profiling method that extracts capability and compatibility vectors from historical agent interactions, addressing the cold-start problem in newly formed human–machine teams. Extensive experiments on synthetic benchmarks and the Overcooked-AI cooperative environment demonstrate that MT-ASHG consistently outperforms centralized assignment baselines and existing coalition-formation methods in terms of global task completion rate, fairness, and scalability.
1 February 2025 in Tsinghua Science and Technology
With the advancement of electronic information technology and the growth of the intelligent industry, the industrial sector has undergone a shift from simplex, linear, and vertical chains to complex, multi-level, and multi-dimensional networked industrial chains. In order to enhance energy efficiency in multiplex networked industrial chains under time-of-use price, a coarse time granularity task scheduling approach has been adopted. This approach adjusts the distribution of electricity supply based on task deadlines, dividing it into longer periods to facilitate batch access to task information. However, traditional simplex-network task assignment optimization methods are unable to achieve a globally optimal solution for cross-layer links in multiplex networked industrial chains. Existing solutions struggle to balance execution costs and completion efficiency in time-of-use price scenarios. Therefore, this paper presents a mixed-integer linear programming model for solving the problem scenario and two algorithms: an exact algorithm based on the branch-and-bound method and a multi-objective heuristic algorithm based on cross-layer policy propagation. These algorithms are designed to adapt to small-scale and large-scale problem scenarios under coarse time granularity. Through extensive simulation experiments and theoretical analysis, the proposed methods effectively optimize the energy and time costs associated with the task execution.
31 December 2021 in ACM Transactions on Autonomous and Adaptive Systems
Existing studies on the multirobot foraging problem often assume safe settings, in which nothing in an environment hinders the robots’ tasks. In many real-world applications, robots have to collect objects from hazardous environments like earthquake rescue, where possible risks exist, with possibilities of destroying robots. At this stage, there are no targeted algorithms for foraging robots in hazardous environments, which can lead to damage to the robot itself and reduce the final foraging efficiency. A motivating example is a rescue scenario, in which the lack of a suitable solution results in many victims not being rescued after all available robots have been destroyed. Foraging robots face a dilemma after some robots have been destroyed: whether to take over tasks of the destroyed robots or continue executing their remaining foraging tasks. The challenges that arise when attempting such a balance are twofold: (1) the loss of robots adds new constraints to traditional problems, complicating the structure of the solution space, and (2) the task allocation strategy in a multirobot team affects the final expected utility, thereby increasing the dimension of the solution space. In this study, we address these challenges in two fundamental environmental settings: homogeneous and heterogeneous cases. For the former case, a decomposition and grafting mechanism is adopted to split this problem into two weakly coupled problems: the foraging task execution problem and the foraging task allocation problem. We propose an exact foraging task allocation algorithm, and graft it to another exact foraging task execution algorithm to find an optimal solution within the polynomial time. For the latter case, it is proven \( \mathcal {NP} \) -hard to find an optimal solution in polynomial time. The decomposition and grafting mechanism is also adopted here, and our proposed greedy risk-aware foraging algorithm is grafted to our proposed hierarchical agglomerative clustering algorithm to find high-utility solutions with low computational overhead. Finally, these algorithms are extensively evaluated through simulations, demonstrating that compared with various benchmarks, they can significantly increase the utility of objects returned by robots before all the robots have been stopped.
11 June 2022 in ACM Transactions on Intelligent Systems and Technology
As an essential problem in robotics, foraging means that robots collect objects from a given environment and return them to a specified location. On many occasions, robots are required to perform foraging tasks in adversarial environments, such as battlefield rescue, where potential adversaries may damage robots with a certain probability. The longer an individual robot moves through adversarial environments, the higher the probability of being damaged by adversaries. The robot system can gain utility only when the robot brings carried objects back to a predetermined home station. Such a risk of being damaged makes returning home at different locations potentially relevant to the expected utility produced by the robot. Thus, the individual robot faces a dilemma when it responds to the potential risks in adversarial environments: whether to return the carried resources home or continue foraging tasks. In this article, two fundamental environment settings are discussed, homogeneous cases and heterogeneous cases. The former is analyzed as having both the optimal substructure property and the non-aftereffect property. Then, we present a dynamic programming (DP) algorithm that can find an optimal solution with polynomial time complexity. For the latter, it is proven that finding an optimal solution is \( \mathcal {NP} \) -hard. We then propose a heuristic algorithm: A division hierarchical path planning (DHPP) algorithm that is based on the idea of dividing the foraging routes generated initially into a certain number of subroutes to dilute risks. Finally, these algorithms are extensively evaluated in simulations, concluding that in adversarial environments, they can significantly improve the productivity of an individual robot before it is damaged.