This paper deals with the F-compact operator defined on probabilistic Hilbert space and gives some of its main properties.

In this paper, we define some generalizations of topological group namely -topological group, -topological group and -topological group with illustrative examples. Also, we define grill topological group with respect to a grill. Later, we deliberate the quotient on generalizations of topological group in particular -topological group. Moreover, we model a robotic system which relays on the quotient of -topological group.

It is shown that if a subset of a topological space (χ, τ) is δ-semi.closed, then it is semi.closed. By use this fact, we introduce the concept regularity of a topological space (χ, τ) via δ-semi.open sets. Many properties and results were investigated and studied. In addition we study some maps that preserve the δ-semi.regularity of spaces.

The aim of this paper is to design a PID controller based on an on-line tuning bat optimization algorithm for the step-down DC/DC buck converter system which is used in the battery operation of the mobile applications. In this paper, the bat optimization algorithm has been utilized to obtain the optimal parameters of the PID controller as a simple and fast on-line tuning technique to get the best control action for the system. The simulation results using (Matlab Package) show the robustness and the effectiveness of the proposed control system in terms of obtaining a suitable voltage control action as a smooth and unsaturated state of the buck converter input voltage of ( ) volt that will stabilize the buck converter sys

    In this paper, the concept of soft closed groups is presented using the soft ideal pre-generalized open and soft pre-open, which are -ᶅ- - -closed sets " -closed", Which illustrating several characteristics of these groups.  We also use some games and   -  Separation Axiom, such as (Æ®_0, Ó¼, ᶅ) that use many tables and charts to illustrate this. Also, we put some proposals to study the relationship between these games and give some examples.

The main purpose of this paper is to introduce a some concepts in fibrewise bitopological spaces which are called fibrewise , fibrewise -closed, fibrewise −compact, fibrewise -perfect, fibrewise weakly -closed, fibrewise almost -perfect, fibrewise ∗-bitopological space respectively. In addition the concepts as - contact point, ij-adherent point, filter, filter base, ij-converges to a subset, ij-directed toward a set, -continuous, -closed functions, -rigid set, -continuous functions, weakly ijclosed, ij-H-set, almost ij-perfect, ∗-continuous, pairwise Urysohn space, locally ij-QHC bitopological space are introduced and the main concept in this paper is fibrewise -perfect bitopological spaces. Several theorems and characterizations c

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte