Using interval arithmetic to prove that a set is path-connected
نویسندگان
چکیده
In this paper, we give a numerical algorithm able to prove whether a set S described by nonlinear inequalities is path-connected or not. To our knowledge, no other algorithm (numerical or symbolic) is able to deal with this type of problem. The proposed approach uses interval arithmetic to build a graph which has exactly the same number of connected components than S. Examples illustrate the principle of the approach.
منابع مشابه
Arithmetic Aggregation Operators for Interval-valued Intuitionistic Linguistic Variables and Application to Multi-attribute Group Decision Making
The intuitionistic linguistic set (ILS) is an extension of linguisitc variable. To overcome the drawback of using single real number to represent membership degree and non-membership degree for ILS, the concept of interval-valued intuitionistic linguistic set (IVILS) is introduced through representing the membership degree and non-membership degree with intervals for ILS in this paper. The oper...
متن کاملInterval-valued intuitionistic fuzzy aggregation methodology for decision making with a prioritization of criteria
Interval-valued intuitionistic fuzzy sets (IVIFSs), a generalization of fuzzy sets, is characterized by an interval-valued membership function, an interval-valued non-membership function.The objective of this paper is to deal with criteria aggregation problems using IVIFSs where there exists a prioritization relationship over the criteria.Based on the ${L}$ukasiewicz triangular norm, we first p...
متن کامل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.
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملMotion Planning Using Interval Analysis
This paper deals with characterizing the connected component AS(~a) of a set S that contains a given point ~a. The set S is assumed to be de ned by nonlinear inequalities, so that interval analysis can be used to prove that a given box is inside or outside S. Further, the characterization of AS(~a) is used to nd a feasible path (i.e. a path that lies within S) that links ~a to any other point ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 351 شماره
صفحات -
تاریخ انتشار 2006