planning is among the most significant in the field of robotics research.  As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the

Background: The isthmus is a difficult area in the root canal complex to manage. The research aimed to evaluate the efficiency of three different obturation techniques (lateral condensation, EandQ (thermoplasticized gutta percha system) and Soft Core (thermoplasticized core carrier gutta percha system)) to obturate the isthmus area of roots prepared by two different instrumentation techniques (rotary ProTaper universal and ProTaper Next systems). Material and method: Sixty freshly extracted teeth were randomly divided into two main groups (A and B) of 30 teeth each. Group A was prepared by rotary ProTaper Universal whereas group B was prepared by ProTaper Next system. Each main group was then randomly subdivided into three subgroups of 10 t

This study was design to investigate the dimensional stability of heat-activated acrylic resin with different methods of flask cooling (15 minutes rapid cooling, one hour bench cooling, four hours delayed deflasking, and 24 hours delayed deflasking) at different time intervals (immediately, two days, seven days, 30 days) after deflasking. Heat-activated acrylic resin was used to prepare acrylic samples. Then, measurement of the distances where achieved between the centers of selected marks in the acrylic samples. They were measured at different time intervals for different methods of flask cooling. The results showed that the group samples of the four hours and 24 hours of delayed deflasking was insignificantly different from the control an

This paper considers approximate solution of the hyperbolic one-dimensional wave equation with nonlocal mixed boundary conditions by improved methods based on the assumption that the solution is a double power series based on orthogonal polynomials, such as Bernstein, Legendre, and Chebyshev. The solution is ultimately compared with the original method that is based on standard polynomials by calculating the absolute error to verify the validity and accuracy of the performance.

This paper introduces a non-conventional approach with multi-dimensional random sampling to solve a cocaine abuse model with statistical probability. The mean Latin hypercube finite difference (MLHFD) method is proposed for the first time via hybrid integration of the classical numerical finite difference (FD) formula with Latin hypercube sampling (LHS) technique to create a random distribution for the model parameters which are dependent on time [Formula: see text]. The LHS technique gives advantage to MLHFD method to produce fast variation of the parameters’ values via number of multidimensional simulations (100, 1000 and 5000). The generated Latin hypercube sample which is random or non-deterministic in nature is further integ

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the