Abstract. In this paper, a high order extended state observer (HOESO) based a sliding mode control (SMC) is proposed for a flexible joint robot (FJR) system in the presence of time varying external disturbance. A composite controller is integrated the merits of both HOESO and SMC to enhance the tracking performance of FJR system under the time varying and fast lumped disturbance. First, the HOESO estimator is constructed based on only one measured state to precisely estimate unknown system states and lumped disturbance with its high order derivatives in the FJR system. Second, the SMC scheme is designed based on such accurate estimations to govern the nominal FJR system by well compensating the estimation errors in the states and the lumped

The flexible joint robot (FJR) typically experiences parametric variations, nonlinearities, underactuation, noise propagation, and external disturbances which seriously degrade the FJR tracking. This article proposes an adaptive integral sliding mode controller (AISMC) based on a singular perturbation method and two state observers for the FJR to achieve high performance. First, the underactuated FJR is modeled into two simple second-order fast and slow subsystems by using Olfati transformation and singular perturbation method, which handles underactuation while reducing noise amplification. Then, the AISMC is proposed to effectively accomplish the desired tracking performance, in which the integral sliding surface is designed to reduce cha

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates