• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.729-736
• /
• 2003

In this paper, we propose that the chaotic behavior analysis in the mobile robot of embedding some chaotic such as Chua`s equation, Arnold equation with obstacle. In order to analysis of chaotic behavior in the mobile robot, we apply not only qualitative analysis such as time-series, embedding phase plane, but also quantitative analysis such as Lyapunov exponent In the mobile robot with obstacle. We consider that there are two type of obstacle, one is fixed obstacle and the other is VDP obstacle which have an unstable limit cycle. In the VDP obstacles case, we only assume that all obstacles in the chaos trajectory surface in which robot workspace has an unstable limit cycle with Van der Pol equation.

• Journal of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.225-234
• /
• 1998

We compute genus distributions for bouquets of dipoles by using the method concerning the cycle structure of permutations in the symmetric group. From this, we can deduce that every bouquet of dipoles is upper embeddable. We find a foumula for computing the embedding polynomials for bouquets of dipoles.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.313-323
• /
• 2000

In this paper, we consider ring embedding problem on (n,k)-star graphs. We first present a new ring embedding strategy and also prove the superiority in expandability by showing its application into the fault-tolerant ring embedding problem with edge faults. This result can be applied to the multicating applications that use the underlying cycle properties on the multi-computer system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05a
• /
• pp.123-127
• /
• 2004

In this paper, we propose that the chaotic behavior analysis in the several Arnold chaos mobile robot of embedding some chaotic such as Arnold equation with obstacle. In order to analysis of chaotic behavior in the mobile robot, we apply not only qualitative analysis such as time-series, embedding phase plane, but also quantitative analysis such as Lyapunov exponent in the mobile robot with obstacle. We consider that there are two type of obstacle, one is fixed obstacle and the other is hidden obstacle which have an unstable limit cycle. In the hidden obstacles case, we only assume that all obstacles in the chaos trajectory surface in which robot workspace has an unstable limit cycle with Van der Pol equation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.86-94
• /
• 2004

In this paper, we show that $ G(2^m, 4), m{\geq}3$with at most m-2 faulty elements has a fault-free cycle of length 1 for every ${\leq}1{\leq}2^m-f_v$ is the number of faulty vertices. To achieve our purpose, we define a graph G to be k-fault hypohamiltonian-connected if for any set F of faulty elements, G- F has a fault-free path joining every pair of fault-free vertices whose length is shorter than a hamiltonian path by one, and then show that$ G(2^m, 4), m{\geq}3$ is m-3-fault hypohamiltonian-connected.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.75-84
• /
• 2011

The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the graph is only four.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.213-221
• /
• 2012

The architecture of an interconnection network is usually represented by a graph, and a graph G is bipancyclic if it contains a cycle for every even length from 4 to ${\mid}V(G){\mid}$. In this article, we analyze the conditional edge-fault-tolerant properties of an enhanced hypercube, which is an attractive variant of a hypercube that can be obtained by adding some complementary edges. For any n-dimensional enhanced hypercube with at most (2n-3) faulty edges in which each vertex is incident with at least two fault-free edges, we showed that there exists a fault-free cycle for every even length from 4 to $2^n$ when n($n{\geq}3$) and k have the same parity. We also show that a fault-free cycle for every odd length exists from n-k+2 to $2^n-1$ when n($n{\geq}2$) and k have the different parity.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.110-113
• /
• 2003

In this paper, we propose that the chaotic behavior analysis in the mobile robot of embedding Arnold equation with obstacle. In order to analysis of chaotic behavior in the mobile robot, we apply not only qualitative analysis such as time-series, embedding phase plane, but also quantitative analysis such as Lyapunov exponent in the mobile robot with obstacle. In the obstacle, we only assume that all obstacles in the chaos trajectory surface in which robot workspace has an unstable limit cycle with Van der Pol equation.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.5-8
• /
• 2003

In this paper, we propose that the chaotic behavior analysis in the mobile robot of embedding Chua's equation with obstacle. In order to analysis of chaotic behavior in the mobile robot, we apply not only qualitative analysis such as time-series, embedding phase plane, but also quantitative analysis such as Lyapunov exponent in the mobile robot with obstacle. In the obstacle, we only assume that all obstacles in the chaos trajectory surface in which robot workspace has an unstable limit cycle with Van der Pol equation

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.589-593
• /
• 2003

In this paper, we propose that the chaotic behavior analysis in the mobile robot of embedding Chua's equation with obstacle. In order to analysis of chaotic behavior in the mobile robot, we apply not only qualitative analysis such as time-series, embedding phase plane, but also quantitative analysis such as Lyapunov exponent in the mobile robot with obstacle. In the obstacle, we only assume that all obstacles in the chaos trajectory surface in which robot workspace has an unstable limit cycle with Van der Pol equation.