메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 3344-3349

Policies based on trajectory libraries

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC MODEL DISCONTINUITIES; GLOBAL CONTROL LAW; TRAJECTORY LIBRARIES;

EID: 33845628656     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2006.1642212     Document Type: Conference Paper
Times cited : (64)

References (14)
  • 1
    • 0035327156 scopus 로고    scopus 로고
    • Randomized kinodynamic planning
    • [Online]
    • S. M. LaValle and J. J. Kuffner, Jr, "Randomized Kinodynamic Planning," The International Journal of Robotics Research, vol. 20, no. 5, pp. 378-400, 2001. [Online]. Available: http://ijr.sagepub.com/cgi/content/ abstract/20/5/378
    • (2001) The International Journal of Robotics Research , vol.20 , Issue.5 , pp. 378-400
    • LaValle, S.M.1    Kuffner Jr., J.J.2
  • 2
    • 84860038482 scopus 로고    scopus 로고
    • Internet/WWW. [Online]
    • O. von Stryk, "DIRCOL," Internet/WWW, 2001. [Online]. Available: http://www.sim.informatik.tu-darmstadt.de/sw/dircol.html.en
    • (2001) DIRCOL
    • Von Stryk, O.1
  • 3
    • 0028447220 scopus 로고
    • Deliberation scheduling for problem solving in time-constrained environments
    • M. S. Boddy and T. Dean, "Deliberation scheduling for problem solving in time-constrained environments." Artificial Intelligence, vol. 67, no. 2, pp. 245-285, 1994.
    • (1994) Artificial Intelligence , vol.67 , Issue.2 , pp. 245-285
    • Boddy, M.S.1    Dean, T.2
  • 6
    • 0030212126 scopus 로고    scopus 로고
    • Probabilistic roadmaps for path planning in high-dimensional configuration spaces
    • [Online]
    • L. Kavraki, P. Svestka, J. Latombe, and M. Overmars., "Probabilistic roadmaps for path planning in high-dimensional configuration spaces." IEEE Transactions on Robotics and Automation, vol. 12, no. 4, pp. 566-580, 1996. [Online]. Available: http://ai.stanford.edu/~latombe/pub.htm
    • (1996) IEEE Transactions on Robotics and Automation , vol.12 , Issue.4 , pp. 566-580
    • Kavraki, L.1    Svestka, P.2    Latombe, J.3    Overmars, M.4
  • 8
    • 0039816976 scopus 로고
    • Using local trajectory optimizers to speed up global optimization in dynamic programming
    • J. D. Cowan, G. Tesauro, and J. Alspector, Eds., Morgan Kaufmann Publishers, Inc., [Online]
    • C. G. Atkeson, "Using local trajectory optimizers to speed up global optimization in dynamic programming," in Advances in Neural Information Processing Systems, J. D. Cowan, G. Tesauro, and J. Alspector, Eds., vol. 6. Morgan Kaufmann Publishers, Inc., 1994, pp. 663-670. [Online]. Available: ftp://ftp.cc.gatech.edu/pub/people/cga/local.html
    • (1994) Advances in Neural Information Processing Systems , vol.6 , pp. 663-670
    • Atkeson, C.G.1
  • 9
    • 84898983672 scopus 로고    scopus 로고
    • Nonparametric representation of policies and value functions: A trajectory-based approach
    • S. Becker, S. Thrun, and K. Obermayer, Eds., Cambridge, MA: MIT Press, [Online]
    • C. G. Atkeson and J. Morimoto, "Nonparametric representation of policies and value functions: A trajectory-based approach," in Advances in Neural Information Processing Systems, S. Becker, S. Thrun, and K. Obermayer, Eds., vol. 15. Cambridge, MA: MIT Press, 2003, pp. 1611-1618. [Online]. Available: http://www-2.cs.cmu.edu/~cga/publications.html
    • (2003) Advances in Neural Information Processing Systems , vol.15 , pp. 1611-1618
    • Atkeson, C.G.1    Morimoto, J.2
  • 10
    • 33845608830 scopus 로고    scopus 로고
    • Ph.D. dissertation, Georgia Institute of Technology, [Online]
    • D. C. Bentivegna, "Learning from observation using primitives," Ph.D. dissertation, Georgia Institute of Technology, 2004. [Online]. Available: http://etd.gatech.edu/theses/available/etd-06202004-213721/
    • (2004) Learning from Observation Using Primitives
    • Bentivegna, D.C.1
  • 12
    • 77952010176 scopus 로고    scopus 로고
    • Cambridge University Press, to appear. [Online]
    • S. M. LaValle, Planning Algorithms. Cambridge University Press, 2006, to appear. [Online]. Available: http://msl.cs.uiuc.edu/planning/
    • (2006) Planning Algorithms
    • LaValle, S.M.1
  • 13
    • 84945709355 scopus 로고
    • An algorithm for finding best matches in logarithmic expected time
    • September [Online]
    • J. H. Friedman, J. L. Bentley, and R. A. Finkel, "An algorithm for finding best matches in logarithmic expected time," ACM Transactions on Mathematical Software, vol. 3, no. 3, pp. 209-226, September 1977. [Online]. Available: http://portal.acm.org/citation.cfm?doid=355744.355745
    • (1977) ACM Transactions on Mathematical Software , vol.3 , Issue.3 , pp. 209-226
    • Friedman, J.H.1    Bentley, J.L.2    Finkel, R.A.3


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