Nearest Neighbor Migration in Parallel Genetic Programming for Automatic Robot Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.3973

@InProceedings{ICARCV2000Tongchim,
  author =       "Shisanu Tongchim and Prabhas Chongstitvatana",
  title =        "Nearest Neighbor Migration in Parallel Genetic
                 Programming for Automatic Robot Programming",
  booktitle =    "Proceedings of the Sixth International Conference on
                 Control, Automation, Robotics and Vision",
  year =         "2000",
  month =        dec,
  address =      "Singapore",
  keywords =     "genetic algorithms, genetic programming, Parallel
                 Genetic Programming, Mobile Robot Navigation",
  URL =          "http://www.cp.eng.chula.ac.th/faculty/pjw/paper/tongchim-226.pdf",
  abstract =     "This work presents a study of parallelization of
                 genetic programming for automatically creating a robot
                 control program in a mobile robot navigation problem. A
                 nearest neighbor migration topology is proposed to
                 reduce the communication time. This study compares the
                 performance both in terms of the solution quality and
                 the gain in execution time. The timing analysis is
                 investigated to give insight into the behavior of
                 parallel implementations. The results show that the
                 parallel algorithm with asynchronous migration using 10
                 processors is 32 times faster than the serial
                 algorithm.",
  notes =        "Citation from author",
}

Genetic Programming entries for Shisanu Tongchim Prabhas Chongstitvatana

Citations