Abstract
AbstractThis 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.KeywordsInterval AnalysisInterval ArithmeticFeasible PathNonlinear InequalityReliable ComputingThese 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.
Full Text
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call