메뉴 건너뛰기




Volumn 6459 LNCS, Issue , 2010, Pages 94-105

Path planning for groups using column generation

Author keywords

[No Author keywords available]

Indexed keywords

CENTRALIZED OPTIMIZATION; COLUMN GENERATION; COMPUTER GAME; DIFFERENT ORIGINS; DYNAMIC FLOWS; IF THERE ARE; INTEGER LINEAR PROGRAMMING; LATEST ARRIVAL; PATH-PLANNING;

EID: 78649677084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16958-8_10     Document Type: Conference Paper
Times cited : (4)

References (25)
  • 1
    • 0042357566 scopus 로고    scopus 로고
    • CPLEX 11.0. Users manual ILOG SA, Gentilly, France
    • CPLEX 11.0. Users manual. Technical report, ILOG SA, Gentilly, France (2008)
    • (2008) Technical Report
  • 2
    • 33749251220 scopus 로고    scopus 로고
    • Better group behaviors in complex environments using global roadmaps
    • Bayazit, O., Lien, J.-M., Amato, N.: Better group behaviors in complex environments using global roadmaps. Artificial Life, 362-370 (2002)
    • (2002) Artificial Life , pp. 362-370
    • Bayazit, O.1    Lien, J.-M.2    Amato, N.3
  • 4
    • 0001424107 scopus 로고
    • Constructing maximal dynamic flows from static flows
    • Ford Jr., L., Fulkerson, D.: Constructing maximal dynamic flows from static flows. Operations Research 6, 419-433 (1958)
    • (1958) Operations Research , vol.6 , pp. 419-433
    • Ford Jr., L.1    Fulkerson, D.2
  • 5
    • 0002826414 scopus 로고
    • A suggested computation for maximal multi-commodity network flows
    • Ford Jr., L., Fulkerson, D.: A suggested computation for maximal multi-commodity network flows. Management Science 5, 97-101 (1958)
    • (1958) Management Science , vol.5 , pp. 97-101
    • Ford Jr., L.1    Fulkerson, D.2
  • 12
    • 77952010176 scopus 로고    scopus 로고
    • Cambridge University Press, Cambridge
    • LaValle, S.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
    • (2006) Planning Algorithms
    • LaValle, S.1
  • 13
    • 0032316235 scopus 로고    scopus 로고
    • Optimal motion planning for multiple robots having independent goals
    • LaValle, S., Hutchinson, S.: Optimal motion planning for multiple robots having independent goals. Transaction on Robotics and Automation 14, 912-925 (1998)
    • (1998) Transaction on Robotics and Automation , vol.14 , pp. 912-925
    • LaValle, S.1    Hutchinson, S.2
  • 15
    • 17044408043 scopus 로고    scopus 로고
    • Coordinating multiple robots with kinodynamic constraints along specified paths
    • Peng, J., Akella, S.: Coordinating multiple robots with kinodynamic constraints along specified paths. International Journal of Robotics Research 24, 295-310 (2005)
    • (2005) International Journal of Robotics Research , vol.24 , pp. 295-310
    • Peng, J.1    Akella, S.2
  • 16
  • 17
    • 0023379184 scopus 로고
    • Flocks herds and schools: A distributed behavioral model
    • Reynolds, C.: Flocks, herds, and schools: A distributed behavioral model. Computer Graphics 21, 25-34 (1987)
    • (1987) Computer Graphics , vol.21 , pp. 25-34
    • Reynolds, C.1
  • 19
    • 0020809396 scopus 로고
    • On the piano movers problem: III coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal obstacles
    • Schwartz, J., Sharir, M.: On the piano movers problem: III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal obstacles. International Journal of Robotics Research 2, 46-75 (1983)
    • (1983) International Journal of Robotics Research , vol.2 , pp. 46-75
    • Schwartz, J.1    Sharir, M.2
  • 24
    • 0001341584 scopus 로고
    • An algorithm for universal maximal dynamic flows in a network
    • Wilkinson, W.: An algorithm for universal maximal dynamic flows in a network. Operations Research 19, 1602-1612 (1971)
    • (1971) Operations Research , vol.19 , pp. 1602-1612
    • Wilkinson, W.1


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