Abstract
This paper presents a sampling-based motion planner geared towards mobile robots with differential constraints. The planner conducts the search for a trajectory to the goal region by using sampling to expand a tree of collision-free and dynamically-feasible motions. To guide the tree expansion, a workspace decomposition is used to partition the motion tree into groups. Priority is given to tree expansions from groups that are close to the goal according to the shortest-path distances in the workspace decomposition. To counterbalance the greediness of the shortest-path heuristic, when the planner fails to expand the tree from one region to the next, the costs of the corresponding edges in the workspace decomposition are increased. Such cost increases enable the planner to quickly discover alternative routes to the goal when progress along the current route becomes difficult or impossible. Comparisons to related work show significant speedups.
Keywords
- Sampling-based motion planning
- Differential constraints
- Workspace decomposition
- Discrete search
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alterovitz, R., Goldberg, K.: Motion Planning in Medicine: Optimization and Simulation Algorithms for Image-Guided Procedures. Springer Tracts in Advanced Robotics (2008)
Åström, K.J., Hägglund, T.: PID controllers: theory, design, and tuning. The Instrumentation, Systems, and Automation Society (1995)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag (2008)
Brin, S.: Near neighbor search in large metric spaces. In: International Conference on Very Large Data Bases, pp. 574–584 (1995)
Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press (2005)
Şucan, I.A., Kavraki, L.E.: A sampling-based tree planner for systems with complex dynamics. IEEE Transactions on Robotics 28(1), 116–131 (2012)
Dalibard, S., Laumond, J.-P.: Control of probabilistic diffusion in motion planning. In: Chirikjian, G.S., Choset, H., Morales, M., Murphey, T. (eds.) Algorithmic Foundation of Robotics VIII. STAR, vol. 57, pp. 467–481. Springer, Heidelberg (2009)
Devaurs, D., Simeon, T., Cortés, J.: Enhancing the transition-based RRT to deal with complex cost spaces. In: IEEE International Conference on Robotics and Automation, pp. 4120–4125 (2013)
Gipson, B., Moll, M., Kavraki, L.E.: Resolution independent density estimation for motion planning in high-dimensional spaces. In: IEEE International Conference on Robotics and Automation, pp. 2437–2443 (2013)
Hsu, D., Kindel, R., Latombe, J.C., Rock, S.: Randomized kinodynamic motion planning with moving obstacles. International Journal of Robotics Research 21(3), 233–255 (2002)
Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. International Journal of Robotics Research 30(7), 846–894 (2011)
Larsen, E., Gottschalk, S., Lin, M., Manocha, D.: Fast proximity queries with swept sphere volumes. In: IEEE International Conference on Robotics and Automation, pp. 3719–3726 (2000)
LaValle, S.M.: Planning Algorithms. Cambridge University Press (2006)
LaValle, S.M.: Motion planning: The essentials. IEEE Robotics & Automation Magazine 18(1), 79–89 (2011)
LaValle, S.M., Kuffner, J.J.: Randomized kinodynamic planning. International Journal of Robotics Research 20(5), 378–400 (2001)
Le, D., Plaku, E.: Guiding sampling-based tree search for motion planning with dynamics via probabilistic roadmap abstractions. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 212–217 (2014)
Plaku, E., Kavraki, L.E., Vardi, M.Y.: Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning. In: IEEE International Conference on Robotics and Automation, pp. 3751–3756 (2008)
Plaku, E.: Robot motion planning with dynamics as hybrid search. In: AAAI Conference on Artificial Intelligence, pp. 1415–1421 (2013)
Plaku, E., Kavraki, L.E., Vardi, M.Y.: Motion planning with dynamics by a synergistic combination of layers of planning. IEEE Transactions on Robotics 26(3), 469–482 (2010)
Shewchuk, J.R.: Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications 22(1–3), 21–74 (2002). http://www.cs.cmu.edu/~quake/triangle.html
Wells, A., Plaku, E.: Supplementary material, http://faculty.cua.edu/plaku/TAROS15Videos.zip
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wells, A., Plaku, E. (2015). Adaptive Sampling-Based Motion Planning for Mobile Robots with Differential Constraints. In: Dixon, C., Tuyls, K. (eds) Towards Autonomous Robotic Systems. TAROS 2015. Lecture Notes in Computer Science(), vol 9287. Springer, Cham. https://doi.org/10.1007/978-3-319-22416-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-22416-9_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22415-2
Online ISBN: 978-3-319-22416-9
eBook Packages: Computer ScienceComputer Science (R0)