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.
Data-driven models perform poorly on part-of-speech tagging problems with the square Hmong language, a low-resource corpus. This paper designs a weight evaluation function to reduce the influence of unknown words. It proposes an improved harmony search algorithm utilizing the roulette and local evaluation strategies for handling the square Hmong part-of-speech tagging problem. The experiment shows that the average accuracy of the proposed model is 6%, 8% more than HMM and BiLSTM-CRF models, respectively. Meanwhile, the average F1 of the proposed model is also 6%, 3% more than HMM and BiLSTM-CRF models, respectively.
Feature selection (FS) constitutes a series of processes used to decide which relevant features/attributes to include and which irrelevant features to exclude for predictive modeling. It is a crucial task that aids machine learning classifiers in reducing error rates, computation time, overfitting, and improving classification accuracy. It has demonstrated its efficacy in myriads of domains, ranging from its use for text classification (TC), text mining, and image recognition. While there are many traditional FS methods, recent research efforts have been devoted to applying metaheuristic algorithms as FS techniques for the TC task. However, there are few literature reviews concerning TC. Therefore, a comprehensive overview was systematicall
... Show MoreThe evolution of the Internet of things (IoT) led to connect billions of heterogeneous physical devices together to improve the quality of human life by collecting data from their environment. However, there is a need to store huge data in big storage and high computational capabilities. Cloud computing can be used to store big data. The data of IoT devices is transferred using two types of protocols: Message Queuing Telemetry Transport (MQTT) and Hypertext Transfer Protocol (HTTP). This paper aims to make a high performance and more reliable system through efficient use of resources. Thus, load balancing in cloud computing is used to dynamically distribute the workload across nodes to avoid overloading any individual r
... Show MoreIn this paper, a cognitive system based on a nonlinear neural controller and intelligent algorithm that will guide an autonomous mobile robot during continuous path-tracking and navigate over solid obstacles with avoidance was proposed. The goal of the proposed structure is to plan and track the reference path equation for the autonomous mobile robot in the mining environment to avoid the obstacles and reach to the target position by using intelligent optimization algorithms. Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) Algorithms are used to finding the solutions of the mobile robot navigation problems in the mine by searching the optimal paths and finding the reference path equation of the optimal
... Show More
In this work, the modified Lyapunov-Schmidt reduction is used to find a nonlinear Ritz approximation of Fredholm functional defined by the nonhomogeneous Camassa-Holm equation and Benjamin-Bona-Mahony. We introduced the modified Lyapunov-Schmidt reduction for nonhomogeneous problems when the dimension of the null space is equal to two. The nonlinear Ritz approximation for the nonhomogeneous Camassa-Holm equation has been found as a function of codimension twenty-four.
At the level of both individuals and companies, Wireless Sensor Networks (WSNs) get a wide range of applications and uses. Sensors are used in a wide range of industries, including agriculture, transportation, health, and many more. Many technologies, such as wireless communication protocols, the Internet of Things, cloud computing, mobile computing, and other emerging technologies, are connected to the usage of sensors. In many circumstances, this contact necessitates the transmission of crucial data, necessitating the need to protect that data from potential threats. However, as the WSN components often have constrained computation and power capabilities, protecting the communication in WSNs comes at a significant performance pena
... Show MoreThe influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic
... Show MoreThe main objective of this paper is to designed algorithms and implemented in the construction of the main program designated for the determination the tenser product of representation for the special linear group.
Intrusion detection system is an imperative role in increasing security and decreasing the harm of the computer security system and information system when using of network. It observes different events in a network or system to decide occurring an intrusion or not and it is used to make strategic decision, security purposes and analyzing directions. This paper describes host based intrusion detection system architecture for DDoS attack, which intelligently detects the intrusion periodically and dynamically by evaluating the intruder group respective to the present node with its neighbors. We analyze a dependable dataset named CICIDS 2017 that contains benign and DDoS attack network flows, which meets certifiable criteria and is ope
... Show More