메뉴 건너뛰기




Volumn , Issue , 2010, Pages 1354-1360

A generalized 3-D path planning method for robots using Genetic Algorithm with an adaptive evolution process

Author keywords

3 D path planning; Adaptive evolution; Genetic Algorithm

Indexed keywords

ADAPTIVE EVOLUTION; ALGORITHM EVALUATION; COMMONLY USED; GENETIC OPERATORS; NEAREST NEIGHBORS; OPTIMIZATION PROBLEMS; OPTIMIZATION STRATEGY; PATH PLANNING FOR ROBOTS; PATH PLANNING METHOD; PATH-PLANNING; PERFORMANCE ENHANCEMENTS; SAMPLE PATH; SEARCH EFFICIENCY; SEARCHING EFFICIENCY; SELECTION SCHEME; SHORTEST PATH;

EID: 77958147335     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCICA.2010.5554851     Document Type: Conference Paper
Times cited : (11)

References (14)
  • 2
    • 77958131783 scopus 로고    scopus 로고
    • http://www-cdr.stanford.edu/sangbae/Stickybot.htm
  • 4
    • 77958120146 scopus 로고    scopus 로고
    • http://nanolab.me.cmu.edu/projects/waalbots/gecko.shtml
  • 6
    • 0033320918 scopus 로고    scopus 로고
    • Genetic algorithm for adaptive planning of path and trajectory of a mobile robot in 2D terrrains
    • K. Sugihara, and J. Smith, "Genetic algorithm for adaptive planning of path and trajectory of a mobile robot in 2D terrrains", IEICE Trans. Inf. Syst. Vol. E82-D(1), pp. 309-317, 1999
    • (1999) IEICE Trans. Inf. Syst , vol.E82-D , Issue.1 , pp. 309-317
    • Sugihara, K.1    Smith, J.2
  • 10
    • 45649085382 scopus 로고    scopus 로고
    • Path planning on a cuboid using genetic algorithms
    • August
    • Aybars UUR, "Path planning on a cuboid using genetic algorithms", Information Sciences: an International Journal, vol. 178, no. 178, pp. 3275-3287, August, 2008
    • (2008) Information Sciences: An International Journal , vol.178 , Issue.178 , pp. 3275-3287
    • Aybars, U.U.R.1
  • 11
    • 0001237146 scopus 로고
    • A method for solving traveling salesman problems
    • G.A. Croes, "A method for solving traveling salesman problems", Operations Research, vol. 6, no. 6, pp. 791-812, 1958
    • (1958) Operations Research , vol.6 , Issue.6 , pp. 791-812
    • Croes, G.A.1
  • 12
    • 0001193147 scopus 로고    scopus 로고
    • The traveling salesman problem: A case study in local optimization
    • E. Aarts, J.K. Lenstra (Eds.) Wiley, New York
    • D.S. Johnson, L.A. McGeoch, The traveling salesman problem: a case study in local optimization, in: E. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997
    • (1997) Local Search in Combinatorial Optimization
    • Johnson, D.S.1    McGeoch, L.A.2
  • 13
    • 77958134802 scopus 로고    scopus 로고
    • One improvement to nearest neighbor method for solving traveling salesman problem
    • Novi Sad
    • J. Kratica, S. Radojevic, "One improvement to nearest neighbor method for solving Traveling salesman problem", in Proceedings of the LIRA 95, pp. 77-82, Novi Sad, 1996
    • (1996) Proceedings of the LIRA 95 , pp. 77-82
    • Kratica, J.1    Radojevic, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.