Ahmad Merei

Dr. Ahmad Merei

Department of Computer Science and Mathematics, Université du Québec à Chicoutimi, Saguenay, Quebec, Canada
orcid
PostDoc |Ph.D. in Computer Science | UAV Path Planning | Obs...

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 July 2020 in Sensors
Verified
Journal Article
Open access
PDF file
AGAlia Ghaddar
Alia Ghaddar
Ahmad MereiAhmad Merei
Ahmad Merei
Enrico NatalizioEnrico Natalizio
Enrico Natalizio
Area monitoring and surveillance are some of the main applications for Unmanned Aerial Vehicle (UAV) networks. The scientific problem that arises from this application concerns the way the area must be covered to fulfill the mission requirements. One of the main challenges is to determine the paths for the UAVs that optimize the usage of resources while minimizing the mission time. Different approaches rely on area partitioning strategies. Depending on the size and complexity of the area to monitor, it is possible to decompose it exactly or approximately. This paper proposes a partitioning method called Parallel Partitioning along a Side (PPS). In the proposed method, grid-mapping and grid-subdivision of the area, as well as area partitioning are performed to plan the UAVs path. An extra challenge, also tackled in this work, is the presence of non-flying zones (NFZs). These zones are areas that UAVs must not cover or pass over it. The proposal is extensively evaluated, in comparison with existing approaches, to show that it enables UAVs to plan paths with minimum energy consumption, number of turns and completion time while at the same time increases the quality of coverage.

12 March 2025 in Drones
Verified
Journal Article
Open access
PDF file
Ahmad MereiAhmad Merei
Ahmad Merei
Hamid McheickHamid Mcheick
Hamid Mcheick
AGAlia Ghaddar
Alia Ghaddar
DRDjamal Rebaine
Djamal Rebaine
Obstacle avoidance is crucial for the successful completion of UAV missions. Static and dynamic obstacles, such as trees, buildings, flying birds, or other UAVs, can threaten these missions. As a result, safe path planning is essential, particularly for missions involving multiple UAVs. Collision-free paths can be designed in either 2D or 3D environments, depending on the scenario. This study provides an overview of recent advancements in obstacle avoidance and path planning for UAVs. These methods are compared based on various criteria, including avoidance techniques, obstacle types, the environment explored, sensor equipment, map types, and path statuses. Additionally, this paper includes a process addressing obstacle detection and avoidance and reviews the evolution of obstacle detection and avoidance (ODA) techniques in UAVs over the past decade.

8 February 2020 in Future Internet
Verified
Journal Article
Open access
PDF file
AGAlia Ghaddar
Alia Ghaddar
Ahmad MereiAhmad Merei
Ahmad Merei
The presence of obstacles like a tree, buildings, or birds along the path of a drone has the ability to endanger and harm the UAV’s flight mission. Avoiding obstacles is one of the critical challenging keys to successfully achieve a UAV’s mission. The path planning needs to be adapted to make intelligent and accurate avoidance online and in time. In this paper, we propose an energy-aware grid based solution for obstacle avoidance (EAOA). Our work is based on two phases: in the first one, a trajectory path is generated offline using the area top-view. The second phase depends on the path obtained in the first phase. A camera captures a frontal view of the scene that contains the obstacle, then the algorithm determines the new position where the drone has to move to, in order to bypass the obstacle. In this paper, the obstacles are static. The results show a gain in energy and completion time using 3D scene information compared to 2D scene information.

27 July 2023 in Journal of Medical Systems
Verified
Journal Article
Closed access
PDF file
Ahmad MereiAhmad Merei
Ahmad Merei
Hamid McheickHamid Mcheick
Hamid Mcheick
AGAlia Ghaddar
Alia Ghaddar

25 November 2025 in Procedia Computer Science
Verified
Journal Article
Open access
Ahmad MereiAhmad Merei
Ahmad Merei
HMHamid Mcheick
Hamid Mcheick
AGAlia Ghaddar
Alia Ghaddar
GBGiovanni Beltrame
Giovanni Beltrame

12 March 2026 in IEEE Access
Verified
Journal Article
Open access
Ahmad MereiAhmad Merei
Ahmad Merei
Hamid McheickHamid Mcheick
Hamid Mcheick
AGAlia Ghaddar
Alia Ghaddar
GBGiovanni Beltrame
Giovanni Beltrame
Uncrewed Aerial Vehicles (UAVs) have become increasingly vital in various missions due to their ability to access remote and hazardous environments. Effective deployment of UAVs in time-sensitive and energy-constrained missions requires effective path planning. These strategies must maximize mission utility while operating within strict energy and time budgets. This paper introduces an Energy-Aware Informative Path Planning algorithm (EA-IPP2n) that functions as a pre-mission planner, generating the UAV’s flight path prior to deployment. The algorithm simultaneously accounts for both distance and turning angle costs. This enables the UAVs to plan efficient paths in terms of energy consumption and completion time in reward-driven environments. The method models the environment as a graph of nodes that represent locations of interest with associated rewards. EA-IPP2n employs a two-hop look-ahead mechanism, in which the planner evaluates pairs of consecutive moves before committing to the next step, to prioritize high-reward while accounting for both budgets. Simulations show improved performance over baseline methods, including Hierarchical Informative Path Planning (HIPP), Multiple-UAV Informative Path Planning and Mapping (MIPP), Ant Colony Optimization (ACO), Genetic Algorithm (GA), Monte Carlo Tree Search (MCTS), and Greedy Search. EA-IPP2n achieved the highest total rewards (24.9 ± 3.6), exceeding the baseline algorithms by relative margins between 11% and 66%, while fully satisfying both time and energy constraints across all missions. It also achieves the highest mission performance score (0.380 ± 0.041), with an improvement of approximately 11% compared to the best-performing baseline, and relative gains between 11% and 57% across all evaluated algorithms. Furthermore, EA-IPP2n strictly respected both budgets in 100% of missions. While the time budget was enforced for all algorithms, only the enforced dual-budget formulation enabled HIPP and MIPP to satisfy both constraints in all cases. Greedy and GA violated the energy budget in all missions, and MCTS exceeded its limit in 40% of missions. In contrast, ACO, despite being heuristic and less informed, maintained full energy compliance. Thus, EA-IPP2n was the only method that achieved complete dual-budget compliance while maintaining the highest total reward performance.