Mingrui Yin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mingrui Yin has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Chenxin Cai
Harbin Institute of Technology
4 shared publications - Hao Zhang
Harbin Institute of Technology
4 shared publications - Jie Liu
Harbin Institute of Technology, Shenzhen, China
4 shared publications - Dongbo Li
Harbin Institute of Technology
1 shared publication - Meiyan Liang
Faculty of Computing, Harbin Institute of Technology, Harbin, China
1 shared publication
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
Path Refinement for Large-Scale Heterogeneous Multi-UAV Coverage
The emergence of Unmanned Aerial Vehicles (UAVs) has transformed static Wireless Sensor Networks (WSNs) into dynamic mobile sensing networks, enabling large-scale data acquisition for applications such as surveillance and precision agriculture. In these missions, multiple heterogeneous UAVs equipped with onboard sensors (e.g., cameras, multispectral sensors or LiDAR units) must collaboratively perform area coverage. The efficiency of the planned paths, governed by the Heterogeneous Multi-robot Coverage Path Planning (HMCPP) problem, directly impacts mission success. However, existing approaches to HMCPP are often limited by either prohibitive computational complexity or suboptimal path efficiency. To address this challenge, the HMCPP problem is modeled from a graph-based perspective, and a novel framework, termed Heterogeneous Cost Balancing (HCB), is introduced to efficiently generate high-quality solutions. HCB transforms existing solutions into HMCPP solutions by integrating fine-grained planning with cost-balancing strategies. Specifically, the proposed fine-grained planning approach refines traditional spiral routes, reducing path redundancy and enhancing coverage efficiency. Experimental results demonstrate that HCB outperforms baseline methods in most instances while maintaining high computation efficiency. Notably, on a large-scale real-world map (366 × 376 with 40 UAVs), HCB achieves improvements in makespan of 33.82%, 9.79%, 6.37%, and 12.34% over four heuristic-based baselines, and an 86.66% improvement over MIP-based approach.
- 6 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
Open AccessPath Refinement for Large-Scale Heterogeneous Multi-UAV Coverage
The emergence of Unmanned Aerial Vehicles (UAVs) has transformed static Wireless Sensor Networks (WSNs) into dynamic mobile sensing networks, enabling large-scale data acquisition for applications such as surveillance and precision agriculture. In these missions, multiple heterogeneous UAVs equipped with onboard sensors (e.g., cameras, multispectral sensors or LiDAR units) must collaboratively perform area coverage. The efficiency of the planned paths, governed by the Heterogeneous Multi-robot Coverage Path Planning (HMCPP) problem, directly impacts mission success. However, existing approaches to HMCPP are often limited by either prohibitive computational complexity or suboptimal path efficiency. To address this challenge, the HMCPP problem is modeled from a graph-based perspective, and a novel framework, termed Heterogeneous Cost Balancing (HCB), is introduced to efficiently generate high-quality solutions. HCB transforms existing solutions into HMCPP solutions by integrating fine-grained planning with cost-balancing strategies. Specifically, the proposed fine-grained planning approach refines traditional spiral routes, reducing path redundancy and enhancing coverage efficiency. Experimental results demonstrate that HCB outperforms baseline methods in most instances while maintaining high computation efficiency. Notably, on a large-scale real-world map (366 × 376 with 40 UAVs), HCB achieves improvements in makespan of 33.82%, 9.79%, 6.37%, and 12.34% over four heuristic-based baselines, and an 86.66% improvement over MIP-based approach.
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 866-876
Scalable RL-Based Online Scheduling Framework for Modular Process Systems
To meet the online scheduling requirements of large-scale parallel systems, traditional centralized path planning algorithms suffer from severe computational bottlenecks as system scale increases. This paper proposes FreeFlow, a fully decentralized, expert-free framework for online distributed scheduling. The core highlight of FreeFlow is to decouple decision complexity from system scale, enabling highly parallel execution on ultra-large platforms without the need for global state synchronization. Driven strictly by local observations, FreeFlow employs a guided reward mechanism that promotes proactive collision avoidance and cooperative spatial distribution without relying on expert knowledge or heuristic guidance. To support continuous task streams, we further introduce a dynamic agent pool mechanism based on object reuse, addressing the mismatch between dynamic task arrivals and fixed input dimensions in parallel neural networks. Extensive experiments show that FreeFlow achieves throughput comparable to state-of-the-art centralized methods in large-scale settings while significantly reducing runtime. It also demonstrates strong generalization to larger environments, maintaining over 92% success rate with millisecond-level inference latency in a 1024×1024 grid environment.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 866-876
Open AccessScalable RL-Based Online Scheduling Framework for Modular Process Systems
To meet the online scheduling requirements of large-scale parallel systems, traditional centralized path planning algorithms suffer from severe computational bottlenecks as system scale increases. This paper proposes FreeFlow, a fully decentralized, expert-free framework for online distributed scheduling. The core highlight of FreeFlow is to decouple decision complexity from system scale, enabling highly parallel execution on ultra-large platforms without the need for global state synchronization. Driven strictly by local observations, FreeFlow employs a guided reward mechanism that promotes proactive collision avoidance and cooperative spatial distribution without relying on expert knowledge or heuristic guidance. To support continuous task streams, we further introduce a dynamic agent pool mechanism based on object reuse, addressing the mismatch between dynamic task arrivals and fixed input dimensions in parallel neural networks. Extensive experiments show that FreeFlow achieves throughput comparable to state-of-the-art centralized methods in large-scale settings while significantly reducing runtime. It also demonstrates strong generalization to larger environments, maintaining over 92% success rate with millisecond-level inference latency in a 1024×1024 grid environment.
- 22 October 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 299
An online multi-agent path finding algorithm for large-scale puzzle-based conveyor system
- 22 October 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 299
An online multi-agent path finding algorithm for large-scale puzzle-based conveyor system
- 10 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 11982-11995
Omniveyor: An Assembled Logistics Sorting System Powered by Reinforcement Learning
To improve logistics efficiency, smart logistics sorting is an inevitable trend in logistics development. Existing smart logistics sorting systems suffer from high construction costs or limited scalability. To solve these problems, we design a brand-new two-dimensional conveyor system called Omniveyor, which transports and sorts high-density packages within a limited space. It is assembled from multiple repetitive square conveyor modules, achieving the goal of cost-effectiveness and easy maintenance. To realize automatic sorting, we model the planning problem on Omniveyor and propose a scheduling strategy named MMPPO by reinforcement learning. Unlike traditional path planning, MMPPO assigns actions to modules rather than packages, which reduces scheduling overhead in high-throughput scenarios. Furthermore, we develop a simulation environment to inspect the effectiveness of our method, which solves an intractable package-following problem that has plagued simulation implementation in this field. Experimental results show that MMPPO outperforms baselines in terms of throughput and overall consumption at high densities. Besides, we implement a physical prototype of Omniveyor to validate its feasibility.
- 10 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 11982-11995
Omniveyor: An Assembled Logistics Sorting System Powered by Reinforcement Learning
To improve logistics efficiency, smart logistics sorting is an inevitable trend in logistics development. Existing smart logistics sorting systems suffer from high construction costs or limited scalability. To solve these problems, we design a brand-new two-dimensional conveyor system called Omniveyor, which transports and sorts high-density packages within a limited space. It is assembled from multiple repetitive square conveyor modules, achieving the goal of cost-effectiveness and easy maintenance. To realize automatic sorting, we model the planning problem on Omniveyor and propose a scheduling strategy named MMPPO by reinforcement learning. Unlike traditional path planning, MMPPO assigns actions to modules rather than packages, which reduces scheduling overhead in high-throughput scenarios. Furthermore, we develop a simulation environment to inspect the effectiveness of our method, which solves an intractable package-following problem that has plagued simulation implementation in this field. Experimental results show that MMPPO outperforms baselines in terms of throughput and overall consumption at high densities. Besides, we implement a physical prototype of Omniveyor to validate its feasibility.