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
Thu Nov 01 2012
Journal Name
2012 International Conference On Advanced Computer Science Applications And Technologies (acsat)
Data Missing Solution Using Rough Set theory and Swarm Intelligence
...Show More Authors

This paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima

... Show More
View Publication Preview PDF
Scopus (7)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Mon May 21 2007
Journal Name
Journal Of Planner And Development
Towards a decentralized planning policy in Iraq
...Show More Authors

Iraq is changing from the centralized system of governance to the decentralized system, which assumes devolution of more authorities to the local governments of Iraqi provinces and cities. This puts a responsibility on the academics to produce more research work on the best framework for this change, to ensure the best results. The main objective of this research is to suggest a policy for the decentralized transformation in domain of Urban and Regional Planning in Iraq. A suggested program for the transformation is involved in the paper as well, with analysis for the new relationships between different levels of planning authorities depending on democracy. In addition, a description for planning process flows from bottom to top.

View Publication Preview PDF
Publication Date
Thu Apr 30 2026
Journal Name
International Journal Of Engineering Pedagogy (ijep)
The Impact of Intelligent Adaptive Learning on Flexible Thinking and Academic Achievement for Undergraduate Students
...Show More Authors

In the knowledge society, artificial intelligence (AI) forms a cornerstone of global education. This quasi-experimental study examines the impact of an Intelligent Adaptive Learning Strategy (IALS) on flexible thinking (FT) and academic achievement among 60 3rd-year undergraduate students at the College of Education/University of Baghdad (experimental n = 30; control n = 30). The IALS was implemented via an AI-supported educational platform, while the control group received conventional instruction. Post-test intervention assessments included an FT test (10 items, content validity = 0.89, Cronbach’s α = 0.87) and an achievement test (10 objective items, α = 0.85). Results revealed statistically significant superiority of the exp

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Mon Feb 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Features of genetic algorithm for plain text encryption
...Show More Authors

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

... Show More
View Publication
Scopus (15)
Crossref (4)
Scopus Crossref
Publication Date
Sun Jun 20 2021
Journal Name
Baghdad Science Journal
Multifactor Algorithm for Test Case Selection and Ordering
...Show More Authors

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Thu Dec 01 2011
Journal Name
2011 Developments In E-systems Engineering
Enhanced Computation Time for Fast Block Matching Algorithm
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Symmetry
Fast Overlapping Block Processing Algorithm for Feature Extraction
...Show More Authors

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

... Show More
View Publication
Scopus (29)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Fri Sep 03 2021
Journal Name
Entropy
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
...Show More Authors

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

... Show More
View Publication
Scopus (36)
Crossref (32)
Scopus Clarivate Crossref
Publication Date
Thu Mar 30 2023
Journal Name
Journal Of Economics And Administrative Sciences
Using the Critical Path Method to Find Time of Constriction for Helicopters Airport Project in the Oil Fields
...Show More Authors

This research is considered one of the important researches in Maysan Governorate, as it focuses on the construction of helicopter airport project in the oil fields of the Maysan Oil Company, where the oil general companies in Maysan Governorate suffer from the cost of transporting the foreign engineering experts and the governing equipment of sustaining oil industry from Iraq's international airports to oil fields and vice versa. Private international transport companies transport foreign engineering from the oil fields to Iraqi airports and vice versa, and other international security companies take action to provide protection for foreign engineering experts during transportation. Hence, this process is very costly.

 &nbs

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Apr 01 2016
Journal Name
Journal Of Economics And Administrative Sciences
THE USE OF SIMULATION AND LINEAR PROGRAMMING IN THE PLANNING OF AUDIT WORK (An Empirical Study in the Office of Financial Supervision)
...Show More Authors

Research includes three axes, the first is the average estimate time of achievement (day) to work oversight, to five supervisory departments in the Office of Financial Supervision Federal and then choose the three control outputs and at the level of each of the five departments above, and after analyzing the data statistically back to us that the distribution of the times of achievement It is the exponential distribution (Exponential Distribution) a parameter (q), and the distribution of normal (Normal Distribution) with two parameters (μ, σ2), and introduced four methods of parameter estimation (q) as well as four modalities parameter to estimate (

... Show More
View Publication Preview PDF
Crossref