<p><span>This research deals with the feasibility of a mobile robot to navigate and discover its location at unknown environments, and then constructing maps of these navigated environments for future usage. In this work, we proposed a modified Extended Kalman Filter- Simultaneous Localization and Mapping (EKF-SLAM) technique which was implemented for different unknown environments containing a different number of landmarks. Then, the detectable landmarks will play an important role in controlling the overall navigation process and EKF-SLAM technique’s performance. MATLAB simulation results of the EKF-SLAM technique come with better performance as compared with an odometry approach performance in terms of measuring the

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n ＋ 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro

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

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

In this paper, membrane-based computing image segmentation, both region-based and edge-based, is proposed for medical images that involve two types of neighborhood relations between pixels. These neighborhood relations—namely, 4-adjacency and 8-adjacency of a membrane computing approach—construct a family of tissue-like P systems for segmenting actual 2D medical images in a constant number of steps; the two types of adjacency were compared using different hardware platforms. The process involves the generation of membrane-based segmentation rules for 2D medical images. The rules are written in the P-Lingua format and appended to the input image for visualization. The findings show that the neighborhood relations between pixels o