光学镊子
运动规划
二部图
夹持器
计算机科学
匹配(统计)
马尔可夫决策过程
过程(计算)
路径(计算)
马尔可夫过程
图形
数学优化
机器人
算法
工程类
人工智能
理论计算机科学
物理
光学
数学
机械工程
统计
操作系统
程序设计语言
作者
Ashis G. Banerjee,Sagar Chowdhury,Wolfgang Losert,Satyandra K. Gupta
标识
DOI:10.1109/tase.2012.2200102
摘要
Automated transport of multiple particles using optical tweezers requires real-time path planning to move them in coordination by avoiding collisions among themselves and with randomly moving obstacles. This paper develops a decoupled and prioritized path planning approach by sequentially applying a partially observable Markov decision process algorithm on every particle that needs to be transported. We use an iterative version of a maximum bipartite graph matching algorithm to assign given goal locations to such particles. We then employ a three-step method consisting of clustering, classification, and branch and bound optimization to determine the final collision-free paths. We demonstrate the effectiveness of the developed approach via experiments using silica beads in a holographic tweezers setup. We also discuss the applicability of our approach and challenges in manipulating biological cells indirectly by using the transported particles as grippers.
科研通智能强力驱动
Strongly Powered by AbleSci AI