• 제목/요약/키워드: chaotic

검색결과 904건 처리시간 0.02초

Chaotic Behavior Analysis in the Several Arnold Chaos Mobile Robot with Obstacles

  • Bae, Young-Chul;Kim, Yi-Gon;Mathis Tinduk;Koo, Young-Duk
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2004년도 SMICS 2004 International Symposium on Maritime and Communication Sciences
    • /
    • 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.

  • PDF

혼돈 현상을 보이는 적응기구에서의 강인한 적응법칙에 관한 알고리즘의 개발 (A Development of Algorithm on Robust Adaptive Law in Adaptive mechanism showing Chaotic phenomenon)

  • 전상영;임화영
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1994년도 추계학술대회 논문집 학회본부
    • /
    • pp.322-325
    • /
    • 1994
  • Mareel and Bitmead proved the presence of chaotic signal in random noise by applying dead beat control theory to adaptive mechanism. In this paper robust adaptive theory is proposed. With the property of chaotic signal that has order and law, the proposed theory can enhance the control Performance by applying the recursive algorithm that uses dynamic relation which have small correlation. The performance of proposed algorithm is demonstrated with the computer simulation of position control of electric motor. In this simulation, the adaptive low is adopted to control electric motor and the Presence of chaotic signal in feedback signal is proved by using several method such as time series, fourier spectrum phase portrait method.

  • PDF

자기 회귀 웨이블릿 신경 회로망을 이용한 혼돈 시스템의 일반형 예측 제어 (Generalized Predictive Control of Chaotic Systems Using a Self-Recurrent Wavelet Neural Network)

  • 유성진;최윤호;박진배
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
    • /
    • pp.421-424
    • /
    • 2003
  • This paper proposes the generalized predictive control(GPC) method of chaotic systems using a self-recurrent wavelet neural network(SRWNN). The reposed SRWNN, a modified model of a wavelet neural network(WNN), has the attractive ability such as dynamic attractor, information storage for later use. Unlike a WNN, since the SRWNN has the mother wavelet layer which is composed of self-feedback neurons, mother wavelet nodes of the SRWNN can store the past information of the network. Thus the SRWNN can be used as a good tool for predicting the dynamic property of nonlinear dynamic systems. In our method, the gradient-descent(GD) method is used to train the SRWNN structure. Finally, the effectiveness and feasibility of the SRWNN based GPC is demonstrated with applications to a chaotic system.

  • PDF

Structural damage detection based on Chaotic Artificial Bee Colony algorithm

  • Xu, H.J.;Ding, Z.H.;Lu, Z.R.;Liu, J.K.
    • Structural Engineering and Mechanics
    • /
    • 제55권6호
    • /
    • pp.1223-1239
    • /
    • 2015
  • A method for structural damage identification based on Chaotic Artificial Bee Colony (CABC) algorithm is presented. ABC is a heuristic algorithm with simple structure, ease of implementation, good robustness but with slow convergence rate. To overcome the shortcoming, the tournament selection mechanism is chosen instead of the roulette mechanism and chaotic search mechanism is also introduced. Residuals of natural frequencies and modal assurance criteria (MAC) are used to establish the objective function, ABC and CABC are utilized to solve the optimization problem. Two numerical examples are studied to investigate the efficiency and correctness of the proposed method. The simulation results show that the CABC algorithm can identify the local damage better compared with ABC and other evolutionary algorithms, even with noise corruption.

A DEVANEY-CHAOTIC MAP WITH POSITIVE ENTROPY ON A SYMBOLIC SPACE

  • Ramesh, Shankar Bangalore;Vasu, Chetana Urva
    • 대한수학회논문집
    • /
    • 제34권3호
    • /
    • pp.967-979
    • /
    • 2019
  • Chaotic dynamical systems, preferably on a Cantor-like space with some arithmetic operations are considered as good pseudo-random number generators. There are many definitions of chaos, of which Devaney-chaos and pos itive topological entropy seem to be the strongest. Let $A=\{0,1,{\dots},p-1\}$. We define a continuous map on $A^{\mathbb{Z}}$ using addition with a carry, in combination with the shift map. We show that this map gives rise to a dynamical system with positive entropy, which is also Devaney-chaotic: i.e., it is transitive, sensitive and has a dense set of periodic points.

WEAKLY ALMOST PERIODIC POINTS AND CHAOTIC DYNAMICS OF DISCRETE AMENABLE GROUP ACTIONS

  • Ling, Bin;Nie, Xiaoxiao;Yin, Jiandong
    • 대한수학회지
    • /
    • 제56권1호
    • /
    • pp.39-52
    • /
    • 2019
  • The aim of this paper is to introduce the notions of (quasi) weakly almost periodic point, measure center and minimal center of attraction of amenable group actions, explore the connections of levels of the orbit's topological structure of (quasi) weakly almost periodic points and study chaotic dynamics of transitive systems with full measure centers. Actually, we showed that weakly almost periodic points and quasiweakly almost periodic points have distinct orbit's topological structure and proved that there exists at least countable Li-Yorke pairs if the system contains a proper (quasi) weakly almost periodic point and that a transitive but not minimal system with a full measure center is strongly ergodically chaotic.

