메뉴 건너뛰기




Volumn 3, Issue , 2008, Pages 233-240

The stochastic motion roadmap: A sampling framework for planning with Markov motion uncertainty

Author keywords

[No Author keywords available]

Indexed keywords

AGRICULTURAL ROBOTS; COLLISION AVOIDANCE; DYNAMIC PROGRAMMING; MANEUVERABILITY; MARKOV PROCESSES; MEDICAL ROBOTICS; MOTION PLANNING; NEEDLES; POLYNOMIAL APPROXIMATION; ROBOTICS; ROBOTS; SAMPLING; STOCHASTIC SYSTEMS; TISSUE;

EID: 84959308948     PISSN: None     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: 10.15607/rss.2007.iii.030     Document Type: Conference Paper
Times cited : (58)

References (37)
  • 3
    • 0002726880 scopus 로고    scopus 로고
    • OBPRM: An obstacle-based PRM for 3D workspaces
    • P. Agarwal L. E. Kavraki, and M. Mason, Eds. Natick, MA: AK Peters, Ltd.
    • N. M. Amato, O. B. Bayazit, L. K. Dale, C. Jones, and D. Vallejo, "OBPRM: An obstacle-based PRM for 3D workspaces, " in Robotics: The Algorithmic Perspective, P. Agarwal, L. E. Kavraki, and M. Mason, Eds. Natick, MA: AK Peters, Ltd., 1998, pp. 156-168.
    • (1998) Robotics: The Algorithmic Perspective , pp. 156-168
    • Amato, N.M.1    Bayazit, O.B.2    Dale, L.K.3    Jones, C.4    Vallejo, D.5
  • 4
    • 0036374348 scopus 로고    scopus 로고
    • Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion
    • M. S. Apaydin, D. L. Brutlag, C. Guestrin, D. Hsu, and J.-C. Latombe, "Stochastic roadmap simulation: an efficient representation and algorithm for analyzing molecular motion, " in Proc. RECOMB, 2002, pp. 12-21.
    • (2002) Proc. RECOMB , pp. 12-21
    • Apaydin, M.S.1    Brutlag, D.L.2    Guestrin, C.3    Hsu, D.4    Latombe, J.-C.5
  • 5
    • 84864709887 scopus 로고    scopus 로고
    • Stochastic conformational roadmaps for computing ensemble properties of molecular motion
    • Berlin, Germany: Springer-Verlag
    • M. Apaydin, D. Brutlag, C. Guestrin, D. Hsu, and J.-C. Latombe, "Stochastic conformational roadmaps for computing ensemble properties of molecular motion, " in Algorithmic Foundations of Robotics V. Berlin, Germany: Springer-Verlag, 2003, pp. 131-148.
    • (2003) Algorithmic Foundations of Robotics v , pp. 131-148
    • Apaydin, M.1    Brutlag, D.2    Guestrin, C.3    Hsu, D.4    Latombe, J.-C.5
  • 8
    • 0030218316 scopus 로고    scopus 로고
    • Planning shortest boundedcurvature paths for a class of nonholonomic vehicles among obstacles
    • A. Bicchi, G. Casalino, and C. Santilli, "Planning shortest boundedcurvature paths for a class of nonholonomic vehicles among obstacles, " Journal of Intelligent and Robotic Systems, vol. 16, pp. 387-405, 1996.
    • (1996) Journal of Intelligent and Robotic Systems , vol.16 , pp. 387-405
    • Bicchi, A.1    Casalino, G.2    Santilli, C.3
  • 10
    • 0029206820 scopus 로고
    • A numerical technique for planning motion strategies of a mobile robot in presence of uncertainty
    • Nagoya, Japan, May
    • B. Bouilly, T. Siméon, and R. Alami, "A numerical technique for planning motion strategies of a mobile robot in presence of uncertainty, " in Proc. IEEE Int. Conf. on Robotics and Automation (ICRA), Nagoya, Japan, May 1995.
    • (1995) Proc IEEE Int. Conf. on Robotics and Automation (ICRA)
    • Bouilly, B.1    Siméon, T.2    Alami, R.3
  • 11
    • 84959555568 scopus 로고    scopus 로고
    • Toward optimal configuration space sampling
    • Cambridge, MA, June
    • B. Burns and O. Brock, "Toward optimal configuration space sampling, " in Proc. Robotics: Science and Systems, Cambridge, MA, June 2005.
    • (2005) Proc. Robotics: Science and Systems
    • Burns, B.1    Brock, O.2
  • 14
    • 0029332887 scopus 로고
    • Planning under time constraints in stochastic domains
    • July
    • T. Dean, L. P. Kaelbling, J. Kirman, and A. Nicholson, "Planning under time constraints in stochastic domains, " Artificial Intelligence, vol. 76, no. 1-2, pp. 35-74, July 1995.
    • (1995) Artificial Intelligence , vol.76 , Issue.1-2 , pp. 35-74
    • Dean, T.1    Kaelbling, L.P.2    Kirman, J.3    Nicholson, A.4
  • 20
    • 0030212126 scopus 로고    scopus 로고
    • Probabilistic roadmaps for path planning in high dimensional configuration spaces
    • L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high dimensional configuration spaces, " IEEE Trans. on Robotics and Automation, vol. 12, no. 4, pp. 566-580, 1996.
    • (1996) IEEE Trans. on Robotics and Automation , vol.12 , Issue.4 , pp. 566-580
    • Kavraki, L.E.1    Svestka, P.2    Latombe, J.-C.3    Overmars, M.4
  • 22
    • 77952010176 scopus 로고    scopus 로고
    • Cambridge, U.K.: Cambridge University Press
    • S. M. LaValle, Planning Algorithms. Cambridge, U.K.: Cambridge University Press, 2006.
    • (2006) Planning Algorithms
    • LaValle, S.M.1
  • 23
    • 3142761493 scopus 로고    scopus 로고
    • On the relationship between classical grid search and probabilistic roadmaps
    • July
    • S. M. LaValle, M. S. Branicky, and S. R. Lindemann, "On the relationship between classical grid search and probabilistic roadmaps, " Int. J. of Robotics Research, vol. 23, no. 7/8, pp. 673-692, July 2004.
    • (2004) Int. J. of Robotics Research , vol.23 , Issue.7-8 , pp. 673-692
    • LaValle, S.M.1    Branicky, M.S.2    Lindemann, S.R.3
  • 25
    • 0031703630 scopus 로고    scopus 로고
    • An objective-based framework for motion planning under sensing and control uncertainties
    • Jan.
    • S. M. LaValle and S. A. Hutchinson, "An objective-based framework for motion planning under sensing and control uncertainties, " Int. J. of Robotics Research, vol. 17, no. 1, pp. 19-42, Jan. 1998.
    • (1998) Int. J. of Robotics Research , vol.17 , Issue.1 , pp. 19-42
    • LaValle, S.M.1    Hutchinson, S.A.2
  • 26
    • 0029332309 scopus 로고
    • Motion planning with uncertainty: A landmark approach
    • A. Lazanas and J. Latombe, "Motion planning with uncertainty: A landmark approach, " Artificial Intelligence, vol. 76, no. 1-2, pp. 285-317, 1995.
    • (1995) Artificial Intelligence , vol.76 , Issue.1-2 , pp. 285-317
    • Lazanas, A.1    Latombe, J.2
  • 29
    • 0029514510 scopus 로고
    • The parti-game algorithm for variable resolution reinforcement learning in multidimensional state spaces
    • A. W. Moore and C. G. Atkeson, "The parti-game algorithm for variable resolution reinforcement learning in multidimensional state spaces, " Machine Learning, vol. 21, no. 3, pp. 199-233, 1995.
    • (1995) Machine Learning , vol.21 , Issue.3 , pp. 199-233
    • Moore, A.W.1    Atkeson, C.G.2
  • 31
    • 0002692643 scopus 로고    scopus 로고
    • Approximation and decision algorithms for curvatureconstrained path planning: A state-space approach
    • P. K. Agarwal L. E. Kavraki, and M. T. Mason, Eds. Natick, MA: AK Peters, Ltd.
    • J. Sellen, "Approximation and decision algorithms for curvatureconstrained path planning: A state-space approach, " in Robotics: The Algorithmic Perspective, P. K. Agarwal, L. E. Kavraki, and M. T. Mason, Eds. Natick, MA: AK Peters, Ltd., 1998, pp. 59-67.
    • (1998) Robotics: The Algorithmic Perspective , pp. 59-67
    • Sellen, J.1
  • 32
    • 84978501689 scopus 로고    scopus 로고
    • DD spatial searching
    • CGAL Editorial Board, Ed.
    • H. Tangelder and A. Fabri, "dD spatial searching, " in CGAL-3.2 User and Reference Manual, CGAL Editorial Board, Ed., 2006. [Online]. Available: http://www.cgal.org/Manual/
    • (2006) CGAL-3.2 User and Reference Manual
    • Tangelder, H.1    Fabri, A.2


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