Abstract
We propose to design motion planning algorithms with a strong form of resolution completeness, called resolution-exactness. Such planners can be implemented using soft predicates within the subdivision paradigm. The advantage of softness is that we avoid the Zero problem and other issues of exact computation. Soft Subdivision Search (SSS) is an algorithmic framework for such planners. There are many parallels between our framework and the well-known Probabilistic Road Map (PRM) framework. Both frameworks lead to algorithms that are practical, flexible, extensible, with adaptive and local complexity. Our several recent papers have demonstrated these favorable properties on various non-trivial motion planning problems. In this paper, we provide a general axiomatic theory underlying these results. We also address the issue of subdivision in non-Euclidean configuration spaces, and how exact algorithms can be recovered using soft methods.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
C.K. Yap—Plenary Talk at the 9th Int’l. Frontiers of Algorithmics Workshop (FAW 2015) in Guilin, China, July 3–5. This work is supported by NSF Grants CCF-0917093 and CCF-1423228.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Except speed of light which is exactly known, by definition.
- 2.
To do this, it would have to detect (probabilistically) that the sampling is dense enough, a non-trivial extension of the current PRM formulations.
- 3.
A geometric predicate is a 3-valued function, with a distinguished value \(0\) called the indefinite value. The others are called definite values. This is in contrast to a logical predicate which is 2-valued.
- 4.
We use the notation in, e.g., [3]. This means there is a set, denoted \(set\mathtt{-}\mathtt{Expand}(B)\), of subdivisions of \(B\), and \(\mathtt{Expand}(B)\) denotes (non-deterministically) any element of this set. We assume \(set\mathtt{-}\mathtt{Expand}(B)\) is non-empty so that \(\mathtt{Expand}(B)\) is a total function.
- 5.
This term is from the interval literature. Though not strictly necessary, but it simplifies some arguments.
- 6.
We are indebted to Steve LaValle for asking this question at the IROS 2011 Workshop in San Francisco.
References
Barbehenn, M., Hutchinson, S.: Toward an exact incremental geometric robot motion planner. In: Proceedings of Intelligent Robots and Systems 1995, vol. 3, pp. 39–44 (1995). 1995 IEEE, RSJ International Conference, Pittsburgh. PA, USA, pp. 5–9, August 1995
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol. 10, 2nd edn. Springer, Heidelberg (2006)
Beyersdorff, O., Köbler, J., Messner, J.: Nondeterministic functions and the existence of optimal proof systems. Theor. Comput. Sci. 410(38–40), 3839–3855 (2009)
Brooks, R.A., Lozano-Perez, T.: A subdivision algorithm in configuration space for findpath with rotation. In: Proceedings of the 8th IJCAI, San Francisco, CA, USA, vol. 2, pp. 799–806. Morgan Kaufmann Publishers Inc. (1983)
Brownawell, W.D., Yap, C.K.: Lower bounds for zero-dimensional projections. In: 2009 34th International Symposium on Symbolic and Algebraic Computation (ISSAC 2009), pp. 79–86. KIAS, Seoul, Korea, 28–31 July 2009
Burr, M., Krahmer, F.: SqFreeEVAL: an (almost) optimal real-root isolation algorithm. J. Symb. Comput. 47(2), 153–166 (2012)
Cabello, S., Kerber, M.: Semi-dynamic connectivity in the plane. In: Algorithms and Data Structure Symposium (WADS 2015) (to appear, 2015). arXiv:1502.03690
Chiang, Y.-J., Yap, C.: Numerical subdivision methods in motion planning. 2011 Poster, IROS Workshop on Progress and Open Problems in Motion Planning, San Francisco, 30 September 2011
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, Boston (2005)
Kavraki, L., Švestka, P., Latombe, C., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566–580 (1996)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
Luo, Z., Chiang, Y.-J., Lien, J.-M., Yap, C.: Resolution exact algorithms for link robots. In: 2014 Proceedings of the 11th WAFR, Boǧaziçi University, Istanbul, Turkey, 3–5 August 2014. (to appear in a Springer Tracts in Advanced Robotics (STAR))
Luo, Z., Yap, C.: Resolution exact planner for non-crossing 2-link robot (2015, Submitted)
Nowakiewicz, M.: MST-based method for 6DOF rigid body motion planning in narrow passages. In: 2010 Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, Taipei, Taiwan, pp. 5380–5385, 18–22 October 2010
Ó’Dúnlaing, C., Sharir, M., Yap, C.K.: Retraction: a new approach to motion-planning. ACM Symp. Theor. Comput. 15, 207–220 (1983)
Ó’Dúnlaing, C., Yap, C.K.: A “retraction” method for planning the motion of a disc. J. Algorithms 6, 104–111 (1985)
Rivara, M.-C.: Lepp-bisection algorithms, applications and mathematical properties. Appl. Numer. Math. 59(9), 2218–2235 (2009)
Sagraloff, M., Yap, C.K.: A simple but exact and efficient algorithm for complex root isolation. In: Emiris, I.Z. (ed.) 36th International Symposium on Symbolic and Algebraic Computation, San Jose, California, pp. 353–360, 8–11 June 2011
Sharma, V., Yap, C.: Near optimal tree size bounds on a simple real root isolation algorithm. In: 2012 37th International Symposium on Symbolic and Algebraic Computation (ISSAC 2012), Grenoble, France, pp. 319–326, 22–25 July 2012
Wang, C., Chiang, Y.-J., Yap, C.: On soft predicates in subdivision motion planning. In: 2014 Computational Geometry: Theory and Applications, Special Issue for SoCG, Rio de Janeiro, Brazil, 17–20 June 2013
Wei, Z., Yap, C.: Soft subdivision planner for a rod (2015. in preparation)
Yap, C., Sharma, V., Lien, J.-M.: Towards exact numerical voronoi diagrams. In: 2012 9th Proceedings of the International Symposium of Voronoi Diagrams in Science and Engineering (ISVD), Rutgers University, NJ, pp. 2–16. IEEE, 27–29 June 2012. Invited Talk
Yap, C.K.: Algorithmic motion planning. In: Schwartz, J., Yap, C. (eds.) Advances in Robotics. Algorithmic and Geometric Issues, vol. 1, pp. 95–143. Lawrence Erlbaum Associates, Hillsdale (1987)
Yap, C.K.: Robust geometric computation. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn, pp. 927–952. Chapman & Hall/CRC, Boca Raton (2004)
Yap, C.K.: Soft subdivision search in motion planning. In: Aladren, A., et al. (eds.) In: Proceedings of 1st Workshop on Robotics Challenge and Vision (RCV 2013), A Computing Community Consortium (CCC) Best Paper Award, Robotics Science and Systems Conference (RSS 2013), Berlin (2013). arXiv:1402.3213
Yershova, A., Jain, S., LaValle, S.M., Mitchell, J.C.: Generating uniform incremental grids on SO(3) using the Hopf fibration. IJRR 29(7), 801–812 (2010)
Zhang, L., Kim, Y.J., Manocha, D.: Efficient cell labeling and path non-existence computation using C-obstacle query. Int. J. Robot. Res. 27(11–12), 1325–1349 (2008)
Zhu, D., Latombe, J.-C.: New heuristic algorithms for efficient hierarchical path planning. IEEE Trans. Robot. Autom. 7, 9–20 (1991)
Acknowledgments
I am indebted to Yi-Jen Chiang, Danny Halperin, Steve LaValle, and Vikram Sharma for many helpful discussions.
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
Yap, C.K. (2015). Soft Subdivision Search in Motion Planning, II: Axiomatics. In: Wang, J., Yap, C. (eds) Frontiers in Algorithmics. FAW 2015. Lecture Notes in Computer Science(), vol 9130. Springer, Cham. https://doi.org/10.1007/978-3-319-19647-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-19647-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19646-6
Online ISBN: 978-3-319-19647-3
eBook Packages: Computer ScienceComputer Science (R0)