• DocumentCode
    3045832
  • Title

    Parallel genetic algorithm for search and constrained multi-objective optimization

  • Author

    Wilson, Lucas A. ; Moore, Michelle D. ; Picarazzi, Jason P. ; Miquel, Simon D San

  • Author_Institution
    Comput. & Math. Sci., Texas A&M Univ., TX, USA
  • fYear
    2004
  • fDate
    26-30 April 2004
  • Firstpage
    165
  • Abstract
    Summary form only given. Parallel genetic algorithm for search and constrained multiobjective optimization introduces the design and complexity analysis of a parallel genetic algorithm to generate a "best" path for a robot arm to follow, given a starting position and a goal in three dimensional space. Path generation takes into account any obstacles near the arm. This algorithm uses multiple optimization criteria, independent cross-pollinating populations, and handles multiple hard constraints. Individuals in the population consist of multiple chromosomes. The complexity of the algorithm is the number of generations processed times O(N ) where N is the total number of individuals used for path generation on all of the optimizations.
  • Keywords
    computational complexity; constraint theory; genetic algorithms; manipulators; parallel algorithms; path planning; search problems; constrained multiobjective optimization; independent cross-pollinating populations; parallel genetic algorithm; robot arm path generation; Algorithm design and analysis; Biological cells; Concurrent computing; Constraint optimization; Design optimization; Genetic algorithms; NASA; Orbital robotics; Parallel robots; Space exploration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
  • Print_ISBN
    0-7695-2132-0
  • Type

    conf

  • DOI
    10.1109/IPDPS.2004.1303161
  • Filename
    1303161