When Droplets Can “Think”: Intelligent Testing in Digital Microfluidic Chips

Digital microfluidic biochips (DMFBs) find extensive applications in biochemical experiments, medical diagnostics, and safety-critical domains, with their reliability dependent on efficient online testing technologies. However, traditional random search algorithms suffer from slow convergence and susceptibility to local optima under complex fluidic constraints. This paper proposes a hybrid optimization method based on priority strategy and an improved sparrow search algorithm for DMFB online test path planning. At the algorithmic level, the improved sparrow search algorithm incorporates three main components: tent chaotic mapping for population initialization, cosine adaptive weights together with Elite Opposition-based Learning (EOBL) to balance global exploration and local exploitation, and a Gaussian perturbation mechanism for fine-grained refinement of promising solutions. Concurrently, this paper proposes an intelligent rescue strategy that integrates global graph-theoretic pathfinding, local greedy heuristics, and space–time constraint verification to establish a closed-loop decision-making system. The experimental results show that the proposed algorithm is efficient. On the standard 7 × 7–15 × 15 DMFB benchmark chips, the shortest offline test path length obtained by the algorithm is equal to the length of the Euler path, indicating that, for these regular layouts, the shortest test path has reached the known optimal value. In both offline and online testing, the shortest paths found by the proposed method are better than or equal to those of existing mainstream algorithms. In particular, for the 15 × 15 chip under online testing, the proposed method reduces the path length from 543 and 471 to 446 compared with the IPSO and IACA algorithms, respectively, and reduces the standard deviation by 53.14% and 39.4% compared with IGWO in offline and online testing.