Fatma Ali Saad Alwafi

Dr. Fatma Ali Saad Alwafi


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
16 April 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
FAFatma Ali Saad Alwafi
Fatma Ali Saad Alwafi
XXXu Xu
Xu Xu
RSReza Saatchi
Reza Saatchi
Lyuba AlboulLyuba Alboul
Lyuba Alboul
A new multi-robot path planning algorithm (MRPPA) for 2D static environments is developed and evaluated. It combines a roadmap method, utilising the visibility graph (VG), with the algebraic connectivity (second smallest eigenvalue (λ2)) of the graph’s Laplacian and Dijkstra's algorithm. The paths depend on the planning order, i.e., they are in sequence path-by-path, based on the measured values of algebraic connectivity of the graph’s Laplacian and the determined weights functions. Algebraic connectivity maintains robust communication between the robots during their movements while avoiding collision. The algorithm efficiently balanced connectivity maintenance and path length minimisation thus improving the performance of path finding. It produced solutions with optimal paths, i.e., the shortest and safest route. The devised MRPPA significantly improved path length efficiency across different configurations. The results demonstrated a highly efficient and robust solution for multi-robot systems requiring both optimal path planning and reliable connectivity, making it well-suited in scenarios where communication between robots is necessary. Simulation results demonstrated the performance of the proposed algorithm in balancing the path optimality and network connectivity across multiple static environments with varying complexities. The algorithm is suitable for identifying optimal and complete collision-free paths. The results illustrated the algorithm's effectiveness, computational efficiency, and adaptability.

23 May 2025 in Information
Verified
Journal Article
Open access
PDF file
FAFatma Ali Saad Alwafi
Fatma Ali Saad Alwafi
XXXu Xu
Xu Xu
RSReza Saatchi
Reza Saatchi
Lyuba AlboulLyuba Alboul
Lyuba Alboul
A new multi-robot path planning (MRPP) algorithm for 2D static environments was developed and evaluated. It combines a roadmap method, utilising the visibility graph (VG), with the algebraic connectivity (second smallest eigenvalue (λ2)) of the graph’s Laplacian and Dijkstra’s algorithm. The paths depend on the planning order, i.e., they are in sequence path-by-path, based on the measured values of algebraic connectivity of the graph’s Laplacian and the determined weight functions. Algebraic connectivity maintains robust communication between the robots during their navigation while avoiding collisions. The algorithm efficiently balances connectivity maintenance and path length minimisation, thus improving the performance of path finding. It produced solutions with optimal paths, i.e., the shortest and safest route. The devised MRPP algorithm significantly improved path length efficiency across different configurations. The results demonstrated highly efficient and robust solutions for multi-robot systems requiring both optimal path planning and reliable connectivity, making it well-suited in scenarios where communication between robots is necessary. Simulation results demonstrated the performance of the proposed algorithm in balancing the path optimality and network connectivity across multiple static environments with varying complexities. The algorithm is suitable for identifying optimal and complete collision-free paths. The results illustrate the algorithm’s effectiveness, computational efficiency, and adaptability.

30 May 2026 in Technologies
Verified
Journal Article
Open access
PDF file
FAFatma Ali Saad Alwafi
Fatma Ali Saad Alwafi
RSReza Saatchi
Reza Saatchi
Path planning is critical for multi-robot systems (MRS), directly affecting the operation efficiency, execution time, and operational cost. Despite extensive research and successful applications of multiple algorithms, achieving globally optimal solutions in cluttered or dynamic environments remains a significant challenge. Issues such as scalability with an increasing number of robots, computational efficiency, system robustness, and coordination complexity continue to drive the development of more reliable approaches. This study reviews modelling approaches, optimisation criteria, and solution algorithms based on the roadmap planning methods that are widely used for multi-robot path planning (MRPP). It focuses on three graph-based algorithms: MRPP algorithm, central algorithm (CA), and the optimisation central algorithm (OCA). These algorithms utilise visibility graphs (VG) for environment representation and Dijkstra’s algorithm for shortest path computation, while incorporating algebraic connectivity to improve coordination, safety, and scalability. In addition, the technological context and implementation platforms, including simulation environments, cloud robotics, and AI-based frameworks, are conceptually examined. The potential applications of these methods in assistive robotics are highlighted, particularly in supporting a safe and reliable navigation in healthcare and human-centred environments. The article synthesises theoretical and practical insights, identifies current limitations and challenges, and outlines future research directions for efficient, scalable, and robust MRPP.

7 April 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
FAFatma Ali Saad Alwafi
Fatma Ali Saad Alwafi
RSReza Saatchi
Reza Saatchi
Path planning is critical for multi-robot systems (MRS), directly affecting task efficiency, execution time and operational cost. Despite extensive research and the successful application of numerous algorithms, achieving globally optimal solutions in cluttered or dynamic environments remains a significant challenge. Issues such as scalability with in-creasing numbers of robots, computational efficiency, system robustness, and coordination complexity continue to drive the development of more reliable approaches. This study reviews modelling approaches, optimisation criteria, and solution algorithms based on roadmap planning methods that are widely used for multi-robot path planning (MRPP). It focuses on three graph-based algorithms: Multi-Robot Path Planning algorithm, Central Algorithm (CA), and the Optimisation Central Algorithm (OCA). These algorithms utilise visibility graphs (VG) for environment representation and the Dijkstra’s algorithm for shortest-path computation, while incorporating algebraic connectivity to improve coordination, safety and scalability. In addition, the technological context and implementation platforms, including simulation environments, cloud robotics, and AI-based frameworks, are conceptually examined. The potential applications of these methods in assistive robotics are highlighted, particularly in supporting safe and reliable navigation in healthcare and human-centered environments. The paper synthesises theoretical and practical insights, identifies current limitations and challenges, and outlines future re-search directions for efficient, scalable and robust MRPP.

15 March 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
FAFatma Ali Saad Alwafi
Fatma Ali Saad Alwafi
RSReza Saatchi
Reza Saatchi
XXXu Xu
Xu Xu
Lyuba AlboulLyuba Alboul
Lyuba Alboul
A comprehensive analysis of three graph-theoretic path planning algorithms designed for multi-robotic systems (MRS) was undertaken. The algorithms were the multi-robot path planning algorithm (MRPP), central algorithm (CA), and the optimisation central algorithm (OCA). The primary objective of these algorithms is to enhance path optimality, mitigate computational complexity, and ensure robust inter-robot collision avoidance. The MRPP is a composite approach integrating the visibility graph (VG) for path generation. The CA, derived from VG principles, utilises a central baseline (CB) approach to reduce vertex count, thereby decreasing computational cost while maintaining path efficiency. The OCA extends CA by integrating obstacle expansion and safety margins to enhance collision avoidance and path optimisation. Comparative analysis through simulations in 2D polygonal environments compared the performance of these algorithms, considering their computational efficiency, path optimisation, and collision avoidance. CA and OCA demonstrated significant improvement over the VG-based approach, especially concerning optimality and optimisation. CA reduced the average path length by 4.3% compared with MRPP, while OCA achieved a 6.8% reduction over MRPP, and 2.5% over CA, demonstrating its superior balance between optimality and efficiency. MRPP offers robust connectivity, making it preferable in scenarios where communication is critical. The study’s findings assist in devising MPRPP solutions.