Nonuniform Discretization for Kinodynamic Motion Planning and its Applications
Abstract
The first main result of this paper is a novel nonuniform discretization approximation method for the kinodynamic motion-planning problem. The kinodynamic motion-planning problem is to compute a collision-free, time-optimal trajectory for a robot whose accelerations and velocities are bounded. Previous approximation methods are all based on a uniform discretization in the time space. On the contrary, our method employs a nonuniform discretization in the configuration space (thus also a nonuniform one in the time space). Compared to the previously best algorithm of Donald and Xavier, the running time of our algorithm reduces in terms of $1/\varepsilon$, roughly from $O((1/\varepsilon)^{6d-1})$ to $O((1/\varepsilon)^{4d-2})$, in computing a trajectory in a d-dimensional configuration space, such that the time length of the trajectory is within a factor of $(1+\varepsilon)$ of the optimal. More importantly, our algorithm is able to take advantage of the obstacle distribution and is expected to perform much better than the analytical result. This is because our nonuniform discretization has the property that it is coarser in regions that are farther from all obstacles. So for situations where the obstacles are sparse, or the obstacles are unevenly distributed, the size of the discretization is significantly smaller.
Our second main result is the first known polynomial-time approximation algorithm for the curvature-constrained shortest-path problem in three and higher dimensions. We achieved this by showing that the approximation techniques for the kinodynamic motion-planning problem are applicable to this problem.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
P. K. Agarwal, P. Raghavan, and H. Tamak, Motion planning for a steering‐constrained robot through moderate obstacles, Proc. Annual Symposium Theory Comput., 27 (1995), pp. 343–352.
2.
Jérôme Barraquand, Jean‐Claude Latombe, Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles, Algorithmica, 10 (1993), 121–155, Computational robotics: the geometric theory of manipulation, planning, and control
3.
J. D. Boissonnat and X. N. Bui, Accessibility Region for a Car that Only Moves Forwards along Optimal Paths, Technical report, INRIA, Sophia Antipolis, France, 1994.
4.
J. D. Boissonnat, A. Cerezo, and J. Leblond, Shortest paths of bounded curvature in the plane, in Proceedings of the IEEE International Conference on Robotics and Automation, Nice, France, 1992, pp. 2315–2320.
5.
J. D. Boissonnat, A. Cerezo, and J. Leblond, A Note on Shortest Paths in the Plane Subject to a Constraint on the Derivative of the Curvature, Technical report, INRIA, Sophia Antipolis, France, 1994.
6.
X. N. Bui, J. D. Boissonnat, P. Soueres, and J. P. Laumond, Shortest path synthesis for Dubins non‐holonomic robot, in Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, CA, 1994, pp. 2–7.
7.
J. Canny, Some algebraic and geometric configuration in PSPACE, Proc. Annual ACM Sympos. Theory Comput., 20 (1988), pp. 460–467.
8.
J. Canny, B. Donald, J. Reif, and P. Xavier, On the complexity of kinodynamic planning, Proc. Sympos. Found. Comput. Sci., 29 (1988), pp. 306–316.
9.
John Canny, Ashutosh Rege, John Reif, An exact algorithm for kinodynamic planning in the plane, Discrete Comput. Geom., 6 (1991), 461–484
10.
J. Canny and J. Reif, New lower bound techniques for robot motion planning problems, Proc. Sympos. Found. Comput. Sci., 28 (1987), pp. 49–60.
11.
B. Donald and P. Xavier, A provably good approximation algorithm for optimal‐time trajectory planning, in Proceedings of the IEEE International Conference on Robotics and Automation, Scottsdale, AZ, 1989, pp. 958–963.
12.
B. Donald and P. Xavier, Near‐optimal kinodynamic planning for robots with coupled dynamics bounds, in Proceedings of the IEEE International Symposium on Intelligent Controls, Albany, NY, 1989, pp. 354–359.
13.
B. Donald and P. Xavier, Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators, Proc. Sympos. Comput. Geom., 6 (1990), pp. 290–300.
14.
B. Donald, P. Xavier, Provably good approximation algorithms for optimal kinodynamic planning: robots with decoupled dynamics bounds, Algorithmica, 14 (1995), 443–479
15.
B. Donald, P. Xavier, Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open‐chain manipulators, Algorithmica, 14 (1995), 480–530
16.
Bruce Donald, Patrick Xavier, John Canny, John Reif, Kinodynamic motion planning, J. Assoc. Comput. Mach., 40 (1993), 1048–1066
17.
L. Dubins, On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents, Amer. J. Math., 79 (1957), 497–516
18.
Steven Fortune, Gordon Wilfong, Planning constrained motion, Ann. Math. Artificial Intelligence, 3 (1991), 21–82, Algorithmic motion planning in robotics
19.
T. Fraichard, Smooth trajectory planning for a car in a structured world, in Proceedings of the IEEE International Conference on Robotics and Automation, Sacramento, CA, 1991, pp. 2–7.
20.
G. Heinzinger, P. Jacobs, J. Canny, and B. Paden, Time‐optimal trajectories for a robot manipulator: a provably good approximation algorithm, in Proceedings of the IEEE International Conference on Robotics and Automation, Cincinnati, OH, 1990, pp. 150–155.
21.
J. Hershberger and S. Suri, Efficient computation of Euclidean shortest paths in the plane, in Proceedings of the 34th Symposium on Foundations of Computer Science, Palo Alto, CA, 1993, pp. 508–517.
22.
J. M. Hollerbach, Dynamic scaling of manipulator trajectories, in Proceedings Automatic Control Council, 1983, pp. 752–756.
23.
P. Jacobs and J. Canny, Planning smooth paths for mobile robots, in Nonholonomic Motion Planning, Kluwer Academic Publishers, Norwell, MA, 1992.
24.
P. Jacobs, J. P. Laumond, and M. Taix, Efficient motion planners for nonholonomic mobile robots, in Proceedings of the IEEE/RSJ International Workshop on Intelligent Robots and Systems, Osaka, Japan, 1991, pp. 1229–1235.
25.
L. Kavraki and J. C. Latombe, Randomized preprocessing of configuration space for fast path planning, in Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, CA, 1994, pp. 2138–2145.
26.
L. Kavraki, J. C. Latombe, R. Motwani, and P. Raghavan, Randomized query processing in robot path planning, in Proceedings of the 27th Sympos. Theory Computing, Las Vegas, NV, 1995, pp. 353–362.
27.
V. P. Kostov and E. V. Degtiariova‐Kostova, Suboptimal Paths in the Problem of a Planar Motion with Bounded Derivative of the Curvature, Technical report, INRIA, Cedex, France, 1993.
28.
V. Kostov, E. Degtiariova‐Kostova, The planar motion with bounded derivative of the curvature and its suboptimal paths, Acta Math. Univ. Comenian. (N.S.), 64 (1995), 185–226
29.
J. C. Latombe, A fast path‐planner for a car‐like indoor mobile robot, in Proceedings of the Ninth National Conference on Artificial Intelligence, Anaheim, CA, 1991, pp. 659–665.
30.
J.‐P. Laumond, Robot motion planning and control, Lecture Notes in Control and Information Sciences, Vol. 229, Springer‐Verlag London Ltd., 1998x+343
31.
J. P. Laumond, Finding collision free smooth trajectories for a nonholonomic mobile robot, Proc. Internat. Joint Conf. Artificial Intelligence, 10 (1987), pp. 1120–1123.
32.
J. P. Laumond, P. E. Jacobs, M. Taix, and R. M. Murray, A motion planner for nonholonomic mobile robots, IEEE Trans. Robotics and Automation, 10 (1994), pp. 577–593.
33.
J. P. Laumond and T. Simeon, Motion Planning for a Two Degrees of Freedom Mobile Robot with Towing, Technical report, LAAS/CNRS, LAAS, Toulouse, France, 1989.
34.
J. P. Laumond, M. Taix, and P. Jacobs, A motion planner for car‐like robots based on a global/local approach, in Proc. IEEE/RSJ International Workshop on Intelligent Robots and Systems, Tsuchira, Japan, 1990, pp. 765–773.
35.
G. L. Miller, D. Talmor, S. Teng, and N. Walkington, A Delaunay based numerical method for three dimensions: Generation, formulation, and partition, Proc. Sympos. on Theory of Computing, 27 (1995), pp. 683–692.
36.
Gary Miller, Shang‐Hua Teng, William Thurston, Stephen Vavasis, Automatic mesh partitioning, IMA Vol. Math. Appl., Vol. 56, Springer, New York, 1993, 57–84
37.
B. Mirtich and J. Canny, Using skeletons for nonholonomic path planning among obstacles, in Proceedings of the IEEE International Conference on Robotics and Automation, Nice, France, 1992, pp. 2533–2540.
38.
J. S. B. Mitchell, D. M. Mount, and S. Suri, Query‐sensitive ray shooting, Proc. Sympos. Comput. Geom., 10 (1994), pp. 359–368.
39.
Y. Nakamura and R. Mukherjee, Nonholonomic path planning and automation, in Proceedings of the IEEE International Conference on Robotics and Automation, Scottsdale, AZ, 1989, pp. 1050–1055.
40.
Colm Ó’Dúnlaing, Motion planning with inertial constraints, Algorithmica, 2 (1987), 431–475, Special issue on robotics
41.
J. Reeds, L. Shepp, Optimal paths for a car that goes both forwards and backwards, Pacific J. Math., 145 (1990), 367–393
42.
J. Reif, Complexity of the generalized movers problem, in Planning, Geometry and Complexity of Robot Motion, J. Hopcroft, J. Schwartz, and M. Sharir, eds., Ablex, Norwood, NJ, 1987, pp. 267–281.
43.
J. Reif, S. Tate, Approximate kinodynamic planning using ‐norm dynamic bounds, Comput. Math. Appl., 27 (1994), 29–44
44.
G. Sahar and J. M. Hollerbach, Planning of Minimum‐Time Trajectories for Robot Arms, Technical report, MIT, Cambridge, MA, 1984.
45.
Jacob Schwartz, Micha Sharir, Algorithmic motion planning in robotics, Elsevier, Amsterdam, 1990, 391–430
46.
Hongyan Wang, Pankaj Agarwal, Approximation algorithms for curvature‐constrained shortest paths, ACM, New York, 1996, 409–418
47.
G. Wilfong, Motion planning for an autonomous vehicle, in Proceedings of the IEEE International Conference on Robotics and Automation, 1988, pp. 529–533.
48.
G. Wilfong, Shortest paths for autonomous vehicles, in Proceedings of the IEEE International Conference on Robotics and Automation, 1989, pp. 15–20.
49.
P. Xavier, private communication, 1998.
Information & Authors
Information
Published In
SIAM Journal on Computing
Pages: 161 - 190
ISSN (online): 1095-7111
Copyright
Copyright © 2000 Society for Industrial and Applied Mathematics.
History
Published online: 27 July 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Complexity of PlanningEncyclopedia of Robotics | 6 November 2020
- Motion in Local CoordinatesAutonomous Mobile Robots and Multi‐Robot Systems | 6 September 2019
- An Online Approach to D2D Trajectory Utility Maximization ProblemIEEE INFOCOM 2018 - IEEE Conference on Computer Communications | 1 Apr 2018
- Path planning of nonholonomic flying robots using a new virtual obstacle method2015 3rd RSI International Conference on Robotics and Mechatronics (ICROM) | 1 Oct 2015
- On soft predicates in subdivision motion planningComputational Geometry, Vol. 48, No. 8 | 1 Sep 2015
- On soft predicates in subdivision motion planningProceedings of the twenty-ninth annual symposium on Computational geometry | 17 June 2013
- Optimal Trajectories of Curvature Constrained Motion in the Hamilton–Jacobi FormulationJournal of Scientific Computing, Vol. 54, No. 2-3 | 14 December 2012
- A cell based voronoi roadmap for motion planning of articulated robots using movement primitives2012 IEEE International Conference on Robotics and Biomimetics (ROBIO) | 1 Dec 2012
- A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV GuidanceJournal of Intelligent and Robotic Systems, Vol. 57, No. 1-4 | 17 November 2009
- A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV GuidanceSelected papers from the 2nd International Symposium on UAVs, Reno, Nevada, U.S.A. June 8–10, 2009 | 17 November 2009
- Pareto optimal multi-robot coordination with acceleration constraints2008 IEEE International Conference on Robotics and Automation | 1 May 2008
- A Complete Approximation Algorithm for Shortest Bounded-Curvature PathsAlgorithms and Computation | 1 Jan 2008
- Motion coordination in dynamic environments: reaching a moving goal while avoiding moving obstaclesProceedings. 11th IEEE International Workshop on Robot and Human Interactive Communication | 1 Jan 2002
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].