[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Skip header Section
Nonholonomic Motion PlanningOctober 1992
Publisher:
  • Kluwer Academic Publishers
  • 101 Philip Drive Assinippi Park Norwell, MA
  • United States
ISBN:978-0-7923-9275-0
Published:01 October 1992
Pages:
448
Skip Bibliometrics Section
Reflects downloads up to 05 Jan 2025Bibliometrics
Abstract

No abstract available.

Cited By

  1. Munive I (2017). Sub-Riemannian Curvature of Carnot Groups with Rank-Two Distributions, Journal of Dynamical and Control Systems, 23:4, (779-814), Online publication date: 1-Oct-2017.
  2. Arkin E, Mitchell J and Polishchuk V (2010). Maximum thick paths in static and dynamic environments, Computational Geometry: Theory and Applications, 43:3, (279-294), Online publication date: 1-Apr-2010.
  3. Shi P and Zhao Y An efficient path planning algorithm for mobile robot using improved potential field Proceedings of the 2009 international conference on Robotics and biomimetics, (1704-1708)
  4. ACM
    Arkin E, Mitchell J and Polishchuk V Maximum thick paths in static and dynamic environments Proceedings of the twenty-fourth annual symposium on Computational geometry, (20-27)
  5. Skiadas P and Koussoulas N (2019). Motion Planning for Drift-Free Nonholonomic Systems under a Discrete Levels Control Constraint, Journal of Intelligent and Robotic Systems, 32:1, (55-74), Online publication date: 1-Sep-2001.
  6. Jiang K, Seneviratne L and Earles S (1999). A Shortest Path Based Path Planning Algorithm for Nonholonomic Mobile Robots, Journal of Intelligent and Robotic Systems, 24:4, (347-366), Online publication date: 1-Apr-1999.
  7. ACM
    Boissonnat J and Lazard S A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract) Proceedings of the twelfth annual symposium on Computational geometry, (242-251)
  8. Wang H and Agarwal P Approximation algorithms for curvature-constrained shortest paths Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (409-418)
Contributors
  • University of California, Berkeley
Please enable JavaScript to view thecomments powered by Disqus.

Recommendations