메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 698-705

Simple auctions with performance guarantees for multi-robot task allocation

Author keywords

[No Author keywords available]

Indexed keywords

MULTI-ROBOT SIMULATORS; MULTI-ROBOT TASK ALLOCATION; TASK ALLOCATION ALGORITHMS;

EID: 14044273705     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (138)

References (18)
  • 1
    • 0029537980 scopus 로고
    • Issues and approaches in the design of collective autonomous agents
    • M. Matarić, "Issues and approaches in the design of collective autonomous agents," Robotics and Autonomous Systems, vol. 16, pp. 321-331, 1995.
    • (1995) Robotics and Autonomous Systems , vol.16 , pp. 321-331
    • Matarić, M.1
  • 2
    • 0034205975 scopus 로고    scopus 로고
    • Multiagent systems: A survey from a machine learning perspective
    • P. Stone and M. Veloso, "Multiagent systems: A survey from a machine learning perspective," Autonomous Robots, vol. 8, no. 3, 2000.
    • (2000) Autonomous Robots , vol.8 , Issue.3
    • Stone, P.1    Veloso, M.2
  • 7
    • 0037845207 scopus 로고    scopus 로고
    • Market-driven multi-robot exploration
    • Robotics Institute, Carnegie Mellon University, Pittsburgh, PA
    • R. Zlot, A. Stentz, M. Dias, and S. Thayer, "Market-driven multi-robot exploration," Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, Tech. Rep. CMU-RI-TR-02-02, 2002.
    • (2002) Tech. Rep. , vol.CMU-RI-TR-02-02
    • Zlot, R.1    Stentz, A.2    Dias, M.3    Thayer, S.4
  • 14
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling-salesman problem
    • S. Lin and B. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Operations Research, vol. 21, pp. 498516, 1973.
    • (1973) Operations Research , vol.21 , pp. 498516
    • Lin, S.1    Kernighan, B.2
  • 16
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R. C. Prim, "Shortest connection networks and some generalizations." Bell Systems Technical Journal, pp. 1389-1401, 1957.
    • (1957) Bell Systems Technical Journal , pp. 1389-1401
    • Prim, R.C.1
  • 17
    • 0003522092 scopus 로고
    • Worst-case analysis of a new heuristic for the travelling salesman problem
    • Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA
    • N. Christofides, "Worst-case analysis of a new heuristic for the travelling salesman problem," Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, Tech. Rep. 388, 1976.
    • (1976) Tech. Rep. , vol.388
    • Christofides, N.1


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