Counting the Number of Connected Components of a Set and Its Application to Robotics

This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis to create a graph which has the same number of connected components as S. An example coming from robotics is presented to illustrate the interest of this algorithm for path-planning.

• Type: Conference
• Year: 2004
• Where: PARA
• Authors: Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau
• Keywords: Applied Computing, Nonlinear Inequalities, Numerical Algorithm, PARA 2004, Path-connected Components