Testing Path Searching for Digital Microfluidic Biochips based on the Improved Particle Swarm Optimization

被引:3
|
作者
Zheng, Wenbin [1 ]
Shi, Jinlong [1 ]
Qiao, Jiaqing [1 ]
Fu, Ping [1 ]
Jiang, Hongyuan [2 ]
机构
[1] Harbin Inst Technol, Sch Elect & Informat Engn, Harbin, Peoples R China
[2] Harbin Inst Technol, Sch Mechatron Engn, Harbin, Peoples R China
关键词
DMFB; on-line testing; improved particle swarm optimization;
D O I
10.1109/I2MTC50364.2021.9459800
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Digital microfluidic biochips (DMFBs) is an attractive platform for immunoassays, point-of-care clinical diagnostics due to its flexible application and low fabrication cost and further for the development of instruments. Due to the DMFBs have been applied for these safe-critical field, those procedures require high output precision, so the reliability of the chips are extremely important. On-line testing methods are required to ensure robust DMFB operation and high confidence in the outcome of experiments, so a robust testing method is necessary. Many testing methods have been proposed, but most of them are simple functional testing or off-line testing. These testing methods are increasingly unable to meet the requirements of current chip testing. The online test means that there are testing droplet and bioassays running on the DMFB simultaneously. This paper introduces a heuristic method to optimize the testing path. The study utilizes the improved particle swarm optimization to solve the problem. The simulation results showed the proposed method is convergent and could be applied in various operations to reduce about 20% searching time, compared with the improved ant colony algorithm.
引用
收藏
页数:6
相关论文
共 50 条
  • [21] Testing of Digital Microfluidic Biochips with Arbitrary Layouts
    Trung Anh Dinh
    Yamashita, Shigeru
    Ho, Tsung-Yi
    Chakrabarty, Krishnendu
    2015 20th IEEE European Test Symposium (ETS), 2015,
  • [22] Optimized Concurrent Testing of Digital Microfluidic Biochips
    Ghosh, Sourav
    Rahaman, Hafizur
    Giri, Chandan
    2018 31ST INTERNATIONAL CONFERENCE ON VLSI DESIGN AND 2018 17TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS (VLSID & ES), 2018, : 453 - 454
  • [23] An Improved Hybrid Particle Swarm Optimization Path Planning Algorithm Based on Particle Reactivation
    Luo, Yuan
    Zhang, Xianfeng
    Wu, Jinke
    IAENG International Journal of Computer Science, 2024, 51 (10) : 1534 - 1545
  • [24] A Layout Based Customized Testing Technique for Total Microfluidic Operations in Digital Microfluidic Biochips
    Roy, Pranab
    Rahaman, Hafizur
    Dasgupta, Parthasarathi
    PROCEEDINGS OF THE 2014 IEEE 17TH INTERNATIONAL SYMPOSIUM ON DESIGN AND DIAGNOSTICS OF ELECTRONIC CIRCUITS & SYSTEMS (DDECS), 2014, : 122 - 128
  • [25] Collaborative Optimization Based on Particle Swarm Optimization and Chaos Searching
    Li Ying
    Wang Jingsheng
    Wei Lixin
    PROCEEDINGS OF THE 31ST CHINESE CONTROL CONFERENCE, 2012, : 2427 - 2431
  • [26] Safe path planning of mobile robot based on improved particle swarm optimization
    Guo, Bingbing
    Sun, Yuan
    Chen, Yiyang
    TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2024,
  • [27] Local Path Planning for USV Based on Improved Quantum Particle Swarm Optimization
    Xia, Guoqing
    Han, Zhiwei
    Zhao, Bo
    2019 CHINESE AUTOMATION CONGRESS (CAC2019), 2019, : 714 - 719
  • [28] Mobile Robot Path Planning Based on Improved Localized Particle Swarm Optimization
    Zhang, Lin
    Zhang, Yingjie
    Li, Yangfan
    IEEE SENSORS JOURNAL, 2021, 21 (05) : 6962 - 6972
  • [29] Path Planning of Mobile Robots Based on an Improved Particle Swarm Optimization Algorithm
    Yuan, Qingni
    Sun, Ruitong
    Du, Xiaoying
    PROCESSES, 2023, 11 (01)
  • [30] Path Planning of Escort Robot Based on Improved Quantum Particle Swarm Optimization
    Jiao, Ming-hai
    Wei, He-xiang
    Zhang, Bo-wen
    Jin, Jia-qi
    Jia, Zhen-qiang
    Yan, Jun-lang
    PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019), 2019, : 3730 - 3735