18 June 2024 in Neural Networks
10 February 2025 in IEEE Transactions on Automation Science and Engineering
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.
22 October 2025 in Expert Systems with Applications
25 February 2026 in Ocean Engineering
6 November 2026 in ACM Transactions on Sensor Networks
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.