CCChen Chen

Chen Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chen Chen has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    PaE:Adeep reinforcement learning-based two-level online solution for uncertain moving-target traveling salesman problems

    by Zhao Zhang, Yihan Zhong, Chen Chen, Bin Xin, Fang Deng

    This paper investigates an uncertain Moving-Target Traveling Salesman Problem (MT-TSP), in which the future motion trajectories of targets are uncertain. The objective is to maximize the number of visited targets within a bounded region while minimizing the total travel distance. To address the challenges introduced by dynamic target maneuvers, we propose a two-level online solution framework, termed PaE (Plan and Execute), which leverages the current observations of targets to solve the problem in real time. The high-level module plans the next target to visit, while the low-level module executes the corresponding access process. We develop a deep reinforcement learning–based algorithm at the high level, which employs an attention-based model to effectively exploit both the current environment state and historical visiting information when selecting the next tar-get. At the low level, rapid target access is achieved through a lightweight prediction mechanism with continuous state updates. Extensive experiments in simulated environments demonstrate that PaE is capable of extracting key problem features to capture dynamic changes, leveraging rich contextual information to guide decision-making, and generating high-quality solutions within extremely short computation times.

  • Indicator-Based Artificial Bee Colony Algorithm for Solving a Bi-objective Moving-Target Traveling Salesman Problem with Uncertainty

    by Zhao Zhang, Yihan Zhong, Chen Chen, Bin Xin, Fang Deng

    This paper investigates a novel bi-objective moving-target traveling salesman problem with uncertainty, where the target trajectories are uncertain. The objective is to maximize the number of visited targets within a bounded region while minimizing the travel cost. This problem is formulated as a bi-objective two-stage stochastic program with recourse. The first-stage decision determines a planned visiting sequence before the realization of target trajectories, and the second-stage recourse decision allows the agent to return to the depot in advance when the remaining targets are expected to leave the bounded region. We adopt the sample average approximation approach to approximate the expected objective values by empirical average over a finite set of sampled scenarios. To efficiently approximate the Pareto front, we propose an Indicator-based Artificial Bee Colony (I-ABC) algorithm. We introduce a ratio-based binary indicator into both the environmental selection and evolutionary mechanisms, incorporate a parallel-distance measure to preserve population diversity, and adopt an elitist strategy in the scout bee phase to enhance convergence. Extensive experiments in simulated environments demonstrate that the proposed I-ABC algorithm outperforms the state-of-the-art algorithms.

  • Large-Scale Multirobot Task Planning Using Efficient Hierarchical Reinforcement Learning

    by Xuan Zhou, Xiang Shi, Lele Zhang, Chen Chen, Hongbo Li, Lin Ma, Fang Deng, Jie Chen

    Multi-robot task planning (MRTP) at scale in robotic mobile fulfillment systems (RMFS) remains a challenge due to the curse of dimensionality and complex dynamic properties. Aiming to solve these challenges, we construct an end-to-end scalable multi-robot task planner capable of scaling to large-scale systems by learning hierarchical planning policies. In this planner, we design a centralized hierarchical temporal task planning framework to mitigate the curse of dimensionality while ensuring timely dynamic response. Following this framework, we propose a novel cycle-constrained asynchronous temporal graph (CycATG) to provide foundation for modeling the system dynamics. Based on the graph representation, we formulate the MRTP problem as a semi-Markov decision process (SMDP) that focuses solely on critical interaction points to improve computational and sampling efficiency. The policies in SMDP are parameterized via a hierarchical temporal attention network with temporal embedding layers to enhance spatio-temporal feature extraction. Additionally, the decoder masks in this network naturally ensure that the generated actions strictly satisfy the required dynamic hard constraints. The above hierarchical policies are jointly optimized using an efficient hierarchical REINFORCE with rollout counterfactual baseline method. To further enhance generalization performance on unlearned instances while preventing catastrophic forgetting, we extend it with region expansion curricula. Experiments demonstrate that our planner outperforms state-of-the-art methods on different MRTP instances across simulated and real-world RMFS. It successfully scales to instances with up to 200 robots, 1000 retrieval racks on unlearned maps while maintaining performance advantages.


  • Multi-Agent Cooperative Pursuit Based on Permutation Invariance and Task Decomposition

    by Kun Yang, Kaixi Chen, Fang Deng, Chen Chen

    Multi-agent pursuit-evasion has significant applications in military, transportation, and industrial sectors. This task faces dual challenges of uncertain swarm scale and environmental uncertainty within unstructured dynamic environments. To address these, we propose a hierarchical reinforcement learning framework based on permutation invariance to balance pursuit efficiency and collision avoidance safety. First, in the evaluation stage, we introduce a hybrid feature aggregation mechanism based on the DeepSets structure and a predicted intercept point auxiliary task. By extracting permutation-invariant group features and introducing kinematic priors, this approach achieves zero-shot transfer and rapid convergence of the method across different swarm scales. Second, in the execution stage, we construct a residual gating architecture based on task decomposition. This architecture utilizes a frozen basic tracking stream to handle the global game and employs a conditioned residual stream with a dynamic gating mechanism to manage local obstacle avoidance, effectively resolving the multi-objective conflict problem under sparse rewards. Finally, extensive simulations and physical experiments demonstrate that the proposed method, after training on small-scale swarms, achieves robust zero-shot transfer to medium and large-scale swarms, completing efficient and stable pursuit tasks. Furthermore, the method was successfully transferred to a physical platform, completing tasks smoothly even in the presence of faulty agents, thereby validating its applicability in the real world.

  • An Adaptive Robot Search Algorithm for Balancing Exploitation and Exploration in Indoor Intermittent Source Seeking

    by Miao Wang, Bin Xin, Fang Deng, Chen Chen, Yun Qu

    The accidental release of chemicals poses significant risks to human life and property, requiring rapid and accurate source seeking. Chemicals released from an intermittent indoor source form narrow, dynamic, and discrete concentration patches, leaving robots with intermittent cues and posing challenges for source seeking. This study proposed an adaptive robot search algorithm that balances exploitation of historical data and exploration of unknown areas. The proposed exploitation strategy utilizes historical data to probabilistically estimate the source location, aiming to guide the robot upstream for faster source localization. The proposed exploration strategy directs the robot to unknown areas, aiming to gather more information by prioritizing points with the highest information gain based on frontier evaluation. A novel time-dependent factor reduces repeated visits to early regions while mitigating exploration bias in later search stages, enabling a dynamic balance between the two strategies when selecting navigation goals. The algorithm was tested in simulated environments with varying airflow speeds, source release cycles, source release duty cycles, and different scenarios. The results demonstrated reliable and excellent performance. The effectiveness of the proposed algorithm was further validated in real-world robot experiments.

  • Learning Multi-Agent Reservoir Cooperative Operations Over Multi-Relational Directed Acyclic Graph

    by Qiyong He, Xiuxian Li, Li Liang, Chen Chen, Fang Deng

    Operating large multi-reservoir systems is critical for effective water allocation, hydropower generation, and economic development. However, conventional robust planning-based methods scale poorly beyond single-reservoir or cascaded systems due to computational intractability. Addressing inter-reservoir relation extraction and coordination under conflicting objectives, uncertain inflows, and complex network couplings therefore remains an open challenge. To tackle this problem, we introduce the multi-agent reservoir cooperative operation (MARCO) environment, which integrates multiple objectives, heterogeneous topology, and stochastic inflows in a unified framework. An algorithm is then designed to construct a multi-relational directed acyclic graph (MR-DAG) that encodes the underlying topology through coupled objectives and entity relations. Building on this representation, we propose the multi-agent relational directed acyclic graph transformer (MAR-DAGT), a reinforcement learning algorithm that performs typed message passing for efficient feature extraction and employs acyclic decision-making to exploit causal structure for improved credit assignment. Extensive experiments on MARCO show that MAR-DAGT consistently outperforms other MARL and optimization-based baselines in terms of objective satisfaction and robustness to inflow uncertainty.


  • Open Access

    A review of reinforcement learning approaches for pursuit-evasion games

    by Kun Yang, Ao Shen, Nengwei Xu, Fang Deng, Maobin Lu, Chen Chen