Arrow Research search

Author name cluster

Miao Chen

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

AAAI Conference 2026 Conference Paper

How Foundational Skills Influence VLM-based Embodied Agents: A Native Perspective

  • Bo Peng
  • Pi Bu
  • Keyu Pan
  • Xinrun Xu
  • Yingxiu Zhao
  • Miao Chen
  • Yang Du
  • Lin Li

Recent advances in vision–language models (VLMs) have shed light on human-level embodied intelligence. However, existing benchmarks for VLM-driven embodied agents still rely on high-level commands or discretised action spaces—``non-native'' settings that diverge markedly from the real world. Moreover, current benchmarks focus exclusively on high-level tasks, while lacking joint evaluation and analysis on both low- and high-level. To bridge these gaps, we present \textbf{NativeEmbodied}, a challenging benchmark for VLM-driven embodied agents that adopts a unified, native low-level action space. Built upon diverse simulated scenes, NativeEmbodied first designs three representative high-level tasks in complex scenarios to evaluate overall performance. For more detailed and comprehensive performance analysis, we further decouple the entangled skills behind complex tasks and construct four types of low-level tasks, each corresponding to a key fundamental embodied skill. This joint evaluation across task and skill granularities enables a fine-grained assessment of embodied agent. Comprehensive experiments on the best VLMs reveal pronounced deficiencies in certain fundamental embodied skills. Further analysis shows that these bottlenecks severely constrain performance on high-level tasks. Our NativeEmbodied not only pinpoints the key challenges faced by current VLM-driven embodied agents, but also provides valuable insight for future development of this field.

EAAI Journal 2025 Journal Article

A dual-population based two-archive coevolution algorithm for constrained multi-objective optimization problems

  • Miao Chen
  • Shijie Zhao
  • Tianran Zhang
  • Lei Zhang

How to balance the objectives and constraints better is the key to solving constrained multi-objective optimization problems (CMOPs). Many evolutionary algorithms struggle to fully converge to the entire Pareto front, especially in CMOPs with narrow and complex feasible regions, which posing significant challenges in solving CMOPs. To handle this problem, the paper proposes a dual-population based two-archive coevolution algorithm (DPTAC). The main population evolves towards the true Pareto front while accounting for considering the original problem. The auxiliary population ignores the constraints and approximates unconstrained Pareto front. To assist main population in crossing larger infeasible regions, enhancing its diversity, and discovering more feasible regions, a two-archive strategy is proposed, which stores the potentially valuable non-dominated infeasible solutions and non-dominated solutions generated by the evolution of the main population and the auxiliary population respectively. In addition, a removal mechanism is introduced and integrated into the auxiliary population to reduce computational resource waste. This can help the main population have more computational resources in the late stage of evolution to find narrow feasible regions and improve the convergence of the population. Experimental results demonstrate that DPTAC outperforms 9 state-of-the-art constrained multi-objective evolutionary algorithms (CMOEAs) across 5 test suites comprising 62 benchmark functions and 6 real-world problems, confirming its superior competitiveness.

EAAI Journal 2022 Journal Article

Dandelion Optimizer: A nature-inspired metaheuristic algorithm for engineering applications

  • Shijie Zhao
  • Tianran Zhang
  • Shilin Ma
  • Miao Chen

This paper proposes a novel swarm intelligence bioinspired optimization algorithm, called the Dandelion Optimizer (DO), for solving continuous optimization problems. DO simulates the process of dandelion seed long-distance flight relying on wind, which is divided into three stages. In the rising stage, seeds raise in a spiral manner due to the eddies from above or drift locally in communities according to different weather conditions. In the descending stage, flying seeds steadily descend by constantly adjusting their direction in global space. In the landing stage, seeds land in randomly selected positions so that they grow. The moving trajectory of a seed in the descending stage and landing stage are described by Brownian motion and a Levy random walk. CEC2017 benchmark functions are utilized to evaluate the performance of DO, including the optimization accuracy, stability, convergence, and scalability, through a comparison with 9 well-known nature-inspired metaheuristic algorithms. Finally, the applicability of DO is verified by solving 4 real-world optimization problems. The experimental results indicate that the proposed DO method is a higher performing optimizer with outstanding iterative optimization and strong robustness compared with well-established algorithms. Source codes of DO are publicly available at https: //ww2. mathworks. cn/matlabcentral/fileexchange/114680-dandelion-optimizer.

v2026.09.13