메뉴 건너뛰기




Volumn 3, Issue , 2008, Pages 313-320

Discrete search leading continuous exploration for kinodynamic motion planning

Author keywords

[No Author keywords available]

Indexed keywords


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

References (30)
  • 2
    • 77952010176 scopus 로고    scopus 로고
    • Cambridge, MA: Cambridge University Press
    • S. M. LaValle, Planning Algorithms. Cambridge, MA: Cambridge University Press, 2006.
    • (2006) Planning Algorithms
    • LaValle, S.M.1
  • 3
    • 23144461563 scopus 로고    scopus 로고
    • Real-time randomized path planning for robot navigation
    • G. A. Kaminka, P. U. Lima, and R. Rojas, Eds. Berlin, Heiderlberg: Springer
    • J. Bruce and M. Veloso, "Real-time randomized path planning for robot navigation, " in Robocup 2002: Robot Soccer World Cup VI, Lecture Notes in Computer Science, G. A. Kaminka, P. U. Lima, and R. Rojas, Eds. Berlin, Heiderlberg: Springer, 2003, vol. 2752, pp. 288-295.
    • (2003) Robocup 2002: Robot Soccer World Cup VI, Lecture Notes in Computer Science , vol.2752 , pp. 288-295
    • Bruce, J.1    Veloso, M.2
  • 5
    • 33747610281 scopus 로고    scopus 로고
    • Motion planning in the presence of drift, underactuation and discrete system changes
    • Boston, MA: MIT Press
    • A. M. Ladd and L. E. Kavraki, "Motion planning in the presence of drift, underactuation and discrete system changes, " in Robotics: Science and Systems I. Boston, MA: MIT Press, 2005, pp. 233-241.
    • (2005) Robotics: Science and Systems i , pp. 233-241
    • Ladd, A.M.1    Kavraki, L.E.2
  • 9
    • 0036458038 scopus 로고    scopus 로고
    • On delaying collision checking in PRM planning: Application to multi-robot coordination
    • G. Sánchez and J.-C. Latombe, "On delaying collision checking in PRM planning: Application to multi-robot coordination, " International Journal of Robotics Research, vol. 21, no. 1, pp. 5-26, 2002.
    • (2002) International Journal of Robotics Research , vol.21 , Issue.1 , pp. 5-26
    • Sánchez, G.1    Latombe, J.-C.2
  • 12
    • 84959555568 scopus 로고    scopus 로고
    • Toward optimal configuration space sampling
    • Cambridge, MA, June
    • B. Burns and O. Brock, "Toward optimal configuration space sampling, " in Robotics: Science and Systems, Cambridge, MA, June 2005.
    • (2005) Robotics: Science and Systems
    • Burns, B.1    Brock, O.2
  • 13
    • 84880152114 scopus 로고    scopus 로고
    • A machine learning approach for feature-sensitive motion planning
    • M. Erdmann, D. Hsu, M. Overmars, and A. F. van der Stappen, Eds. Utrecht/Zeist, Netherlands: Springer-Verlag, July
    • M. Morales, L. Tapia, R. Pearce, S. Rodriguez, and N. M. Amato, "A machine learning approach for feature-sensitive motion planning, " in International Workshop on Algorithmic Foundations of Robotics, M. Erdmann, D. Hsu, M. Overmars, and A. F. van der Stappen, Eds. Utrecht/Zeist, Netherlands: Springer-Verlag, July 2004, pp. 361-376.
    • (2004) International Workshop on Algorithmic Foundations of Robotics , pp. 361-376
    • Morales, M.1    Tapia, L.2    Pearce, R.3    Rodriguez, S.4    Amato, N.M.5
  • 14
  • 16
    • 0026170082 scopus 로고
    • Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration
    • K. Kondo, "Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration, " IEEE Transactions on Robotics and Automation, vol. 7, no. 3, pp. 267-277, 1991.
    • (1991) IEEE Transactions on Robotics and Automation , vol.7 , Issue.3 , pp. 267-277
    • Kondo, K.1
  • 21
    • 84959454477 scopus 로고    scopus 로고
    • Efficient motion planning based on disassembly
    • S. Thrun, G. S. Sukhatme, and S. Schaal, Eds. Cambridge, USA: MIT Press, June
    • Y. Yang and O. Brock, "Efficient motion planning based on disassembly, " in Robotics: Science and Systems, S. Thrun, G. S. Sukhatme, and S. Schaal, Eds. Cambridge, USA: MIT Press, June 2005.
    • (2005) Robotics: Science and Systems
    • Yang, Y.1    Brock, O.2
  • 22
    • 77953219023 scopus 로고    scopus 로고
    • Workspace-based connectivity oracle: An adaptive sampling strategy for PRM planning
    • S. Akella et al., Eds. New York, NY: Springer-Verlag, in press
    • H. Kurniawati and D. Hsu, "Workspace-based connectivity oracle: An adaptive sampling strategy for PRM planning, " in International Workshop on Algorithmic Foundations of Robotics, S. Akella et al., Eds. New York, NY: Springer-Verlag, 2006, in press.
    • (2006) International Workshop on Algorithmic Foundations of Robotics
    • Kurniawati, H.1    Hsu, D.2
  • 24
    • 0346242006 scopus 로고    scopus 로고
    • A comparitive study of probabilistic roadmap planners
    • J.-D. Boissonnat, J. Burdick, K. Goldberg, and S. Hutchinson, Eds. Springer-Verlag
    • R. Geraerts and M. Overmars, "A comparitive study of probabilistic roadmap planners, " in International Workshop on Algorithmic Foundations of Robotics, J.-D. Boissonnat, J. Burdick, K. Goldberg, and S. Hutchinson, Eds. Springer-Verlag, 2002, pp. 43-58.
    • (2002) International Workshop on Algorithmic Foundations of Robotics , pp. 43-58
    • Geraerts, R.1    Overmars, M.2
  • 26
    • 3042632353 scopus 로고    scopus 로고
    • Improving the performance of sampling-based planners by using a symmetry-exploiting gap reduction algorithm
    • P. Cheng, E. Frazzoli, and S. M. LaValle, "Improving the performance of sampling-based planners by using a symmetry-exploiting gap reduction algorithm, " in IEEE Interantional Conference on Robotics and Automation, 2004, pp. 4362-4368.
    • (2004) IEEE Interantional Conference on Robotics and Automation , pp. 4362-4368
    • Cheng, P.1    Frazzoli, E.2    LaValle, S.M.3
  • 27
    • 1942436679 scopus 로고    scopus 로고
    • Measure theoretic analysis of probabilistic path planning
    • A. M. Ladd and L. E. Kavraki, "Measure theoretic analysis of probabilistic path planning, " IEEE Transactions on Robotics and Automation, vol. 20, no. 2, pp. 229-242, 2004.
    • (2004) IEEE Transactions on Robotics and Automation , vol.20 , Issue.2 , pp. 229-242
    • Ladd, A.M.1    Kavraki, L.E.2
  • 28
    • 38149073173 scopus 로고    scopus 로고
    • Hybrid systems: From verification to falsification
    • W. Damm and H. Hermanns, Eds. Berlin, Germany: Lecture Notes in Computer Science, Springer-Verlag
    • E. Plaku, L. E. Kavraki, and M. Y. Vardi, "Hybrid systems: From verification to falsification, " in International Conference on Computer Aided Verification, W. Damm and H. Hermanns, Eds. Berlin, Germany: Lecture Notes in Computer Science, Springer-Verlag, 2007, vol. 4590, pp. 468-481.
    • (2007) International Conference on Computer Aided Verification , vol.4590 , pp. 468-481
    • Plaku, E.1    Kavraki, L.E.2    Vardi, M.Y.3
  • 29
    • 33846167411 scopus 로고    scopus 로고
    • Distributed sampling-based roadmap of trees for large-scale motion planning
    • Barcelona, Spain
    • E. Plaku and L. E. Kavraki, "Distributed sampling-based roadmap of trees for large-scale motion planning, " in IEEE Inter. Conf. on Robotics and Automation, Barcelona, Spain, 2005, pp. 3879-3884.
    • (2005) IEEE Inter. Conf. on Robotics and Automation , pp. 3879-3884
    • Plaku, E.1    Kavraki, L.E.2
  • 30
    • 33846464687 scopus 로고    scopus 로고
    • Distributed computation of the knn graph for large highdimensional point sets
    • -, "Distributed computation of the knn graph for large highdimensional point sets, " Journal of Parallel and Distributed Computing, vol. 67, no. 3, pp. 346-359, 2007.
    • (2007) Journal of Parallel and Distributed Computing , vol.67 , Issue.3 , pp. 346-359
    • Plaku, E.1    Kavraki, L.E.2


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