• 호남수학학술지
• /
• 제35권4호
• /
• pp.757-764
• /
• 2013

In this paper, we give sufficient conditions for a map with nonconvex values to have a continuous selection and the selection extension property in LC-metric spaces under the one-point extension property. And we apply it to weakly lower semicontinuous maps and generalize previous results. We also get a continuous selection theorem for almost lower semicontinuous maps with closed sub-admissible values in $\mathbb{R}$-trees.

• 한국정보처리학회논문지
• /
• 제4권10호
• /
• pp.2477-2484
• /
• 1997

$A^{\ast}$와 같은 Best-first 휴리스틱 탐색 알고리즘들은 인공지능 분야에서 많은 문제를 해결하는데 가장 중요한 기법들 중의 하나이다. 휴리스틱 탐색의 공통적 특성은 계산의 복잡도가 매우 높다는 것이며, 이는 수많은 노드를 가진 지도에서 경로를 찾는 것과 같은 실질적인 문제 영역에 적용되기 어렵다는 것을 나타낸다. 본 논문에서는, 몇몇 휴리스틱 탐색 알고리즘이 언급되고, path-sensitive heuristic이라 불리는 새로운 동적 가중치 휴리스틱 방법이 제안되었다. 이 방법은 동적 가중치 휴리스틱에 기초하였고, 동적 휴리스틱은 admissible heuristic을 허용하지 않거나 휴리스틱의 정확도가 떨어지는 실제 문제 영역에서 탐색 노력을 줄이는데 사용될 수 있다. 탐색 과정 동안 ${\omega}$(가중치)가 동적으로 조정된다는 점에서, 다른 동적 가중치 휴리스틱 알고리즘과 구분된다.

• Korean Journal of Mathematics
• /
• 제26권2호
• /
• pp.175-189
• /
• 2018

In this paper, at first we generalize the notion of algebra over a field. A ${\Gamma}$-algebra is an algebraic structure consisting of a vector space V, a groupoid ${\Gamma}$ together with a map from $V{\times}{\Gamma}{\times}V$ to V. Then, on every associative ${\Gamma}$-algebra V and for every ${\alpha}{{\in}}{\Gamma}$ we construct an ${\alpha}$-Lie algebra. Also, we discuss some properties about ${\Gamma}$-Lie algebras when V and ${\Gamma}$ are the sets of $m{\times}n$ and $n{\times}m$ matrices over a field F respectively. Finally, we define the notions of ${\alpha}$-derivation, ${\alpha}$-representation, ${\alpha}$-nilpotency and prove Engel theorem in this case.

• 대한수학회논문집
• /
• 제23권1호
• /
• pp.81-93
• /
• 2008

In [3, 9], using the theory of noncommutative Dirichlet forms in the sense of Cipriani [6] and the symmetric embedding map, authors constructed the KMS-symmetric Markovian semigroup $\{S_t\}_{t{\geq}0}$ on a von Neumann algebra $\cal{M}$ with an admissible function f and an operator $x\;{\in}\;{\cal{M}}$. We give a sufficient and necessary condition for x so that the semigroup $\{S_t\}_{t{\geq}0}$ acts separately on diagonal and off-diagonal operators with respect to a basis and study some results.

• 로봇학회논문지
• /
• 제12권1호
• /
• pp.86-93
• /
• 2017

The Expanded Guide Circle (EGC) method has been originally proposed as the guidance navigation method for improving the efficiency of the remote operation using the sensory information. The previous algorithm is, however, concerned only for the omni-directional mobile robot, so it needs to suggest a suitable one for a mobile robot with non-holonomic constraints. The ego-kinematic transform is a method to map points of $R^2$ into the ego-kinematic space which implicitly represents non-holonomic constraints for admissible paths. Thus, robots with non-holonomic constraints in the ego-kinematic space can be considered as "free-flying object". In this paper, we propose an effective obstacle avoidance method for mobile robots with non-holonomic constraints by applying EGC method in the ego-kinematic space using the ego-kinematic transformation. This proposed method shows that it works better for non-holonomic mobile robots such as differential-drive robot than the original one. The simulation results show its effectiveness of performance.