Bo Yuan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bo Yuan has a total of 103 co-authors. Here are the top co-authors by number of shared publications:
- Xin Yao
Lingnan University
11 shared publications - Jialin Liu
School of Data Science, Lingnan University, Hong Kong, SAR, China
7 shared publications - Qi Xu
School of Microelectronics, University of Science and Technology of China
4 shared publications - Qingquan Zhang
Southern University of Science and Technology
4 shared publications - Hailong Yao
University of Science and Technology Beijing
3 shared publications - Handing Wang
Xidian University, Xi'an, China
3 shared publications
Latest Publications
- 30 April 2026
- Published by Elsevier in Pattern Recognition
- Vol. 179
Stable region enhanced online learning method for intermediate verification latency and concept drift
- 30 April 2026
- Published by Elsevier in Pattern Recognition
- Vol. 179
Stable region enhanced online learning method for intermediate verification latency and concept drift
- Open Access
- 1 April 2026
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 31 (2) , 1282-1305
AutoSceCraft: Generate Various Driving Scenarios from Scratch for Autonomous Driving Systems
Autonomous Driving Systems (ADS) are safety-critical. Abundant and various driving scenarios are required to train accurate and robust models, and comprehensively test each module of autonomous driving systems (i.e., perception, tracking, prediction, planning, and control modules). However, collecting driving scenario data from the real physical world is expensive and inefficient. Most existing works generate simulated driving scenarios by varying the behaviors of dynamic objects on simple road networks (e.g., highways), while the influence of roadside structures and scenarios with complex road networks are not considered. This paper proposes a novel driving scenario generation approach, Automated Scenario Crafting (AutoSceCraft), to automatically produce abundant driving scenarios containing various road networks, traffic rules, roadside structures, and dynamic objects at low cost. To validate the effectiveness and efficiency of our proposed framework, AutoSceCraft is integrated into three popular driving simulators, including SMARTS, esmini, and CARLA. Numerical experiments and scenario visualization results show that AutoSceCraft can generate effectively and efficiently various driving scenarios from scratch for testing and training various modules (including perception, prediction, and planning modules) within autonomous driving systems.
- 1 April 2026
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 31 (2) , 1282-1305
Open AccessAutoSceCraft: Generate Various Driving Scenarios from Scratch for Autonomous Driving Systems
Autonomous Driving Systems (ADS) are safety-critical. Abundant and various driving scenarios are required to train accurate and robust models, and comprehensively test each module of autonomous driving systems (i.e., perception, tracking, prediction, planning, and control modules). However, collecting driving scenario data from the real physical world is expensive and inefficient. Most existing works generate simulated driving scenarios by varying the behaviors of dynamic objects on simple road networks (e.g., highways), while the influence of roadside structures and scenarios with complex road networks are not considered. This paper proposes a novel driving scenario generation approach, Automated Scenario Crafting (AutoSceCraft), to automatically produce abundant driving scenarios containing various road networks, traffic rules, roadside structures, and dynamic objects at low cost. To validate the effectiveness and efficiency of our proposed framework, AutoSceCraft is integrated into three popular driving simulators, including SMARTS, esmini, and CARLA. Numerical experiments and scenario visualization results show that AutoSceCraft can generate effectively and efficiently various driving scenarios from scratch for testing and training various modules (including perception, prediction, and planning modules) within autonomous driving systems.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- p. 1
A Two-Layer Decoupled Synthesis Framework for Uncertain Biochemical Protocols on Active-Matrix Digital Microfluidic Platforms
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- p. 1
Open AccessA Two-Layer Decoupled Synthesis Framework for Uncertain Biochemical Protocols on Active-Matrix Digital Microfluidic Platforms
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- p. 1
Fairer Ensembles via Co-Evolution
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- p. 1
Fairer Ensembles via Co-Evolution
- 26 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (4) , 4896-4911
Controllable Multimodal Motion Behavior Generation for Autonomous Driving
The generation of motion behaviors plays a pivotal role in constructing effective simulated scenarios for testing autonomous driving systems (ADSs). The controllability (i.e., the ability to synthesize specific motion patterns) and multimodality (i.e., the capacity to represent multiple motion intentions) of generated motion behaviors are essential for the purposeful and comprehensive evaluation of ADS. Although recent studies have made progress in either multimodal or controllable motion behavior generation, it remains a major challenge to simultaneously generate multimodal motion behaviors in a controllable manner. In this work, we propose a unified framework, CoMoGen, to generate multimodal motion behaviors in a controllable manner under open-loop evaluation assumption. The proposed framework consists of three core components: i) a learning-based vehicle placer, responsible for positioning generated vehicles in non-conflicting initial locations; ii) a robust model-based trajectory candidate generator, capable of synthesizing controllable and multimodal trajectory candidates. iii) a learning-based trajectory selector, developed to evaluate and select multimodal trajectories for the placed vehicles. Experiments on the INTERACTION dataset demonstrate strong controllability and multimodality of CoMoGen. Further experiments on three additional real-world datasets, that are unseen during training, as well as on diverse synthesized high-definition maps, validate the remarkable generalization capability of CoMoGen.
- 26 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (4) , 4896-4911
Controllable Multimodal Motion Behavior Generation for Autonomous Driving
The generation of motion behaviors plays a pivotal role in constructing effective simulated scenarios for testing autonomous driving systems (ADSs). The controllability (i.e., the ability to synthesize specific motion patterns) and multimodality (i.e., the capacity to represent multiple motion intentions) of generated motion behaviors are essential for the purposeful and comprehensive evaluation of ADS. Although recent studies have made progress in either multimodal or controllable motion behavior generation, it remains a major challenge to simultaneously generate multimodal motion behaviors in a controllable manner. In this work, we propose a unified framework, CoMoGen, to generate multimodal motion behaviors in a controllable manner under open-loop evaluation assumption. The proposed framework consists of three core components: i) a learning-based vehicle placer, responsible for positioning generated vehicles in non-conflicting initial locations; ii) a robust model-based trajectory candidate generator, capable of synthesizing controllable and multimodal trajectory candidates. iii) a learning-based trajectory selector, developed to evaluate and select multimodal trajectories for the placed vehicles. Experiments on the INTERACTION dataset demonstrate strong controllability and multimodality of CoMoGen. Further experiments on three additional real-world datasets, that are unseen during training, as well as on diverse synthesized high-definition maps, validate the remarkable generalization capability of CoMoGen.
- 16 November 2025
- Published by Springer Nature
- p. 209-222
A New Step Size Update Strategy for CMA-ES in Multi-objective Optimisation
- 16 November 2025
- Published by Springer Nature
- p. 209-222
A New Step Size Update Strategy for CMA-ES in Multi-objective Optimisation
- 6 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
Learn to Optimize Large-Scale Uncapacitated Facility Location Problems With an Adaptive Problem Reduction Strategy
Many large-scale combinatorial optimization problems (LSCOPs) are challenging to solve due to their high dimensionalities and complex search spaces. To deal with tens of thousands of decision variables, problem reduction approaches have proven effective in reducing the original problem instance to a more manageable size, thereby decreasing the dimensionality of problem instances before optimization. However, since the dimensionality of transformed problem instances remains fixed during the optimization process, the effectiveness of existing methods is highly dependent on the selected features. In this paper, instead of only transforming the original problem instance once prior to the optimization, we propose a novel learning-based adaptive problem reduction (LAPR) framework to facilitate solving LSCOPs. Based on a learning model, the LAPR framework initially transforms the original problem instance into a low-dimensional one, and then dynamically increases the problem dimensionality when necessary during the optimization. To evaluate the effectiveness and efficiency of our framework, we have applied it to solve uncapacitated facility location problems (UFLP) using three effective features to construct a machine learning model learning from small instances. Based on this model, the LAPR framework first identifies a subset of the most promising facilities to construct an initial reduced problem instance through a novel optimal-k estimation strategy. Then, it incrementally incorporates potentially promising facilities into candidate solutions during the evolutionary process to improve the optimization performance. Extensive experimental studies on a series of large-scale UFLP benchmarks demonstrate that our proposed LAPR framework significantly enhances the performance of existing solution methods and consistently outperforms state-of-the-art problem reduction frameworks.
- 6 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
Learn to Optimize Large-Scale Uncapacitated Facility Location Problems With an Adaptive Problem Reduction Strategy
Many large-scale combinatorial optimization problems (LSCOPs) are challenging to solve due to their high dimensionalities and complex search spaces. To deal with tens of thousands of decision variables, problem reduction approaches have proven effective in reducing the original problem instance to a more manageable size, thereby decreasing the dimensionality of problem instances before optimization. However, since the dimensionality of transformed problem instances remains fixed during the optimization process, the effectiveness of existing methods is highly dependent on the selected features. In this paper, instead of only transforming the original problem instance once prior to the optimization, we propose a novel learning-based adaptive problem reduction (LAPR) framework to facilitate solving LSCOPs. Based on a learning model, the LAPR framework initially transforms the original problem instance into a low-dimensional one, and then dynamically increases the problem dimensionality when necessary during the optimization. To evaluate the effectiveness and efficiency of our framework, we have applied it to solve uncapacitated facility location problems (UFLP) using three effective features to construct a machine learning model learning from small instances. Based on this model, the LAPR framework first identifies a subset of the most promising facilities to construct an initial reduced problem instance through a novel optimal-k estimation strategy. Then, it incrementally incorporates potentially promising facilities into candidate solutions during the evolutionary process to improve the optimization performance. Extensive experimental studies on a series of large-scale UFLP benchmarks demonstrate that our proposed LAPR framework significantly enhances the performance of existing solution methods and consistently outperforms state-of-the-art problem reduction frameworks.
- Open Access
- 1 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (10) , 19327-19341
Robust Dynamic Material Handling via Adaptive Constrained Evolutionary Reinforcement Learning
Dynamic material handling (DMH) involves the assignment of dynamically arriving material transporting tasks to suitable vehicles in real time for minimizing makespan and tardiness. In real-world scenarios, historical task records are usually available, which enables the training of a decision policy on multiple instances consisting of historical records. Recently, reinforcement learning (RL) has been applied to solve DMH. Due to the occurrence of dynamic events such as new tasks, adaptability is highly required. Solving DMH is challenging since constraints, including task delay, should be satisfied. A feedback is received only when all tasks are served, which leads to sparse reward. Besides, making the best use of limited computational resources and historical records for training a robust policy is crucial. The time allocated to different problem instances would highly impact the learning process. To tackle those challenges, this article proposes a novel adaptive constrained evolutionary RL (ACERL) approach, which maintains a population of actors for diverse exploration. ACERL accesses each actor for tackling sparse rewards and constraint violation to restrict the behavior of the policy. Moreover, ACERL adaptively selects the most beneficial training instances for improving the policy. Extensive experiments on eight training and eight unseen test instances demonstrate the outstanding performance of ACERL compared with several state-of-the-art algorithms. Policies trained by ACERL can schedule the vehicles while fully satisfying the constraints. Additional experiments on 40 unseen noised instances show the robust performance of ACERL. Cross validation further presents the overall effectiveness of ACREL. Besides, a rigorous ablation study highlights the coordination and benefits of each ingredient of ACERL.
- 1 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (10) , 19327-19341
Open AccessRobust Dynamic Material Handling via Adaptive Constrained Evolutionary Reinforcement Learning
Dynamic material handling (DMH) involves the assignment of dynamically arriving material transporting tasks to suitable vehicles in real time for minimizing makespan and tardiness. In real-world scenarios, historical task records are usually available, which enables the training of a decision policy on multiple instances consisting of historical records. Recently, reinforcement learning (RL) has been applied to solve DMH. Due to the occurrence of dynamic events such as new tasks, adaptability is highly required. Solving DMH is challenging since constraints, including task delay, should be satisfied. A feedback is received only when all tasks are served, which leads to sparse reward. Besides, making the best use of limited computational resources and historical records for training a robust policy is crucial. The time allocated to different problem instances would highly impact the learning process. To tackle those challenges, this article proposes a novel adaptive constrained evolutionary RL (ACERL) approach, which maintains a population of actors for diverse exploration. ACERL accesses each actor for tackling sparse rewards and constraint violation to restrict the behavior of the policy. Moreover, ACERL adaptively selects the most beneficial training instances for improving the policy. Extensive experiments on eight training and eight unseen test instances demonstrate the outstanding performance of ACERL compared with several state-of-the-art algorithms. Policies trained by ACERL can schedule the vehicles while fully satisfying the constraints. Additional experiments on 40 unseen noised instances show the robust performance of ACERL. Cross validation further presents the overall effectiveness of ACREL. Besides, a rigorous ablation study highlights the coordination and benefits of each ingredient of ACERL.
- 2 September 2025
- Published by MIT Press in Evolutionary Computation
- Vol. 33 (3) , 309-334
Large-Scale Multiobjective Evolutionary Algorithm Guided by Low-Dimensional Surrogates of Scalarization Functions
Recently, computationally intensive multiobjective optimization problems have been efficiently solved by surrogate-assisted multiobjective evolutionary algorithms. However, most of those algorithms can handle no more than 200 decision variables. As the number of decision variables increases further, unreliable surrogate models will result in a dramatic deterioration of their performance, which makes large-scale expensive multiobjective optimization challenging. To address this challenge, we develop a large-scale multiobjective evolutionary algorithm guided by low-dimensional surrogate models of scalarization functions. The proposed algorithm (termed LDS-AF) reduces the dimension of the original decision space based on principal component analysis, and then directly approximates the scalarization functions in a decomposition-based multiobjective evolutionary algorithm. With the help of a two-stage modeling strategy and convergence control strategy, LDS-AF can keep a good balance between convergence and diversity, and achieve a promising performance without being trapped in a local optimum prematurely. The experimental results on a set of test instances have demonstrated its superiority over eight state-of-the-art algorithms on multiobjective optimization problems with up to 1,000 decision variables using only 500 real function evaluations.
- 2 September 2025
- Published by MIT Press in Evolutionary Computation
- Vol. 33 (3) , 309-334
Large-Scale Multiobjective Evolutionary Algorithm Guided by Low-Dimensional Surrogates of Scalarization Functions
Recently, computationally intensive multiobjective optimization problems have been efficiently solved by surrogate-assisted multiobjective evolutionary algorithms. However, most of those algorithms can handle no more than 200 decision variables. As the number of decision variables increases further, unreliable surrogate models will result in a dramatic deterioration of their performance, which makes large-scale expensive multiobjective optimization challenging. To address this challenge, we develop a large-scale multiobjective evolutionary algorithm guided by low-dimensional surrogate models of scalarization functions. The proposed algorithm (termed LDS-AF) reduces the dimension of the original decision space based on principal component analysis, and then directly approximates the scalarization functions in a decomposition-based multiobjective evolutionary algorithm. With the help of a two-stage modeling strategy and convergence control strategy, LDS-AF can keep a good balance between convergence and diversity, and achieve a promising performance without being trapped in a local optimum prematurely. The experimental results on a set of test instances have demonstrated its superiority over eight state-of-the-art algorithms on multiobjective optimization problems with up to 1,000 decision variables using only 500 real function evaluations.