Nonuniform discretization for kinodynamic motion planning and its applications

SIAM Journal on Computing

Volumn 30, Issue 1, 2000, Pages 161-190

  Reif, J H ^a   Wang, H ^a  

^a Duke University   (United States)

Author keywords

Kinodynamic motion planning; Nonholonomic motion planning; Nonuniform discretization; Robotic motion planning

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MOTION PLANNING; OPTIMIZATION; ROBOTICS; TRAJECTORIES;

KINODYNAMIC MOTION PLANNING; NONHOLONOMIC MOTION PLANNING; NONUNIFORM DISCRETIZATION; ROBOTIC MOTION PLANNING;

POLYNOMIAL APPROXIMATION;

EID: 0034456817     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798331975     Document Type: Article

References (49)

1. Motion planning for a steering-constrained robot through moderate obstacles
2. Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles
3. Accessibility region for a car that only moves forwards along optimal paths
4. Shortest paths of bounded curvature in the plane
5. A note on shortest paths in the plane subject to a constraint on the derivative of the curvature
6. Shortest path synthesis for Dubins non-holonomic robot
7. Some algebraic and geometric configuration in PSPACE
8. On the complexity of kinodynamic planning
9. An exact algorithm for kinodynamic planning in the plane
10. New lower bound techniques for robot motion planning problems
11. A provably good approximation algorithm for optimal-time trajectory planning
12. Near-optimal kinodynamic planning for robots with coupled dynamics bounds
13. Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators
14. Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds
15. Provably good approximation algorithms for optimal kinodynamic planning for cartesian robots and open chain manipulators
16. Kinodynamic motion planning
17. On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents
18. Planning constrained motion
19. Smooth trajectory planning for a car in a structured world
20. Time-optimal trajectories for a robot manipulator: A provably good approximation algorithm
21. Efficient computation of Euclidean shortest paths in the plane
22. Dynamic scaling of manipulator trajectories
23. Planning smooth paths for mobile robots
24. Efficient motion planners for nonholonomic mobile robots
25. Randomized preprocessing of configuration space for fast path planning
26. Randomized query processing in robot path planning
27. Suboptimal paths in the problem of a planar motion with bounded derivative of the curvature
28. The planar motion with bounded derivative of the curvature and its suboptimal paths
29. A fast path-planner for a car-like indoor mobile robot
30. Robot motion planning
31. Finding collision free smooth trajectories for a nonholonomic mobile robot
32. A motion planner for nonholonomic mobile robots
33. Motion planning for a two degrees of freedom mobile robot with towing
34. A motion planner for car-like robots based on a global/local approach
35. A Delaunay based numerical method for three dimensions: Generation, formulation, and partition
36. Automatic mesh partitioning
37. Using skeletons for nonholonomic path planning among obstacles
38. Query-sensitive ray shooting
39. Nonholonomic path planning and automation
40. Motion planning with inertial constraints
41. Optimal paths for a car that goes both forwards and backwards
42. Complexity of the generalized movers problem
43. 2-norm dynamic bounds
44. Planning of minimum-time trajectories for robot arms
45. Algorithmic motion planning in robotics
46. Approximation algorithms for curvature-constrained shortest paths
47. Motion planning for an autonomous vehicle
48. Shortest paths for autonomous vehicles