• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.731-742
• /
• 2022

In this paper, we present a new mixed type iterative process for approximating the common fixed points of single-valued nonexpansive mapping and multi-valued nonexpansive mapping in a CAT(0) space. We demonstrate strong and weak convergence theorems for the new iterative process in CAT(0) spaces, as well as numerical results to support our theorem.

• Kyungpook Mathematical Journal
• /
• v.46 no.3
• /
• pp.389-397
• /
• 2006

A fixed point theorem of Singh and Singh [10] is generalized to locally convex spaces and the new result is applied to extend a result on invariant approximation of Jungck and Sessa [5].

• Korean Journal of Mathematics
• /
• v.14 no.1
• /
• pp.7-11
• /
• 2006

This paper is devoted to the study of the role of fuzzy proximity spaces. We define a fuzzy K-proximally continuous mapping based on the fuzzy K-proximity and prove some of its properties.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.896-899
• /
• 1996

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.

• East Asian mathematical journal
• /
• v.17 no.2
• /
• pp.297-301
• /
• 2001

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.1992-2007
• /
• 1997

A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.793-806
• /
• 2016

G-vector-valued sequence space frames and g-Banach frames for Banach spaces are introduced and studied in this paper. Also, the concepts of duality mapping and ${\beta}$-dual of a BK-space are used to define frame mapping and synthesis operator of these frames, respectively. Finally, some results regarding the existence of g-vector-valued sequence space frames and g-Banach frames are obtained. In particular, it is proved that if X is a separable Banach space and Y is a Banach space with a Schauder basis, then there exist a Y-valued sequence space $Y_v$ and a g-Banach frame for X with respect to Y and $Y_v$.

• Korean Journal of Mathematics
• /
• v.17 no.2
• /
• pp.219-231
• /
• 2009

We show the existence of at least four solutions for the perturbed parabolic equation with Dirichlet boundary condition and periodic condition when the nonlinear part cross two eigenvalues of the eigenvalue problem of the Laplace operator with boundary condition. We obtain this result by using the Leray-Schauder degree theory, the finite dimensional reduction method and the geometry of the mapping. The main point is that we restrict ourselves to the real Hilbert space instead of the complex space.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.1
• /
• pp.1-16
• /
• 2013

The aim of this paper is to establish a new fixed point theorem for a set-valued mapping defined on a metric space satisfying a weak contractive type condition and to establish a new common fixed point theorem for a pair of set-valued mappings defined on a metric space satisfying a weak contractive type inequality. And we give periodic point theorems for single-valued mappings defined on a metric space satisfying weak contractive type conditions.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.3
• /
• pp.21-28
• /
• 2008

In MCDA (Multi-Criteria Decision Analysis) based on GIS, building the CM(Criteria Map) which represents the space phenomenon properly is important process to deduce precise and efficient site analysis result. The CM using administrative district data is widely used for site analysis process. But, there are not enough studies on site analysis using dasymetric mapping technique. For MCDA, this study suggests building the CM by using dasymetric mapping technique, which re-assigns the social-economic attribute value to more detail space unit. The suggested method is used for industrial site analysis. The criteria map for workforce and criteria map for the distance to the city were built and criteria map which represents attribute's space distribution pattern is documented. The criteria map is successfully applied to multi-criteria decision making process and eventually the analysis result of proposed suitable industrial site is derived.