A genetic algorithm–based area coverage approach for controlled drug delivery using microrobots

References 

1. Zhang MJ, Tarn TJ, Xi N. Micro-/nano-devices for controlled drug delivery. In: Proceedings of the 2004 IEEE International Conference on Robotics and Automation; 2004 April 26-May 1; New Orleans, La. New Orleans: The Conference; 2004;p. 2068–2073
2. Ahn CW, Ramakrishna RS. A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput. 2000;6:566–579
3. Xiao J, Zhang L. Adaptive evolutionary planner/navigator for mobile robots. IEEE Trans Evol Comput. 1997;1:18–28
4. Ioannis KN. Evolutionary algorithm based offline/online path planner for UAV navigation. IEEE Trans Syst Man Cybern. 2003;33:898–912
5. Mal NK, Fujiwara M, Tanaka Y. Photocontrolled reversiblerelease of guest molecules from cumarin-modified mesoporoussilica. Nature. 2003;421:350–353
   • MEDLINE
   • CrossRef
6. Carrasquill KG, Ricker JA, Rigas IK, Miller JW, Gragoudas ES, Adamis AP. Controlled delivery of the anti-VEGF aptamer EYE001 with polylactic-co-glycolic acid microspheres. Invest Ophthalmol Visual Sci. 2003;44:290–299
7. Allen C, Masinger D, Eisenberg E. Nanoengineering block copolymer aggregates for drug delivery. Colloids Surf, B Biointerfaces. 1999;16:3–27
8. Dario P, Carrozza MC, Allotter B. Micromechatronics in medicine. IEEE/ASME Trans Mechatron. 1996;1:137–148
9. Greatbatch W, Holes CF. History of implantable devices. IEEE Eng Med Biol. 1991;10:38–49
10. Rubinstein L. A practical nanorobot for treatment of various medical problems. In: Proceedings of the 8th Foresight Conference on Molecular Nanotechnology; 2000 Nov 3–5; Bethesda, Md. Bethesda: The Conference; 2000;
11. Michalewicz Z. Genetic algorithms + data structures = evolution programs. New York: Springer-Verlag; 1999;
12. Tao WM, How KY. A decentralized approach for cooperative sweeping by multiple mobile robots. In: Proceedings of the IEEE/RSJ Intelligents Robot and Systems Conference (IROS98); 1998 Oct 17–21; Victoria, Canada. Victoria: The Conference; 1998;p. 380–385
13. Choset H. Coverage for robotics—a survey of recent results. Ann Math Artif Intelligence. 2001;31:113–126
14. Hofner C, Schmidt G. Path planning and guidance techniques for an autonomous mobile cleaning robot. Robotics Automation Syst. 1995;14:199–212
15. Acar EU. Morse decomposition for coverage tasks. Int J Robotics Res. 2001;21:331–344
16. Butler ZJ. Simulation and experimental evaluation of sensor-based coverage in rectilinear environments. Exp Robotics. 2001;417–426
17. Hert S. A terrain-covering algorithm for an AUVAutonom. Robots. 1996;3:91–119
18. Huang WH. Optimal line-sweep decompositions for coverage algorithms. In: Proceedings of the IEEE International Conference on Robotics and Automation; 2001 May 21–26, Seoul, Korea. Seoul: The Conference; 2001;p. 27–32
19. Guo Y. Coverage control for a mobile robot patrolling a dynamic and uncertain environment. In: Proceedings of the World Congress on Intelligent Control and Automation; 2004 June 15–17; Hangzhou, China. 2004;p. 235–240
20. Zelinsky A. Planning paths of complete coverage of an unstructured environment by a mobile robot. In: Proceedings of the International Conference on Advanced Robotics; 1993 Nov 25–27; Tokyo, Japan. Tokyo: The Conference; 1993;p. 533–538
21. Gabriely Y, Rimon E. Spanning-tree based coverage of continuous areas by a mobile robot. In: Proceedings of the IEEE International Conference on Robotics and Automation; 2001 May 21–26; Seoul, Korea. Seoul: The Conference; 2001;p. 1927–1933
22. Latombe JC. Robot motion planning. Norwell (MA): Kluwer Academic Publishers; 1991;