메뉴 건너뛰기




Volumn 4, Issue , 1998, Pages 3671-3677

An incremental version of growth distance

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTICS; ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; MOTION PLANNING;

EID: 0031640432     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.1998.681397     Document Type: Conference Paper
Times cited : (8)

References (10)
  • 1
    • 0024673745 scopus 로고
    • A direct minimization approach for obtaining the distance between convex polyhedra
    • J. E. Bobrow, "A direct minimization approach for obtaining the distance between convex polyhedra, " Int. Journal of Robotics Research, vol. 8, pp. 65-76, 1989.
    • (1989) Int Journal of Robotics Research , vol.8 , pp. 65-76
    • Bobrow, J.E.1
  • 3
    • 60749130749 scopus 로고
    • Determining the separation of preprocessed polyhedra-a unified approach
    • Springer-Verlag
    • D. P. Dobkin and D. G. Kirkpatrick, "Determining the separation of preprocessed polyhedra-a unified approach, " Proc. of 17th ICALP, Lecture Notes on Computer Science, No. 443, pp. 400-412, Springer-Verlag, 1990
    • (1990) Proc. of 17th ICALP, Lecture Notes on Computer Science , Issue.443 , pp. 400-412
    • Dobkin, D.P.1    Kirkpatrick, D.G.2
  • 4
    • 0023211251 scopus 로고
    • A local based approach for path planning of manipulators with a high number of degrees of freedom
    • B. Faverjon and P. Tournassoud, "A local based approach for path planning of manipulators with a high number of degrees of freedom, " Proc. of IEEE Int. Conf. on Robotics and Automation pp. 1152-1159, ' 1987.
    • (1987) Proc. of IEEE Int. Conf. on Robotics and Automation , pp. 1152-1159
    • Faverjon, B.1    Tournassoud, P.2
  • 5
    • 0001954038 scopus 로고
    • Distance functions and their applications to robot path planning in the presence of obstacles
    • E. G. Gilbert, D.W. Johnson, "Distance functions and their applications to robot path planning in the presence of obstacles, " IEEE Journal of Robotics and Automation, vol. RA-1, pp. 21-30, 1985.
    • (1985) IEEE Journal of Robotics and Automation , vol.RA-1 , pp. 21-30
    • Gilbert, E.G.1    Johnson, D.W.2
  • 6
    • 0023998710 scopus 로고
    • A fast procedure for computing the distance between complex objects in three-dimensional space
    • E. G. Gilbert, D.W. Johnson and S. S. Keerthi. "A fast procedure for computing the distance between complex objects in three-dimensional space, " IEEE Journal of Robotics and Automation, vol. 4, No.2, pp. 193-203, 1988.
    • (1988) IEEE Journal of Robotics and Automation , vol.4 , Issue.2 , pp. 193-203
    • Gilbert, E.G.1    Johnson, D.W.2    Keerthi, S.S.3
  • 8
    • 0030413923 scopus 로고    scopus 로고
    • Growth Distances: New Measures for Object Separation and Penetration
    • C.J. Ong and E.G. Gilbert, "Growth Distances: New Measures for Object Separation and Penetration", IEEE Transactions on Robotics and Automation, vol. 12, no.6. 1996.
    • (1996) IEEE Transactions on Robotics and Automation , vol.12 , Issue.6
    • Ong, C.J.1    Gilbert, E.G.2
  • 9
    • 0030718654 scopus 로고    scopus 로고
    • The Gilbert-Johnson-Keerthi Distance Algorithm: A fast version for incremental motions
    • C. J. Ong and E. G. Gilbert, "The Gilbert-Johnson-Keerthi Distance Algorithm: A Fast Version for Incremental Motions, " Proc. of IEEE Int. Conf. on Robotics and Automation pp. 1183-1189, 1997.
    • (1997) Proc. of IEEE Int. Conf. on Robotics and Automation , pp. 1183-1189
    • Ong, C.J.1    Gilbert, E.G.2


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