메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1513-1518

Accurate evaluation of a distance function for optimization-based motion planning

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL SPEED; DISTANCE FUNCTIONS; EUCLIDEAN DISTANCE; EVALUATION METHODS; GLOBAL MINIMA; GOLDEN SECTION SEARCH; HUMANOID ROBOT; HYBRID METHOD; NEGATIVE VALUES; NOVEL METHODS; ROBOTIC MOTION PLANNING; SEMI INFINITE PROGRAMMING;

EID: 84872330237     PISSN: 21530858     EISSN: 21530866     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2012.6385741     Document Type: Conference Paper
Times cited : (6)

References (26)
  • 9
    • 77952837979 scopus 로고    scopus 로고
    • Gproximity: Hierarchical gpu-based operations for collision and distance queries
    • C. Lauterbach, Q. Mo, and D. Manocha, "gproximity: Hierarchical gpu-based operations for collision and distance queries," Computer Graphics Forum, vol. 29, no. 2, pp. 419-428, 2010.
    • (2010) Computer Graphics Forum , vol.29 , Issue.2 , pp. 419-428
    • Lauterbach, C.1    Mo, Q.2    Manocha, D.3
  • 11
    • 0023998710 scopus 로고
    • A fast procedure for computing the distance between objects in three-dimensional space
    • E. G. Gilbert, D. W. Johnson, and S. S. Keerthi, "A fast procedure for computing the distance between objects in three-dimensional space," IEEE J. Robotics and Automation, vol. vol RA-4, pp. 193-203, 1988.
    • (1988) IEEE J. Robotics and Automation , vol.RA-4 , pp. 193-203
    • Gilbert, E.G.1    Johnson, D.W.2    Keerthi, S.S.3
  • 15
    • 0036058375 scopus 로고    scopus 로고
    • DEEP: An incremental algorithm for penetration depth computation between convex polytopes
    • Y. J. Kim, M. C. Lin, and D. Manocha, "DEEP: an incremental algorithm for penetration depth computation between convex polytopes," Proc. of IEEE Conference on Robotics and Automation, pp. 921-926, 2002.
    • (2002) Proc. of IEEE Conference on Robotics and Automation , pp. 921-926
    • Kim, Y.J.1    Lin, M.C.2    Manocha, D.3
  • 16
    • 0003277213 scopus 로고    scopus 로고
    • Proximity queries and penetration depth computation on 3d game objects
    • G. van den Bergen, "Proximity queries and penetration depth computation on 3d game objects," in Game Developers Conference, 2001.
    • (2001) Game Developers Conference
    • Van Den Bergen, G.1
  • 18
    • 84863289955 scopus 로고    scopus 로고
    • PolyDepth: Real-time penetration depth computation using iterative contact-space projection
    • Jan
    • C. Je, M. Tang, Y. Lee, M. Lee, and Y. Kim, "PolyDepth: Real-time penetration depth computation using iterative contact-space projection," ACM Transactions on Graphics, vol. 31, no. 1, Jan 2012.
    • (2012) ACM Transactions on Graphics , vol.31 , Issue.1
    • Je, C.1    Tang, M.2    Lee, Y.3    Lee, M.4    Kim, Y.5
  • 20
    • 34547789369 scopus 로고    scopus 로고
    • Continuous collision detection for articulated models using Taylor models and temporal culling
    • July
    • X. Zhang, S. Redon, M. Lee, and Y. J. Kim, "Continuous collision detection for articulated models using Taylor models and temporal culling," ACM Transactions on Graphics, SIGGRAPH, vol. 26, no. 3, p. 15, July 2007.
    • (2007) ACM Transactions on Graphics, SIGGRAPH , vol.26 , Issue.3 , pp. 15
    • Zhang, X.1    Redon, S.2    Lee, M.3    Kim, Y.J.4
  • 21
    • 24144447015 scopus 로고    scopus 로고
    • Newtontype algorithms for dynamics-based robot movement optimization
    • S.-H. Lee, J. Kim, F. C. Park, M. Kim, and J. E. Bobrow, "Newtontype algorithms for dynamics-based robot movement optimization," IEEE Transactions on Robotics, vol. 21, pp. 657-667, 2005. [Online]. Available: http://ieeexplore.ieee.org/iel5/8860/32079/01492481.pdf
    • (2005) IEEE Transactions on Robotics , vol.21 , pp. 657-667
    • Lee, S.-H.1    Kim, J.2    Park, F.C.3    Kim, M.4    Bobrow, J.E.5
  • 26
    • 78650137331 scopus 로고    scopus 로고
    • CCQ: Efficient local planning using connection collision query
    • ser. Springer Tracts in Advanced Robotics, D. Hsu, V. Isler, J.-C. Latombe, and M. Lin, Eds. Algorithmic Foundations of Robotics IX
    • M. Tang, Y. Kim, and D. Manocha, "CCQ: Efficient local planning using connection collision query," in Algorithmic Foundations of Robotics IX, ser. Springer Tracts in Advanced Robotics, D. Hsu, V. Isler, J.-C. Latombe, and M. Lin, Eds. Algorithmic Foundations of Robotics IX, 2011, vol. 68, pp. 229-247.
    • (2011) Algorithmic Foundations of Robotics IX , vol.68 , pp. 229-247
    • Tang, M.1    Kim, Y.2    Manocha, D.3


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