메뉴 건너뛰기




Volumn 17, Issue , 2005, Pages 171-186

Pareto optimal coordination on Roadmaps

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS;

EID: 84862146102     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/10991541_13     Document Type: Article
Times cited : (6)

References (26)
  • 1
    • 0036055650 scopus 로고    scopus 로고
    • Coordinating the motions of multiple robots with specified trajectories
    • S. Akella and S. Hutchinson. Coordinating the motions of multiple robots with specified trajectories. In Proc. IEEE Int. Conf. on Robot. and Autom., pages 624-631, 2002.
    • (2002) Proc. IEEE Int. Conf. On Robot. and Autom , pp. 624-631
    • Akella, S.1    Hutchinson, S.2
  • 2
    • 0025888194 scopus 로고
    • Dynamic game applied to coordination control of two arm robotic system
    • In R. P. Ḧam̈al̈ainen and H. K. Ehtamo, editors, Springer-Verlag, Berlin
    • M. D. Ardema and J. M. Skowronski. Dynamic game applied to coordination control of two arm robotic system. In R. P. Ḧam̈al̈ainen and H. K. Ehtamo, editors, Differential Games - Developments in Modelling and Computation, pages 118-130. Springer-Verlag, Berlin, 1991.
    • (1991) Differential Games - Developments In Modelling and Computation , pp. 118-130
    • Ardema, M.D.1    Skowronski, J.M.2
  • 3
    • 0026369737 scopus 로고
    • Robot motion planning: A distributed representation approach
    • December
    • J. Barraquand and J.-C. Latombe. Robot motion planning: A distributed representation approach. Int. J. Robot. Res., 10(6):628-649, December 1991.
    • (1991) Int. J. Robot. Res , vol.10 , Issue.6 , pp. 628-649
    • Barraquand, J.1    Latombe, J.-C.2
  • 4
    • 0026880820 scopus 로고
    • A minimum-time trajectory planning method for two robots
    • June
    • Z. Bien and J. Lee. A minimum-time trajectory planning method for two robots. IEEE Trans. Robot. & Autom., 8(3):414-418, June 1992.
    • (1992) IEEE Trans. Robot. & Autom , vol.8 , Issue.3 , pp. 414-418
    • Bien, Z.1    Lee, J.2
  • 6
    • 0028387026 scopus 로고
    • Collision avoidance of two robot manipulators by minimum delay time
    • C. Chang, M. J. Chung, and B. H. Lee. Collision avoidance of two robot manipulators by minimum delay time. IEEE Trans. Syst., Man, Cybern., 24(3):517-522, 1994.
    • (1994) IEEE Trans. Syst., Man, Cybern , vol.24 , Issue.3 , pp. 517-522
    • Chang, C.1    Chung, M.J.2    Lee, B.H.3
  • 11
    • 34648849361 scopus 로고    scopus 로고
    • Shape complexes for metamorphic robot systems
    • STAR 7, Springer-Verlag
    • R. Ghrist. Shape complexes for metamorphic robot systems. In Algorithmic Foundations of Robotics V, STAR 7, Springer-Verlag, 185-201, 2004.
    • (2004) Algorithmic Foundations of Robotics V , pp. 185-201
    • Ghrist, R.1
  • 13
    • 0026289318 scopus 로고
    • Coping with uncertainty in control and planning for a mobile robot
    • Osaka, Japan, Novembe
    • H. Hu, M. Brady, and P. Probert. Coping with uncertainty in control and planning for a mobile robot. In IEEE/RSJ Int. Workshop on Intelligent Robots and Systems, pages 1025-1030, Osaka, Japan, November 1991.
    • (1991) IEEE/RSJ Int. Workshop On Intelligent Robots and Systems , pp. 1025-1030
    • Hu, H.1    Brady, M.2    Probert, P.3
  • 14
    • 0002429537 scopus 로고
    • Optimal search in planar subdivisions
    • D.G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12(1):28-35, 1983.
    • (1983) SIAM J. Comput , vol.12 , Issue.1 , pp. 28-35
    • Kirkpatrick, D.G.1
  • 15
  • 16
    • 0032316235 scopus 로고    scopus 로고
    • Optimal motion planning for multiple robots having independent goals
    • December
    • S. M. LaValle and S. A. Hutchinson. Optimal motion planning for multiple robots having independent goals. IEEE Trans. Robot. and Autom., 14(6):912-925, December 1998.
    • (1998) IEEE Trans. Robot. and Autom , vol.14 , Issue.6 , pp. 912-925
    • Lavalle, S.M.1    Hutchinson, S.A.2
  • 17
    • 0026974445 scopus 로고
    • Planning of vision and motion for a mobile robot using a probabilistic model of uncertainty
    • Osaka, Japan, May
    • J. Miura and Y. Shirai. Planning of vision and motion for a mobile robot using a probabilistic model of uncertainty. In IEEE/RSJ Int. Workshop on Intelligent Robots and Systems, pages 403-408, Osaka, Japan, May 1991.
    • (1991) IEEE/RSJ Int. Workshop On Intelligent Robots and Systems , pp. 403-408
    • Miura, J.1    Shirai, Y.2
  • 18
    • 0032058777 scopus 로고    scopus 로고
    • The geometry of cube complexes and the complexity of their fundamental groups
    • G. A. Niblo and L. D. Reeves. The geometry of cube complexes and the complexity of their fundamental groups. Topology, 37(3):621-633, 1998.
    • (1998) Topology , vol.37 , Issue.3 , pp. 621-633
    • Niblo, G.A.1    Reeves, L.D.2
  • 21
    • 84864688822 scopus 로고    scopus 로고
    • Coordinating multiple robots with kinodynamic constraints along specified paths
    • STAR 7, Springer-Verlag
    • J. Peng and S. Akella. Coordinating multiple robots with kinodynamic constraints along specified paths. In Algorithmic Foundations of Robotics V, STAR 7, Springer-Verlag, 221-237, 2004.
    • (2004) Algorithmic Foundations of Robotics V , pp. 221-237
    • Peng, J.1    Akella, S.2
  • 23
    • 0020809396 scopus 로고
    • On the piano movers' problem: III. Coordinating the motion of several independent bodies
    • J. T. Schwartz and M. Sharir. On the piano movers' problem: III. Coordinating the motion of several independent bodies. Int. J. Robot. Res., 2(3):97-140, 1983.
    • (1983) Int. J. Robot. Res , vol.2 , Issue.3 , pp. 97-140
    • Schwartz, J.T.1    Sharir, M.2
  • 24
    • 0036476864 scopus 로고    scopus 로고
    • Path coordination for multiple mobile robots: A resolution complete algorithm
    • February
    • T. Simeon, S. Leroy, and J.-P. Laumond. Path coordination for multiple mobile robots: a resolution complete algorithm. IEEE Trans. Robot. & Autom., 18(1), February 2002.
    • (2002) IEEE Trans. Robot. & Autom , vol.18 , Issue.1
    • Simeon, T.1    Leroy, S.2    Laumond, J.-P.3
  • 25
    • 0024032173 scopus 로고
    • A variational dynamic programming approach to robot-path planning with a distance-safety criterion
    • June
    • S.-H. Suh and K. G. Shin. A variational dynamic programming approach to robot-path planning with a distance-safety criterion. IEEE Trans. Robot. & Autom., 4(3):334-349, June 1988.
    • (1988) IEEE Trans. Robot. & Autom , vol.4 , Issue.3 , pp. 334-349
    • Suh, S.-H.1    Shin, K.G.2
  • 26
    • 0029184080 scopus 로고
    • Coordinated motion planning for multiple carlike robots using probabilistic roadmaps
    • P. Svestka and M. H. Overmars. Coordinated motion planning for multiple carlike robots using probabilistic roadmaps. In Proc. IEEE Int. Conf. Robot. & Autom., pages 1631-1636, 1995.
    • (1995) Proc. IEEE Int. Conf. Robot. & Autom , pp. 1631-1636
    • Svestka, P.1    Overmars, M.H.2


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