Preferred Language
Articles
/
joe-195
An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning
...Show More Authors

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 order to evaluate the proposed algorithm in term of finding the best solution, six benchmark test functions are used to make a comparison between AMOPSO and the standard MOPSO. The results show that the AMOPSO has a better ability to get away from local optimums with a quickest convergence than the MOPSO. The simulation results using Matlab 2014a, indicate that this methodology is extremely valuable for every robot in multi-robot framework to discover its own particular proper pa‌th from the start to the destination position with minimum distance and time.

 

 

View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat Dec 30 2023
Journal Name
Wasit Journal For Pure Sciences
Honeywords Generation Technique based on Meerkat Clan Algorithm and WordNet
...Show More Authors

The efficiency of the Honeywords approach has been proven to be a significant tool for boosting password security. The suggested system utilizes the Meerkat Clan Algorithm (MCA) in conjunction with WordNet to produce honeywords, thereby enhancing the level of password security. The technique of generating honeywords involves data sources from WordNet, which contributes to the improvement of authenticity and diversity in the honeywords. The method encompasses a series of consecutive stages, which include the tokenization of passwords, the formation of alphabet tokens using the Meerkat Clan Algorithm (MCA), the handling of digit tokens, the creation of unique character tokens, and the consolidation of honeywords. The optimization of t

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Human Pose Estimation Algorithm Using Optimized Symmetric Spatial Transformation Network
...Show More Authors

Human posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can pre

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Thu Feb 01 2024
Journal Name
Ain Shams Engineering Journal
Performance enhancement of high degree Charlier polynomials using multithreaded algorithm
...Show More Authors

View Publication
Scopus (7)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Tue Nov 17 2015
Journal Name
International Journal Of Computer Applications
Categorization of ‘Holy Quran-Tafseer’ using K-Nearest Neighbor Algorithm
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Thu Mar 01 2018
Journal Name
Journal Of Engineering
Flexible Genetic Algorithm Based Optimal Power Flow of Power Systems
...Show More Authors

Nowadays, the power plant is changing the power industry from a centralized and vertically integrated form into regional, competitive and functionally separate units. This is done with the future aims of increasing efficiency by better management and better employment of existing equipment and lower price of electricity to all types of customers while retaining a reliable system. This research is aimed to solve the optimal power flow (OPF) problem. The OPF is used to minimize the total generations fuel cost function. Optimal power flow may be single objective or multi objective function. In this thesis, an attempt is made to minimize the objective function with keeping the voltages magnitudes of all load buses, real outp

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Mar 08 2021
Journal Name
Baghdad Science Journal
Development of six-degree of freedom strapdown terrestrial INS algorithm
...Show More Authors

Many of accurate inertial guided missilc systems need to use more complex mathematical calculations and require a high speed processing to ensure the real-time opreation. This will give rise to the need of developing an effcint

View Publication Preview PDF
Publication Date
Wed Jun 01 2022
Journal Name
Journal Of King Saud University - Computer And Information Sciences
Heuristic initialization of PSO task scheduling algorithm in cloud computing
...Show More Authors

View Publication
Scopus (179)
Crossref (131)
Scopus Clarivate Crossref
Publication Date
Sun Nov 01 2020
Journal Name
Iop Conference Series
Modified PRESENT Encryption algorithm based on new 5D Chaotic system
...Show More Authors

Cryptography is a major concern in communication systems. IoE technology is a new trend of smart systems based on various constrained devices. Lightweight cryptographic algorithms are mainly solved the most security concern of constrained devices and IoE systems. On the other hand, most lightweight algorithms are suffering from the trade-off between complexity and performance. Moreover, the strength of the cryptosystems, including the speed of the algorithm and the complexity of the system against the cryptanalysis. A chaotic system is based on nonlinear dynamic equations that are sensitive to initial conditions and produce high randomness which is a good choice for cryptosystems. In this work, we proposed a new five-dimensional of a chaoti

... Show More
Scopus (13)
Crossref (8)
Scopus Crossref
Publication Date
Mon Aug 01 2022
Journal Name
Mathematics
Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments
...Show More Authors

Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima

... Show More
View Publication
Scopus (34)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Mon May 01 2017
Journal Name
Australian Journal Of Basic And Applied Sciences
Sprite Region Allocation Using Fast Static Sprite Area Detection Algorithm
...Show More Authors

Background: Sprite coding is a very effective technique for clarifying the background video object. The sprite generation is an open issue because of the foreground objects which prevent the precision of camera motion estimation and blurs the created sprite. Objective: In this paper, a quick and basic static method for sprite area detection in video data is presented. Two statistical methods are applied; the mean and standard deviation of every pixel (over all group of video frame) to determine whether the pixel is a piece of the selected static sprite range or not. A binary map array is built for demonstrating the allocated sprite (as 1) while the non-sprite (as 0) pixels valued. Likewise, holes and gaps filling strategy was utilized to re

... Show More
View Publication Preview PDF