메뉴 건너뛰기




Volumn 24, Issue 2, 2008, Pages 283-292

A complete and scalable strategy for coordinating multiple robots within roadmaps

Author keywords

Complexity; Mobile robots; Path planning; Trajectory planning

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; MOTION CONTROL; MOTION PLANNING;

EID: 42549129239     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2008.918056     Document Type: Article
Times cited : (110)

References (22)
  • 1
    • 0029199049 scopus 로고
    • Multi-robot cooperation through incremental plan-merging
    • R. Alami, F. Robert, F. Ingrand, and S. Suzuki, "Multi-robot cooperation through incremental plan-merging," in Proc. ICRA, 1995, pp. 2573-2579.
    • (1995) Proc. ICRA , pp. 2573-2579
    • Alami, R.1    Robert, F.2    Ingrand, F.3    Suzuki, S.4
  • 2
    • 0030651505 scopus 로고    scopus 로고
    • Conflict-free motion of multiple mobile robots based on decentralized motion planning and negotiation
    • K Azarm and G Schmidt, "Conflict-free motion of multiple mobile robots based on decentralized motion planning and negotiation," in Proc. IEEE Int. Conf. Robot. Autom., 1997, pp. 3526-3533.
    • (1997) Proc. IEEE Int. Conf. Robot. Autom , pp. 3526-3533
    • Azarm, K.1    Schmidt, G.2
  • 3
    • 0026369737 scopus 로고
    • Robot motion planning: A distributed representation approach
    • Jérîme Barraquand and J.-C. Latombe, "Robot motion planning: A distributed representation approach," Int. J. Robot. Res., vol. 10, no. 6, pp. 628-649, 1991.
    • (1991) Int. J. Robot. Res , vol.10 , Issue.6 , pp. 628-649
    • Barraquand, J.1    Latombe, J.-C.2
  • 4
    • 0034860668 scopus 로고    scopus 로고
    • Optimizing schedules for prioritized path planning of multi-robot systems
    • M. Bennewitz, W. Burgard, and S. Thrun, "Optimizing schedules for prioritized path planning of multi-robot systems," in Proc. IEEE Int. Conf. Robot. Autom., 2001, pp. 271-276.
    • (2001) Proc. IEEE Int. Conf. Robot. Autom , pp. 271-276
    • Bennewitz, M.1    Burgard, W.2    Thrun, S.3
  • 5
    • 0005320280 scopus 로고    scopus 로고
    • Sensor based motion planning: The hierarchical generalized voronoi graph
    • H. Choset and J. Burdick, "Sensor based motion planning: The hierarchical generalized voronoi graph," in Proc. Workshop Algorithmic Found. Robot., 1996.
    • (1996) Proc. Workshop Algorithmic Found. Robot
    • Choset, H.1    Burdick, J.2
  • 6
    • 0344877476 scopus 로고    scopus 로고
    • Motion planning for multi-robot systems using dynamic robot networks
    • C. Clark, S. Rock, and J. C. Latombe, "Motion planning for multi-robot systems using dynamic robot networks," in Proc. IEEE Int. Conf. Robot. Autom., 2003, pp. 4222-4227.
    • (2003) Proc. IEEE Int. Conf. Robot. Autom , pp. 4222-4227
    • Clark, C.1    Rock, S.2    Latombe, J.C.3
  • 7
    • 0023536450 scopus 로고
    • On multiple moving objects
    • M. Erdmann and T. Lozano-Perez, "On multiple moving objects," Algorithmica, vol. 2, pp. 477-521, 1987.
    • (1987) Algorithmica , vol.2 , pp. 477-521
    • Erdmann, M.1    Lozano-Perez, T.2
  • 8
    • 0036856028 scopus 로고    scopus 로고
    • Dynamic motion planning for mobile robots using potential field method
    • S. S. Ge and Y. J. Cui, "Dynamic motion planning for mobile robots using potential field method," Auton. Robots, vol. 13, no. 3, pp. 207-222, 1997.
    • (1997) Auton. Robots , vol.13 , Issue.3 , pp. 207-222
    • Ge, S.S.1    Cui, Y.J.2
  • 9
    • 0346239692 scopus 로고    scopus 로고
    • The player/stage project: Tools for multi-robot and distributed sensor systems
    • Coimbra, Portugal, Jun
    • B. P. Gerkey, R. T. Vaughan, and A. Howard, "The player/stage project: Tools for multi-robot and distributed sensor systems," in Proc. ICAR 2003, Coimbra, Portugal, Jun. 2003, pp. 317-323.
    • (2003) Proc. ICAR 2003 , pp. 317-323
    • Gerkey, B.P.1    Vaughan, R.T.2    Howard, A.3
  • 10
    • 0036058197 scopus 로고    scopus 로고
    • A distributed and optimal motion planning approach for multiple mobile robots
    • Y. Guo and L. Parker, "A distributed and optimal motion planning approach for multiple mobile robots," in Proc. IEEE Int. Conf. Robot. Autom., 2002, pp. 2612-2619.
    • (2002) Proc. IEEE Int. Conf. Robot. Autom , pp. 2612-2619
    • Guo, Y.1    Parker, L.2
  • 11
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • Jul
    • E. E. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. SSC, vol. 4, no. 2, pp. 100-107, Jul. 1968.
    • (1968) IEEE Trans. SSC , vol.4 , Issue.2 , pp. 100-107
    • Hart, E.E.1    Nilsson, N.J.2    Raphael, B.3
  • 12
    • 0021589170 scopus 로고
    • On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the 'warehouseman's problem', Int
    • J. E. Hopcroft, J. T. Schwartz, and M. Sharir, "On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the 'warehouseman's problem'," Int. J. Robot. Res., vol. 3, no. 4, pp. 76-88, 1984.
    • (1984) J. Robot. Res , vol.3 , Issue.4 , pp. 76-88
    • Hopcroft, J.E.1    Schwartz, J.T.2    Sharir, M.3
  • 13
    • 0022775989 scopus 로고
    • Toward efficient trajectory planning: The path-velocity decomposition
    • K. Kant and S. W. Zucker, "Toward efficient trajectory planning: The path-velocity decomposition," Int. J. Robot. Res., vol. 5, no. 3, pp. 72-89, 1986.
    • (1986) Int. J. Robot. Res , vol.5 , Issue.3 , pp. 72-89
    • Kant, K.1    Zucker, S.W.2
  • 16
    • 77952010176 scopus 로고    scopus 로고
    • Cambridge, U.K, Cambridge Univ Press
    • S. M. LaValle, Planning Algorithms. Cambridge, U.K.: Cambridge Univ Press, 2006.
    • (2006) Planning Algorithms
    • LaValle, S.M.1
  • 17
    • 0030713716 scopus 로고    scopus 로고
    • Decentralized motion planning for multiple mobile robots: The cocktail party model
    • V. J. Lumelsky and K. R. Harinarayan, "Decentralized motion planning for multiple mobile robots: The cocktail party model," Auton. Robots vol. 4, no. 1, pp. 121-135, 1997.
    • (1997) Auton. Robots , vol.4 , Issue.1 , pp. 121-135
    • Lumelsky, V.J.1    Harinarayan, K.R.2
  • 18
    • 0024860649 scopus 로고
    • Deadlock-free and collision-free coordination of two robot manipulators
    • P. A. O'Donnell and T. Lozano-P'erez, "Deadlock-free and collision-free coordination of two robot manipulators," in Proc. IEEE Int. Conf. Robot. Autom., 1989, pp. 484-489.
    • (1989) Proc. IEEE Int. Conf. Robot. Autom , pp. 484-489
    • O'Donnell, P.A.1    Lozano-P'erez, T.2
  • 19
    • 17044408043 scopus 로고    scopus 로고
    • Coordinating multiple robots with kinodynamic constraints along specified paths
    • J. Peng and S. Akella, "Coordinating multiple robots with kinodynamic constraints along specified paths," Int. J. Robot. Res., vol. 24, no. 4, pp. 295-310, 2005.
    • (2005) Int. J. Robot. Res , vol.24 , Issue.4 , pp. 295-310
    • Peng, J.1    Akella, S.2
  • 20
    • 84880898596 scopus 로고    scopus 로고
    • Graph decomposition for efficient multi-robot path planning
    • M. R. K. Ryan, "Graph decomposition for efficient multi-robot path planning," in Proc. IJCAI, 2007, pp. 2003-2008.
    • (2007) Proc. IJCAI , pp. 2003-2008
    • Ryan, M.R.K.1
  • 21
    • 0036476864 scopus 로고    scopus 로고
    • Path coordination for multiple mobile robots: A resolution complete algorithm
    • Feb
    • T. Siméon, S. Leroy, and J.-P. Laumond, "Path coordination for multiple mobile robots: A resolution complete algorithm," IEEE Trans. Robot. Autom., vol. 18, no. 1, pp. 42-49, Feb. 2002.
    • (2002) IEEE Trans. Robot. Autom , vol.18 , Issue.1 , pp. 42-49
    • Siméon, T.1    Leroy, S.2    Laumond, J.-P.3
  • 22
    • 0032473780 scopus 로고    scopus 로고
    • Coordinated path planning for multiple robots
    • P. Svestka and M. Overmars, "Coordinated path planning for multiple robots," Robot. Auton. Syst., vol. 23, pp. 125-152, 1998.
    • (1998) Robot. Auton. Syst , vol.23 , pp. 125-152
    • Svestka, P.1    Overmars, M.2


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