Abstract
This paper gives a numerical algorithm able to compute the number of path-connected components of a set \(\mathbb{S}\) defined by nonlinear inequalities. This algorithm uses interval analysis to create a graph which has the same number of connected components as \(\mathbb{S}\). An example coming from robotics is presented to illustrate the interest of this algorithm for path-planning.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Delanoue, N., Jaulin, L., Cottenceau, B.: Using interval arithmetic to prove that a set is pathconnected. Theoretical computer science, Special issue: RealNumbers and Computers (2004)
Jaulin, L.: Path planning using intervals and graphs. Reliable Computing 7(1) (2001)
Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. International Journal Of Robotics Research (1986)
Janich, K.: Topology (Undergraduate Texts in Mathematics). Springer, Heidelberg
Jaulin, L., Walter, E.: Set inversion via interval analysis for nonlinear bounded-error estimation. Automatica 29(4), 1053–1064 (1993)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Math 1, 269–271 (1959)
Moore, R.E.: Methods and Applications of Interval Analysis. SIAM, Philadelphia (1979)
Rouillier, F., Roy, M.-F., Safey, M.: Finding at least one point in each connected component of a real algebraic set defined by a single equation. Journal of Complexity 16, 716–750 (2000)
Basu, S., Pollackz, R., Roy, M.-F.: Computing the first Betti number and the connected components of semi-algebraic sets
Lozano-Pérez, T.: Spatial Planning: A Configuration Space Approach. IEEETC (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delanoue, N., Jaulin, L., Cottenceau, B. (2006). Counting the Number of Connected Components of a Set and Its Application to Robotics. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol 3732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_11
Download citation
DOI: https://doi.org/10.1007/11558958_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29067-4
Online ISBN: 978-3-540-33498-9
eBook Packages: Computer ScienceComputer Science (R0)