Introduction
In many motion planing problems, the feasible subspace becomes thin in some directions. This is often due to kinematic closure constraints, which restrict the feasible configurations to a lower-dimensional manifold or variety. This may also be simply due to the way the obstacles are arranged. For example, is planning for a closed chain different from planning a sliding motion for a washer against a rod? An illustration for the two instances of such problems is shown on Fig. 27.1. Traditionally, the two problems are solved with different methods in motion planning. However, the two seemingly different problems have similar algebraic and geometric structure of the sets of feasible configurations. In either case, there may exist functions of the form |f i (q)| ≤ ε i , ε i ≥ 0, that contain most or all of the feasible set. Typically, ε i is very small, and in the case of closed chains, ε i = 0. When this occurs, a region of the feasible space has small intrinsic dimensionality, in comparison to the ambient configuration space. Note that in the problem on Fig. 27.1(b) and in similar motion planning problems, the f i are not necessarily given.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arya, S., Mount, D.M.: Approximate nearest neihgbor queries in fixed dimensions. In: ACM-SIAM Sympos. Discrete Algorithms, pp. 271–280 (1993)
Atramentov, A., LaValle, S.M.: Efficient nearest neighbor searching for motion planning. In: IEEE Int. Conf. Robot. & Autom., pp. 632–637 (2002)
Canny, J.F.: The Complexity of Robot Motion Planning. MIT Press, Cambridge (1988)
Cortés, J., Siméon, T.: Sampling-based motion planning under kinematic loop-closure constraints. In: 6th Int. Workshop on Algorithmic Foundations of Robotics, pp. 59–74 (2004)
Dickenstein, A., Emiris, I.Z.: Solving Polynomial Equations: Foundations, Algorithms, and Applications. Springer, Heidelberg (2005)
Ferré, E., Laumond, J.P.: An iterative diffusion method for part disassembly. In: IEEE Int. Conf. Robot. & Autom. (2004)
Han, L., Rudolph, L.: Simplex-tree based kinematics of foldable objects as multi-body systems involving loops. In: Robotics: Science and Systems IV (2008)
Jaillet, L., Yershova, A., LaValle, S.M., Simon, T.: Adaptive tuning of the sampling domain for dynamic-domain RRTs. In: IEEE/RSJ Int. Conf. on Intelligent Robots & Systems (2005)
Kuffner, J.J., LaValle, S.M.: RRT-connect: An efficient approach to single-query path planning. In: IEEE Int. Conf. Robot. & Autom., pp. 995–1001 (2000)
Liu, G., Trinkle, J., Milgram, R.: Toward complete path planning for planar 3r-manipulators among point obstacles. In: Workshop on Algorithmic Foundations of Robotics (2005)
Overmars, M.H., van Leeuwen, J.: Dynamic multidimensional data structures based on Quad- and K-D trees. Acta Informatica 17, 267–285 (1982)
Porta, J., Ros, L., Thomas, F.: Multi-loop position analysis via iterated linear programming. In: Robotics: Science and Systems, Cambridge, USA (2006)
Tang, X., Thomas, S., Amato, N.M.: Planning with reachable distances: Fast enforcement of closure constraints. In: IEEE Int. Conf. Robot. & Autom., pp. 2694–2699 (2007)
Yakey, J., LaValle, S.M., Kavraki, L.E.: Randomized path planning for linkages with closed kinematic chains. IEEE Transactions on Robot. and Autom. 17(6), 951–958 (2001)
Yershova, A., Jaillet, L., Simon, T., LaValle, S.M.: Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain. In: IEEE Int. Conf. Robot. & Autom. (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer London
About this paper
Cite this paper
Yershova, A., LaValle, S.M. (2009). Motion Planning for Highly Constrained Spaces. In: Kozłowski, K.R. (eds) Robot Motion and Control 2009. Lecture Notes in Control and Information Sciences, vol 396. Springer, London. https://doi.org/10.1007/978-1-84882-985-5_27
Download citation
DOI: https://doi.org/10.1007/978-1-84882-985-5_27
Publisher Name: Springer, London
Print ISBN: 978-1-84882-984-8
Online ISBN: 978-1-84882-985-5
eBook Packages: EngineeringEngineering (R0)