Flow-based Augmented Droplet Routing Algorithm for MEDA-Based DMFB

Micro Electrode Dot Array-based Digital Microfluidic Biochip (MEDA) is a promising platform in biological and medical applications, offering high flexibility in droplet-based operations such as disease diagnosis, DNA analysis, and PCR testing.To fully exploit its capabilities, fast and accurate droplet routing is essential.In this work, we formulate droplet transportation in MEDA as a flow network problem and propose a high-speed algorithm that efficiently finds a minimum-time routing with low computation cost.The algorithm first determines the shortest routing time using maximum flow search, and then refines the solution using minimum-cost flow optimization to reduce redundant movements.The proposed algorithm enables efficient handling of large-scale problems, contributing to improved experimental efficiency of MEDA biochips.

Authors

Institutions

Publication Details

Journal
Tokyo Tech Research Repository (Tokyo Institute of Technology)
Published
2026-04-14
Primary Topic
Electrowetting and Microfluidic Technologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Flow-based Augmented Droplet Routing Algorithm for MEDA-Based DMFB

Satoshi Tayu, Emuun Purevdagva, Masayuki Shimoda, 田湯 智 et al.
Tokyo Tech Research Repository (Tokyo Institute of Technology)
Electrowetting and Microfluidic Technologies
article

Flow-based Augmented Droplet Routing Algorithm for MEDA-Based DMFB

Satoshi Tayu, Emuun Purevdagva, Masayuki Shimoda, 田湯 智, Atsushi TAKAHASHI, プレブダガバ エムン
article en

Abstract

Micro Electrode Dot Array-based Digital Microfluidic Biochip (MEDA) is a promising platform in biological and medical applications, offering high flexibility in droplet-based operations such as disease diagnosis, DNA analysis, and PCR testing.To fully exploit its capabilities, fast and accurate droplet routing is essential.In this work, we formulate droplet transportation in MEDA as a flow network problem and propose a high-speed algorithm that efficiently finds a minimum-time routing with low computation cost.The algorithm first determines the shortest routing time using maximum flow search, and then refines the solution using minimum-cost flow optimization to reduce redundant movements.The proposed algorithm enables efficient handling of large-scale problems, contributing to improved experimental efficiency of MEDA biochips.

Tokyo Tech Research Repository (Tokyo Institute of Technology)
National Institute of Information and Communications Technology (JP)
Ministry of Education, Culture, Sports, Science and Technology
Affordable and clean energy
Openalex Percentile: Top 9%
Electrowetting and Microfluidic Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.