• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.859-866
• /
• 1999

In Eucliden k-space the cone of vectors x=($\chi$1, $\chi$2, ...,$\chi$k) satisfying $\chi$1$\leq$$\chi$ 2, $\leq$...$\leq$$\chi$k and {{{{ SUM { }`_{j } ^{k } }}= 1 $\chi$j=0 is generated by the vectors vj=(j-k,...j-k...j) having j-k's in its first j coordinates and j's for the remaining k-j coordinates for 1$\leq$j$\leq$i

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.5 s.176
• /
• pp.1193-1202
• /
• 2000

The paper describes the use of genetic algorithms (GA's) to the minimum weight design of stiffened composite panels for buckling constraints. The proposed design problem is characterized by mixture of continuous and discrete design variables corresponding to panel elements and stacking sequence of laminates, respectively. Design space is multimodal and non-convex, thereby introducing the need for global search strategies. Advanced strategies in GA's such as directed crossover, multistage search and separated crossover are adopted to improve search ability and to save computational resource requirements. The paper explores the effectiveness of genetic algorithms and their advanced strategies in designing stiffened composite panels under various uniaxial compressive load conditions and the linrlit on stacking sequence of laminates.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1043-1048
• /
• 1990

The degenerate case of multivariable hyperbolic distributed-parameter systems (systems of hyperbolic partial differential equations) in time coordinate t and space coordinate x is characterized by a property that all the characteristic curves of the state equations are parallel to the coordinate axes of independent variables. It is a disturbing fact, although not well known, that the so-called maximum principle as applied to these systems does not exist for the control that depend on time alone. In this paper, however, it is shown that a set of necessary conditions in the small can exist for unconstrained as well as magnitude constrained controls in a locally convex set. The necessary conditions thus derived can be used conveniently to find the optimal control for degenerate hyperbolic distributed-parameter control systems.

• Journal of the Korean Mathematical Society
• /
• v.40 no.1
• /
• pp.29-40
• /
• 2003

Let K be a nonempty closed bounded convex subset of an arbitrary smooth Banach space X and T : KlongrightarrowK be a strictly hemi-contractive operator. Under some conditions we obtain that the Mann iteration method with errors both converges strongly to a unique fixed point of T and is almost T-stable on K. The results presented in this paper generalize the corresponding results in [l]-[7], [20] and others.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.377-392
• /
• 2008

Let X be a real reflexive Banach space with a uniformly $G\hat{a}teaux$ differentiable norm, C a nonempty closed convex subset of X, T : C $\rightarrow$ X a continuous pseudocontractive mapping, and A : C $\rightarrow$ C a continuous strongly pseudocontractive mapping. We show the existence of a path ${x_t}$ satisfying $x_t=tAx_t+(1- t)Tx_t$, t $\in$ (0,1) and prove that ${x_t}$ converges strongly to a fixed point of T, which solves the variational inequality involving the mapping A. As an application, we give strong convergence of the path ${x_t}$ defined by $x_t=tAx_t+(1-t)(2I-T)x_t$ to a fixed point of firmly pseudocontractive mapping T.

• Communications of the Korean Mathematical Society
• /
• v.18 no.2
• /
• pp.251-261
• /
• 2003

The purpose of this paper is to establish the necessary and sufficient conditions which ensure the strong convergence of the Ishikawa iterative schemes with errors to the unique fixed point of a $\Phi$-hemicontractive mapping defined on a nonempty convex subset of a normed linear space. The results of this paper extend substantially most of the recent results.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.93-102
• /
• 1997

Let C be a nonempty closed convex subset of a Banach space E and let $T_1, \cdots, T_N$ be nonexpansive mappings from C into itself (recall that a mapping $T : C \longrightarrow C$ is nonexpansive if $\left\$\mid$ Tx - Ty \right\$\mid$ \leq \left\$\mid$ x - y \right\$\mid$$ for all $x, y \in C$). We consider the fixed point problem for nonexpansive mappings : find a common fixed point, i.e., find a point in $\cap_{i=1}^N Fix(T_i)$, where $Fix(T_i) := {x \in C : x = T_i x}$ denotes the set of fixed points of $T_i$.

• Kyungpook Mathematical Journal
• /
• v.49 no.4
• /
• pp.701-712
• /
• 2009

In this paper, we first introduce a family S = {$S_n$ : C ${\rightarrow}$ C} of non-Lipschitzian mappings, called total asymptotically nonexpansive (briefly, TAN) on a nonempty closed convex subset C of a real Banach space X, and next give necessary and sufficient conditions for strong convergence of the sequence {$x_n$} defined recursively by the algorithm $x_{n+1}$ = $S_nx_n$, $n{\geq}1$, starting from an initial guess $x_1{\in}C$, to a common fixed point for such a continuous TAN family S in Banach spaces. Finally, some applications to a finite family of TAN self mappings are also added.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.425-429
• /
• 1987

This paper describes a collision avoidance method for planning safe trajectories for multi-robot system in common work space. Usually objects have been approximated to convex polyhedra in most previous researches, but in case using such the approximation method it is difficult to represent objects analytically in terms of functions and also to describe tile relationship between the objects. In this paper, in order to solve such problems a modeling method which approximates objects to cylinder ended by hemispheres and or sphere is used and the maximum distance functions is defined which call be calculated simply. Using an objective function with inequality constraints which are related to minimum distance functions, work range and maximum allowable angular velocities of the robots, tile collision avoidance for two robots is formulated to a constrained function optimization problem. With a view to solve tile problem a penalty function having simple form is defined and used. A simple numerical example involving two PUMA-type robots is described.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.3
• /
• pp.183-192
• /
• 2001

In this paper, the decoupling H(sub)$\infty$ controller which minimizes the maximum energy in the output signal is designed to reduce the coupling properties between the input/output variables which make it difficult to control a system efficiently. The state-space formulas corresponding to the existing transfer matrix formulas of the controller are derived for computational efficiency. And for a given decoupling $H_{\infty}$ problem, an efficient method are sought to find the controller coefficients through the LMI(Linear Matrix Inequalities) method by which the problem is formulated into a convex optimization problem.