Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the problems that are related to the optimization. This study presents a new adaptive distributed algorithm of routing on CSA. Because the search space may be modified according to the size and kind of the network, the algorithm can be easily customized to the issue space. In contrast to population-based algorithms that have a broad and time-consuming search space. For ten networks of various sizes, the technique was used to solve the shortest path issue. And its capability for solving the problem of the routing in the switched networks is examined: detecting the shortest path in the process of a data packet transfer amongst the networks. The suggested method was compared with four common metaheuristic algorithms (which are: ACO, AHA, PSO and GA) on 10 datasets (integer, weighted, and not negative graphs) with a variety of the node sizes (10 - 297 nodes). The results have proven that the efficiency of the suggested methods is promising as well as competing with other approaches.
A Wearable Robotic Knee (WRK) is a mobile device designed to assist disabled individuals in moving freely in undefined environments without external support. An advanced controller is required to track the output trajectory of a WRK device in order to resolve uncertainties that are caused by modeling errors and external disturbances. During the performance of a task, disturbances are caused by changes in the external load and dynamic work conditions, such as by holding weights while performing the task. The aim of this study is to address these issues and enhance the performance of the output trajectory tracking goal using an adaptive robust controller based on the Radial Basis Function (RBF) Neural Network (NN) system and Hamilton
... Show MoreThis paper presents L1-adaptive controller for controlling uncertain parameters and time-varying unknown parameters to control the position of a DC servomotor. For the purpose of comparison, the effectiveness of L1-adaptive controller for position control of studied servomotor has been examined and compared with another adaptive controller; Model Reference Adaptive Controller (MRAC). Robustness of both L1-adaptive controller and model reference adaptive controller to different input reference signals and different structures of uncertainty were studied. Three different types of input signals are taken into account; ramp, step and sinusoidal. The L1-adaptive controller ensured uniformly bounded
... Show MoreAerial Robot Arms (ARAs) enable aerial drones to interact and influence objects in various environments. Traditional ARA controllers need the availability of a high-precision model to avoid high control chattering. Furthermore, in practical applications of aerial object manipulation, the payloads that ARAs can handle vary, depending on the nature of the task. The high uncertainties due to modeling errors and an unknown payload are inversely proportional to the stability of ARAs. To address the issue of stability, a new adaptive robust controller, based on the Radial Basis Function (RBF) neural network, is proposed. A three-tier approach is also followed. Firstly, a detailed new model for the ARA is derived using the Lagrange–d’A
... Show MoreA particle swarm optimization algorithm and neural network like self-tuning PID controller for CSTR system is presented. The scheme of the discrete-time PID control structure is based on neural network and tuned the parameters of the PID controller by using a particle swarm optimization PSO technique as a simple and fast training algorithm. The proposed method has advantage that it is not necessary to use a combined structure of identification and decision because it used PSO. Simulation results show the effectiveness of the proposed adaptive PID neural control algorithm in terms of minimum tracking error and smoothness control signal obtained for non-linear dynamical CSTR system.
This paper has the interest of finding the approximate solution (APPS) of a nonlinear variable coefficients hyperbolic boundary value problem (NOLVCHBVP). The given boundary value problem is written in its discrete weak form (WEFM) and proved have a unique solution, which is obtained via the mixed Galerkin finite element with implicit method that reduces the problem to solve the Galerkin nonlinear algebraic system (GNAS). In this part, the predictor and the corrector techniques (PT and CT, respectively) are proved at first convergence and then are used to transform the obtained GNAS to a linear GLAS . Then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are stud
... Show MoreUrsolic acid (UA, 3 ?-hydroxy-urs-12-en-28-oic acid) are isomeric triterpenic acids. The high quantities of pentacyclic triterpenoids in Scabiosa species seems to be obvious and there is an evidence that most of pentacyclic triterpenoids that have been isolated are saponins. This is one of the most important characteristic of the genus Scabiosa, the main aglycones are ursolic acid and oleanolic acid. In the current study, isolation from the aerial part and roots of Scabiosa palaestina L. was performed using Preparative HPLC. Furthermore, detection and quantitation of ursolic acid was performed by high performance thin layer chromatography (HPTLC). The identification of isolated triterpenoid involves two methods including FT-IR coupl
... Show MoreFuture generations of wireless networks are expected to heavily rely on unmanned aerial vehicles (UAVs). UAV networks have extraordinary features like high mobility, frequent topology change, tolerance to link failure, and extending the coverage area by adding external UAVs. UAV network provides several advantages for civilian, commercial, search and rescue applications. A realistic mobility model must be used to assess the dependability and effectiveness of UAV protocols and algorithms. In this research paper, the performance of the Gauss Markov (GM) and Random Waypoint (RWP) mobility models in multi-UAV networks for a search and rescue scenario is analyzed and evaluated. Additionally, the two mobility models GM and RWP are descr
... Show MoreThe main aim of this paper is to apply a new technique suggested by Temimi and Ansari namely (TAM) for solving higher order Integro-Differential Equations. These equations are commonly hard to handle analytically so it is request numerical methods to get an efficient approximate solution. Series solutions of the problem under consideration are presented by means of the Iterative Method (IM). The numerical results show that the method is effective, accurate and easy to implement rapidly convergent series to the exact solution with minimum amount of computation. The MATLAB is used as a software for the calculations.
Market share is a major indication of business success. Understanding the impact of numerous economic factors on market share is critical to a company’s success. In this study, we examine the market shares of two manufacturers in a duopoly economy and present an optimal pricing approach for increasing a company’s market share. We create two numerical models based on ordinary differential equations to investigate market success. The first model takes into account quantity demand and investment in R&D, whereas the second model investigates a more realistic relationship between quantity demand and pricing.
The aim of this paper is to study the nonlinear delay second order eigenvalue problems which consists of delay ordinary differential equations, in fact one of the expansion methods that is called the least square method which will be developed to solve this kind of problems.