The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matrices are obtained by the Lyapunov-like design. Therefore, this work is focused function approximation-based control algorithms considering centralized and decentralized approaches. In this work, the following control algorithms are designed: (1) Adaptive hybrid regressor-approximation control. This work attempts to combine the features of both the regressor and the approximation techniques in adaptive control. The regressor technique is a powerful tool for adaptive control of the known structure of modeling while the approximation is useful for estimation of time-varying uncertainty. Therefore, this work proposes adaptive hybrid regressor and approximation control for robots in both free and constrained spaces. The control law consists of three terms: (i) regressor term for initial estimation of the known structure of the robot dynamics, e.g. inertia matrix, Coriolis and centripetal matrix and gravity vector, and (ii) approximation term for estimation of internal and external disturbances resulted from the inexact calculation of regressor matrix and unknown modeling of friction, etc, and (iii) robust term consists of switching sgn(.) function. The control law is designed based on updating the uncertain parameters and the weighting coefficients corresponding to regressor and approximation respectively with position/force tracking purposes. The proposed controller is stable in the sense of Lyapunov stability. (2) Decentralized adaptive partitioned approximation control. Partitioned approximation control is avoided in most decentralized control algorithms; however, it is essential to design feedforward control with improved tracking accuracy. As a result, this work is focused on decentralized adaptive partitioned approximation control for complex robotic systems using the orthogonal basis functions as strong approximators. In essence, the partitioned approximation technique is intrinsically decentralized with some modifications. The proposed decentralized control law consists of three terms: the partitioned approximation-based feedforward term that is necessary for precise tracking, the high gain-based feedback term, and the adaptive sliding gain-based term for compensation of modeling error. The passivity property is essential to prove the stability of local stability of the individual subsystem with guaranteed global stability. Simulation experiments on 2-link robot and 6-link biped robot are performed to prove the effectiveness of the proposed algorithms.
Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o
... Show MoreTexture synthesis using genetic algorithms is one way; proposed in the previous research, to synthesis texture in a fast and easy way. In genetic texture synthesis algorithms ,the chromosome consist of random blocks selected manually by the user .However ,this method of selection is highly dependent on the experience of user .Hence, wrong selection of blocks will greatly affect the synthesized texture result. In this paper a new method is suggested for selecting the blocks automatically without the participation of user .The results show that this method of selection eliminates some blending caused from the previous manual method of selection.
With the revolutionized expansion of the Internet, worldwide information increases the application of communication technology, and the rapid growth of significant data volume boosts the requirement to accomplish secure, robust, and confident techniques using various effective algorithms. Lots of algorithms and techniques are available for data security. This paper presents a cryptosystem that combines several Substitution Cipher Algorithms along with the Circular queue data structure. The two different substitution techniques are; Homophonic Substitution Cipher and Polyalphabetic Substitution Cipher in which they merged in a single circular queue with four different keys for each of them, which produces eight different outputs for
... Show MoreL1 adaptive controller has proven to provide fast adaptation with guaranteed transients in a large variety of systems. It is commonly used for controlling systems with uncertain time-varying unknown parameters. The effectiveness of L1 adaptive controller for position control of single axis has been examined and compared with Model Reference Adaptive Controller (MRAC). The Linear servo motor is one of the main constituting elements of the x-y table which is mostly used in automation application. It is characterized by time-varying friction and disturbance.
The tracking and steady state performances of both controllers have been assessed fo
... Show MoreA multidimensional systolic arrays realization of LMS algorithm by a method of mapping regular algorithm onto processor array, are designed. They are based on appropriately selected 1-D systolic array filter that depends on the inner product sum systolic implementation. Various arrays may be derived that exhibit a regular arrangement of the cells (processors) and local interconnection pattern, which are important for VLSI implementation. It reduces latency time and increases the throughput rate in comparison to classical 1-D systolic arrays. The 3-D multilayered array consists of 2-D layers, which are connected with each other only by edges. Such arrays for LMS-based adaptive (FIR) filter may be opposed the fundamental requirements of fa
... Show MoreThe drill bit is the most essential tool in drilling operation and optimum bit selection is one of the main challenges in planning and designing new wells. Conventional bit selections are mostly based on the historical performance of similar bits from offset wells. In addition, it is done by different techniques based on offset well logs. However, these methods are time consuming and they are not dependent on actual drilling parameters. The main objective of this study is to optimize bit selection in order to achieve maximum rate of penetration (ROP). In this work, a model that predicts the ROP was developed using artificial neural networks (ANNs) based on 19 input parameters. For the