Image Encryption with The Cross Diffusion of Two Chaotic Maps

  • Jiao, Ge;Peng, Xiaojiang;Duan, Kaiwen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권2호
    • /
    • pp.1064-1079
    • /
    • 2019
  • Information security has become increasingly important with the rapid development of mobile devices and internet. An efficient encryption system is a key to this end. In this paper, we propose an image encryption method based on the cross diffusion of two chaotic maps. We use two chaotic sequences, namely the Logistic map and the Chebyshev map, for key generation which has larger security key space than single one. Moreover, we use these two sequences for further image encryption diffusion which decreases the correlation of neighboring pixels significantly. We conduct extensive experiments on several well-known images like Lena, Baboon, Koala, etc. Experimental results show that our algorithm has the characteristics of large key space, fast, robust to statistic attack, etc.

Binary Sequence Family for Chaotic Compressed Sensing

  • Lu, Cunbo;Chen, Wengu;Xu, Haibo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권9호
    • /
    • pp.4645-4664
    • /
    • 2019
  • It is significant to construct deterministic measurement matrices with easy hardware implementation, good sensing performance and good cryptographic property for practical compressed sensing (CS) applications. In this paper, a deterministic construction method of bipolar chaotic measurement matrices is presented based on binary sequence family (BSF) and Chebyshev chaotic sequence. The column vectors of these matrices are the sequences of BSF, where 1 is substituted with -1 and 0 is with 1. The proposed matrices, which exploit the pseudo-randomness of Chebyshev sequence, are sensitive to the initial state. The performance of proposed matrices is analyzed from the perspective of coherence. Theoretical analysis and simulation experiments show that the proposed matrices have limited influence on the recovery accuracy in different initial states and they outperform their Gaussian and Bernoulli counterparts in recovery accuracy. The proposed matrices can make the hardware implement easy by means of linear feedback shift register (LFSR) structures and numeric converter, which is conducive to practical CS.

An Image Encryption Scheme Based on Concatenated Torus Automorphisms

  • Mao, Qian;Chang, Chin-Chen;Wu, Hsiao-Ling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권6호
    • /
    • pp.1492-1511
    • /
    • 2013
  • A novel, chaotic map that is based on concatenated torus automorphisms is proposed in this paper. As we know, cat map, which is based on torus automorphism, is highly chaotic and is often used to encrypt information. But cat map is periodic, which decreases the security of the cryptosystem. In this paper, we propose a novel chaotic map that concatenates several torus automorphisms. The concatenated mechanism provides stronger chaos and larger key space for the cryptosystem. It is proven that the period of the concatenated torus automorphisms is the total sum of each one's period. By this means, the period of the novel automorphism is increased extremely. Based on the novel, concatenated torus automorphisms, two application schemes in image encryption are proposed, i.e., 2D and 3D concatenated chaotic maps. In these schemes, both the scrambling matrices and the iteration numbers act as secret keys. Security analysis shows that the proposed, concatenated, chaotic maps have strong chaos and they are very sensitive to the secret keys. By means of concatenating several torus automorphisms, the key space of the proposed cryptosystem can be expanded to $2^{135}$. The diffusion function in the proposed scheme changes the gray values of the transferred pixels, which makes the periodicity of the concatenated torus automorphisms disappeared. Therefore, the proposed cryptosystem has high security and they can resist the brute-force attacks and the differential attacks efficiently. The diffusing speed of the proposed scheme is higher, and the computational complexity is lower, compared with the existing methods.

충격력을 받는 구형 쉘의 혼돈거동 해석 (Chaotic Response of a Spherical Shell to Impulsive Loading)

  • 이재영;강영철
    • 전산구조공학
    • /
    • 제10권3호
    • /
    • pp.167-174
    • /
    • 1997
  • 계가 혼돈거동을 나타낼 경우에는 변수들의 미소변화에 의해서도 계가 전혀 다른 거동을 나타낼 수 있기 때문에 비선형계의 설계 및 해석시에는 이를 고려해야 한다. 따라서 본 연구에서는 구형 쉘의 중앙에 충격하중이 수직방향으로 작용하는 경우, 쉘의 기하학적 비선형성과 재료적 비선형성으로부터 기인되는 혼돈거동을 해석하였다. 쉘의 탄소성거동을 유한요소법을 이용하여 구한 후 계의 거동을 변위-시간이력, 프앙카레 맵, phase diagram등의 표준적인 방법들을 이용하여 쉘의 혼돈거동을 규명하였다. 해석결과, 계는 혼돈거동을 나타내었으나 탄소성보의 경우와는 달리 초기조건의 미소변화에 대한 극도의 민감도는 나타나지 않았으며 시간에 대한 쉘의 거동특성도 크게 변하지 않았다. 프앙카레 맵은 한정된 영역에 결쳐서 점들이 분포되었기 때문에 계의 거동이 혼돈거동임을 보여 주고 있지만 혼돈계의 프앙카레 맵에서 나타나는 기하학적 구조는 나타나지 않았다. 에너지선도를 이용하여 쉘이 하중의 작용방향 또는 반대방향으로 불규칙적으로 snap-through되는 원인을 규명하였다.

  • PDF