메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1426-1432

Collision-probability constrained PRM for a manipulator with base pose uncertainty

Author keywords

[No Author keywords available]

Indexed keywords

3-DOF MANIPULATORS; COLLISION PROBABILITY; CONSTRAINED SHORTEST PATH; EFFICIENCY GAIN; K-SHORTEST PATH ALGORITHMS; LABELING ALGORITHMS; MANIPULATOR SYSTEMS; MOBILE BASE; MOTION PLANNING PROBLEMS; NP-HARD; PATH QUERIES; PROBABILISTIC ROADMAP; QUERY ALGORITHMS; SHORTEST PATH; SOLUTION PATH; WORST-CASE COMPLEXITY;

EID: 76249124787     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2009.5354168     Document Type: Conference Paper
Times cited : (21)

References (26)
  • 3
    • 36749037957 scopus 로고    scopus 로고
    • Elastic Roadmaps: Globally Task-Consistent Motion for Autonomous Mobile Manipulation in Dynamic Environments
    • Y. Yang and O. Brock. Elastic Roadmaps: Globally Task-Consistent Motion for Autonomous Mobile Manipulation in Dynamic Environments. Robotics Science and Systems 2006 (RSS2006), 21:34.
    • Robotics Science and Systems 2006 (RSS2006) , vol.21 , pp. 34
    • Yang, Y.1    Brock, O.2
  • 9
    • 0032073263 scopus 로고    scopus 로고
    • Planning and acting in partially observable stochastic domains
    • L.P. Kaelbling, M.L. Littman, and A.R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2):99-134, 1998.
    • (1998) Artificial Intelligence , vol.101 , Issue.1-2 , pp. 99-134
    • Kaelbling, L.P.1    Littman, M.L.2    Cassandra, A.R.3
  • 19
    • 76249123773 scopus 로고    scopus 로고
    • L.J. Guibas, D. Hsu, H. Kurniawati, and E. Rehman. Bounded uncertainty roadmaps for path planning
    • L.J. Guibas, D. Hsu, H. Kurniawati, and E. Rehman. Bounded uncertainty roadmaps for path planning.
  • 22
    • 0012574470 scopus 로고    scopus 로고
    • I. Dumitresce and N. Boland. Algorithms for the weight constrained shortest path problem. Intl. Trans. in Op. Res., 8:15-29, 2001.
    • I. Dumitresce and N. Boland. Algorithms for the weight constrained shortest path problem. Intl. Trans. in Op. Res., 8:15-29, 2001.
  • 24
    • 36448972779 scopus 로고    scopus 로고
    • Finding the k shortest simple paths: A new algorithm and its implementation
    • J. Hershberger, M. Maxel, and S.Suri. Finding the k shortest simple paths: A new algorithm and its implementation. In ACM Transactions on Algorithmes, volume 3, 2007.
    • (2007) ACM Transactions on Algorithmes , vol.3
    • Hershberger, J.1    Maxel, M.2    Suri, S.3
  • 25
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652-673, 1999.
    • (1999) SIAM Journal on Computing , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1
  • 26
    • 84868179244 scopus 로고    scopus 로고
    • http://www.mobilerobots.com.


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