메뉴 건너뛰기




Volumn 5883 LNAI, Issue , 2009, Pages 212-221

Optimal planning with ACO

Author keywords

[No Author keywords available]

Indexed keywords

ANT-COLONY OPTIMIZATION; APPROXIMATE METHODS; HARD COMPUTATIONAL PROBLEM; HEURISTIC FUNCTIONS; OPTIMAL PLANNING; OPTIMALITY; PHEROMONE MODELS; PLANNING FRAMEWORK; SEQUENTIAL OPTIMIZATION; STATE SPACE;

EID: 78650700296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10291-2_22     Document Type: Conference Paper
Times cited : (5)

References (11)
  • 5
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • PII S1089778X97033031
    • Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53-66 (1997) (Pubitemid 127771018)
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 8
    • 29344444840 scopus 로고    scopus 로고
    • New Admissible Heuristics for Domain-Independent Planning
    • Haslum, P., Bonet, B., Geffner, H.: New Admissible Heuristics for Domain-Independent Planning. In: Proc. of AAAI 2005, pp. 1163-1168 (2005)
    • (2005) Proc. of AAAI 2005 , pp. 1163-1168
    • Haslum, P.1    Bonet, B.2    Geffner, H.3
  • 9
  • 10
    • 0036377352 scopus 로고    scopus 로고
    • The FF Planning System: Fast Plan Generation Through Heuristic Search
    • Hoffmann, J., Nebel, B.: The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research 14, 253-302 (2001)
    • (2001) Journal of Artificial Intelligence Research , vol.14 , pp. 253-302
    • Hoffmann, J.1    Nebel, B.2


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