Smooth local-path planning for autonomous vehicles
International Journal of Robotics Research
Stanley: The robot that won the DARPA Grand Challenge: Research Articles
Journal of Robotic Systems - Special Issue on the DARPA Grand Challenge, Part 2
Planning Algorithms
Optimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots
International Journal of Robotics Research
Flying Fast and Low Among Obstacles: Methodology and Experiments
International Journal of Robotics Research
Journal of Field Robotics - Special Issue on Field and Service Robotics
Autonomous driving in urban environments: Boss and the Urban Challenge
Journal of Field Robotics - Special Issue on the 2007 DARPA Urban Challenge, Part I
Driving with tentacles: Integral structures for sensing and motion
Journal of Field Robotics - Special Issue on the 2007 DARPA Urban Challenge, Part II
Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles
International Journal of Robotics Research
Complementarity-based dynamic simulation for kinodynamic motion planning
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
An analytical continuous-curvature path-smoothing algorithm
IEEE Transactions on Robotics
Sampling-based algorithms for optimal motion planning
International Journal of Robotics Research
From Reeds and Shepp's to continuous-curvature paths
IEEE Transactions on Robotics
Hi-index | 0.00 |
Planning in a cluttered environment under differential constraints is a difficult problem because the planner must satisfy the external constraints that arise from obstacles in the environment and the internal constraints due to the kinematic/dynamic limitations of the robot. This paper proposes a novel Spline-based Rapidly-exploring Random Tree (SRRT) algorithm which treats both the external and internal constraints simultaneously and efficiently. The computationally expensive numerical integration of the system dynamics is replaced by an efficient spline curve parameterization. In addition, the SRRT guarantees continuity of curvature along the path satisfying any upper-bounded curvature constraints. This paper presents the underlying theory to the SRRT algorithm and presents simulation and experiment results of a mobile robot efficiently navigating through cluttered environments.