Skip to main content

Advertisement

SpringerLink
Log in

A hybrid co-evolutionary genetic algorithm for multiple nanoparticle assembly task path planning

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, a hybrid co-evolutionary genetic algorithm (HCGA) has been presented for determining the optimal moving paths of several nanoparticles in a complex environment. In the proposed approach, an artificial potential field (APF) has been used to determine the feasible initial paths for moving the nanoparticles. The proposed APF prepares a potential map of the environment using the initial positions of the nanoparticles and positions of the obstacles and surface roughness. The cost function used in this paper includes the area under the critical force-time diagram, surface roughness as well as path smoothness. The performed investigations indicate the importance of each of these parameters in determining the optimal paths for displacing the nanoparticles. Also, the dynamic application of crossover and mutation operators has been used to avoid premature convergence. Using the information of the potential map, two new operators have been introduced to improve the feasible and infeasible paths. Furthermore, a novel co-evolutionary mechanism for solving the multiple nanoparticle path planning problems has been presented. The proposed co-evolutionary mechanism is able to determine the best destination for each particle, optimal sequence of moves for several particles, and also the optimal path for moving each particle. Finally, the performance of the proposed HCGA has been compared with the conventional genetic algorithm (CGA) and the ant colony optimization algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sitti M, Hashimoto H (2000) Controlled pushing of nanoparticles: modeling and experiments. IEEE/ASME Trans Mechatron 5:199–211

    Article  Google Scholar 

  2. A. Tafazzoli and M. Sitti (2004) Dynamic behavior and simulation of nanoparticles sliding during nanoprobe-based positioning. Presented at the Inter. Mech. Eng. congress (ASME)

  3. A. Tafazzoli and M. Sitti (2004) Dynamic modes of nanoparticle motion during nanoprobe-based manipulation. In Proc. of IMECE’04

  4. MH Korayem, AK Hoshiar (2013) Dynamic 3D modeling and simulation of nanoparticles manipulation using an AFM nanorobot. Robotica 1–17

  5. Korayem MH, Hoshiar AK (2013) Modeling and simulation of dynamic modes in the manipulation of nanorods. Micro Nano Lett 8:284–286

    Article  Google Scholar 

  6. A. Tafazzoli, C. Pawashe, and M. Sitti (2005) Atomic force microscope based two dimensional assembly of micro/nanoparticles. In Proc. of the 6th IEEE International Symposium on Assembly and Task Planning

  7. Guthold M, Falvo MR, Matthews WG, Paulson SWS, Erie DA (2000) Controlled manipulation of molecular samples with the nanomanipulator. IEEE/ASME Trans Mechatron 5:189–198

    Article  Google Scholar 

  8. Requicha AAG, Baur C, Bugacov A, Gazen BC, Koel B, Madhukar A et al (1988) Nanorobotic assembly of two-dimensional structures . Proceeding of IEEE Int. Conf. Robotics and Automation, Leuven, pp 3368–3374

    Google Scholar 

  9. Chen H, Xi N, Li G (2006) CAD-guided automated nanoassembly using atomic force microscopy-based nonrobotics. IEEE Trans Autom Sci Eng 3:208–217

    Article  Google Scholar 

  10. A. Varol, I. Gunev, C. Basdogan (2006) A virtual reality toolkit for path planning and manipulation at nano-scale. Symp Haptic Interfaces Virtual Environ Teleoper Syst 485-489

  11. Choset H, Lynch K, Hutchinson S, Kantor G, Burgard W, Kavraki LL et al (2005) Principles of robot motion: theory, algorithms, and implementation. MIT Press, Cambridge

    MATH  Google Scholar 

  12. Makaliwe JH, Requicha AAG (2001) Automatic planning of nanoparticle assembly tasks. Proceedings of the IEEE International Symposium on Assembly and Task Planning, Fukuoka

    Book  Google Scholar 

  13. Canny JF (1998) The complexity of robot motion planning. MIT Press, Cambridge

    Google Scholar 

  14. Zhang Y, Gong D-W, Zhang J-H (2013) Robot path planning in uncertain environment using multi-objective particle swarm optimization. Neurocomputing 103:172–185

    Article  Google Scholar 

  15. Buniyamin N, Sariff N, Ngah WAJW, Mohamad Z (2011) Robot global path planning overview and a variation of ant colony system algorithm. Int J Math Comput Simul 5:151–159

    Google Scholar 

  16. Qu H, Xing K, Alexander T (2013) An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots. Neurocomputing 120:509–517

    Article  Google Scholar 

  17. Davoodi M, Panahi F, Mohades A, Hashemi SN (2013) Multi-objective path planning in discrete space. Appl Soft Comput 13:709–720

    Article  Google Scholar 

  18. Tuncer A, Yildirim M (2012) Dynamic path planning of mobile robots with improved genetic algorithm. Comput Electr Eng 38:1564–1572

    Article  Google Scholar 

  19. Liu C, Liu H, Yang J (2011) A path planning method based on adaptive genetic algorithm for mobile robot. J Inf Comput Sci 8:808–814

    Google Scholar 

  20. Yun SC, Ganapathy V, Chong LO (2010) Improved genetic algorithms based optimum path planning for mobile robot. 11th International Conference of Control Automation, Robotics and Vision (ICARCV), Singapore

    Book  Google Scholar 

  21. Korayem MH, Esmaeilzadehha S (2012) Virtual reality interface for nano-manipulation based on enhanced images. Int J Adv Manuf Technol 63:1153–1166

    Article  Google Scholar 

  22. Liu Y, Bharadwaj KK (2012) A hybrid artificial potential field: genetic algorithm approach to mobile robot path planning in dynamic environments. Comput Sci Converg Lect Note Electric Eng 114:325–333

    Article  Google Scholar 

  23. Pandey HM, Chaudhary A, Mehrotra D (2014) A comparative review of approaches to prevent premature convergence in GA. Appl Soft Comput 24:1047–1077

    Article  Google Scholar 

  24. Nicoară ES (2009) Mechanisms to avoid the premature convergence of genetic algorithms. Pet Gas Univ Ploiesti Bull Math 61:87–96

    Google Scholar 

  25. L. Davis (1985) Applying adaptive algorithms to epistatic domains. Presented at the Proceedings of the 9th international joint conference on Artificial intelligence

  26. T. Starkweather, S. Mcdaniel, K. E. Mathias, L. Darrell Whitley, C. Whitley (1991) A comparison of genetic sequencing operators. Inter. Conf. on Genetic Algorithms ICGA

  27. Misevicius A, Rubliauskas D (2005) Performance of hybrid genetic algorithm for the grey pattern problem. Info Technol Control 34:15–24

    Google Scholar 

  28. Misevičius A, Kilda B (2005) Comparison of crossover operators for the quadratic assignment problem. Info Technol Control 34:109–119

    Google Scholar 

  29. DE Goldberg, R Lingle (1985) Alleles, loci, and the traveling salesman problem. Proceedings of the 1st International Conference on Genetic Algorithms

Download references

Author information

Authors and Affiliations

  1. Robotic Research Laboratory, Center of Excellence in Experimental Solid Mechanics and Dynamics, School of Mechanical Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran

    M. H. Korayem & M. Nazarahari

  2. Faculty of Industrial and Mechanical Engineering, Islamic Azad University, Qazvin Branch, Qazvin, Iran

    A. K. Hoshiar

Authors
  1. M. H. Korayem
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. K. Hoshiar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Nazarahari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. H. Korayem.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Korayem, M.H., Hoshiar, A.K. & Nazarahari, M. A hybrid co-evolutionary genetic algorithm for multiple nanoparticle assembly task path planning. Int J Adv Manuf Technol 87, 3527–3543 (2016). https://doi.org/10.1007/s00170-016-8683-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-016-8683-4

Keywords

Search

Navigation