메뉴 건너뛰기




Volumn 14, Issue 2, 2009, Pages 198-206

Multiple traveling robot problem: A solution based on dynamic task selection and robust execution

Author keywords

Distributed multirobot task allocation; Incremental task selection; Multiple traveling robot problem (MTRP); Robustness

Indexed keywords

COMPUTATIONAL REQUIREMENTS; COST VALUES; DISTRIBUTED MULTIROBOT TASK ALLOCATION; DYNAMIC TASKS; INCREMENTAL TASK SELECTION; MULTI-ROBOT COOPERATION; MULTIPLE TRAVELING ROBOT PROBLEM (MTRP); NP-HARD; ON DYNAMICS; PRIORITY-BASED; PROCESSING TIME; REAL ROBOT; REAL-WORLD; REAL-WORLD TASK; ROBUST EXECUTION; ROBUSTNESS; SOLUTION QUALITY; TASK ALLOCATION; TOTAL PATH LENGTH; TRAVELING ROBOTS; UNCERTAIN INFORMATIONS;

EID: 67349234584     PISSN: 10834435     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMECH.2009.2014157     Document Type: Article
Times cited : (46)

References (21)
  • 1
    • 51349118038 scopus 로고    scopus 로고
    • An integrated planning, scheduling and execution framework formulti-robot cooperation and coordination,
    • Ph.D. dissertation, Istanbul Technical Univ, Istanbul, Turkey
    • S. Sariel, "An integrated planning, scheduling and execution framework formulti-robot cooperation and coordination," Ph.D. dissertation, Istanbul Technical Univ., Istanbul, Turkey, 2007.
    • (2007)
    • Sariel, S.1
  • 3
    • 67349239099 scopus 로고    scopus 로고
    • Online, Available
    • (2008). Khepera II Real-World MTRP Videos [Online]. Available: http://www2.itu.edu.tr/~sariel/videos/KheperaII-Movies.html
    • Khepera II Real-World MTRP Videos
  • 4
    • 34347384820 scopus 로고    scopus 로고
    • Multirobot-based nanoassembly planning with automated path generation
    • Jun
    • X. Yuan and S. X. Yang, "Multirobot-based nanoassembly planning with automated path generation," IEEE/ASME Trans. Mechatronics, vol. 12, no. 3, pp. 352-356, Jun. 2007.
    • (2007) IEEE/ASME Trans. Mechatronics , vol.12 , Issue.3 , pp. 352-356
    • Yuan, X.1    Yang, S.X.2
  • 6
    • 67349270330 scopus 로고    scopus 로고
    • Naval mine countermeasure missions: A distributed, incremental multirobot task selection scheme
    • Mar
    • S. Sariel,T. Balch, and N. Erdogan, "Naval mine countermeasure missions: A distributed, incremental multirobot task selection scheme," IEEE Robot. Autom. Mag., vol. 15, no. 1, pp. 45-52, Mar. 2008.
    • (2008) IEEE Robot. Autom. Mag , vol.15 , Issue.1 , pp. 45-52
    • Sariel, S.1    Balch, T.2    Erdogan, N.3
  • 13
    • 0012642147 scopus 로고
    • O jistem problemu minimalnim (about a certain minimal problem)
    • V. Jarnik, "O jistem problemu minimalnim (about a certain minimal problem)," Prace Moravske Prirodovedecke Spolecnosti, vol. 6, pp. 57-63, 1930.
    • (1930) Prace Moravske Prirodovedecke Spolecnosti , vol.6 , pp. 57-63
    • Jarnik, V.1
  • 14
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalisations
    • R. C. Prim, "Shortest connection networks and some generalisations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, 1957.
    • (1957) Bell Syst. Tech. J , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 16
    • 0019180974 scopus 로고
    • The contract net protocol: High level communication and control in a distributed problem solver
    • Dec
    • R. G. Smith, "The contract net protocol: High level communication and control in a distributed problem solver," IEEE Trans. Comput., vol. C-29, no. 12, pp. 1104-1113, Dec. 1980.
    • (1980) IEEE Trans. Comput , vol.C-29 , Issue.12 , pp. 1104-1113
    • Smith, R.G.1
  • 17
    • 33646028508 scopus 로고    scopus 로고
    • Real time auction based allocation of tasks for multi-robot exploration problem in dynamic environments
    • Paper WS-05-06
    • S. Sariel and T. Balch, "Real time auction based allocation of tasks for multi-robot exploration problem in dynamic environments," in Proc. Integrating Planning Scheduling: Papers 2005 AAAI Workshop, pp. 27-33, Paper WS-05-06.
    • Proc. Integrating Planning Scheduling: Papers 2005 AAAI Workshop , pp. 27-33
    • Sariel, S.1    Balch, T.2
  • 19
    • 0026225350 scopus 로고
    • Tsplib - A traveling salesman problem library
    • G. Reinelt, "Tsplib - A traveling salesman problem library," ORSA J. Comput. 3, vol. 3, pp. 376-384, 1991.
    • (1991) ORSA J. Comput. 3 , vol.3 , pp. 376-384
    • Reinelt, G.1
  • 21
    • 0031640408 scopus 로고    scopus 로고
    • Grammps:A generalized mission planner for multiple robots in unstructured environments
    • B. L. Brumitt and A. Stentz, "Grammps:A generalized mission planner for multiple robots in unstructured environments," in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), 1998, pp. 1564-1571.
    • (1998) Proc. IEEE Int. Conf. Robot. Autom. (ICRA) , pp. 1564-1571
    • Brumitt, B.L.1    Stentz, A.2


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