Danial Hawari

Researcher

Robotics & Autonomous Systems,
Royal Military Academy

Address

Avenue De La Renaissance 30, 1000 Brussels, Belgium

Contact Information

Call: –

Email: Danial.Hawari@mil.be

Danial Hawari is a robotic network researcher at the Robotics & Autonomous Systems unit of the department of Mechanics of the Belgian Royal Military Academy. His area of expertise lies in cloud and network infrastructure including Internet of Things, full-stack web application, and cloud applications. On top of that, his study focuses on cyber-physical systems, automation, robotics, embedded system, mechatronics and micro-mechatronics.

2025

• E. Maroulis, D. Hawari, K. Hasselmann, E. {Le Flécher}, and G. {De cubber}, “Experimental Evaluation of Roadmap-Based Map Generation with Continuous-Time Conflict-Based Search for Multi-Agent Pathfinding," IEEE International Conference on Autonomous Robots and Agents, ICARA, p. 380–387, 2025.
  [BibTeX] [Abstract] [Download PDF] [DOI]
  

  This article presents an experimental evaluation of a Multi-Agent Pathfinding (MAPF) approach for large-scale robotic fleets operating in diverse outdoor environments. We generated three distinct types of roadmap graphs: Constrained Delaunay Triangulation (CDT), Voronoi Diagram (VD), and Grid-derived from an obstacle file, and assessed their quality using metrics obtained from graph theory. Then, the performance of the Continuous-time Conflict-Based Search (CCBS) algorithm was evaluated across three different environmental maps, considering practical performance metrics including makespan and failure rate. Subsequently, the roadmap generation methods were ranked based on CCBS performance in similar scenarios using the Friedman statistical test. The results indicate that CDT outperforms both VD and Grid maps, even though it does not exhibit the best graph metrics in many environments. CDT’s superior performance is attributed to its enhanced interconnectedness and the availability of multiple pathways, as evidenced by its balanced metrics and structural properties. We show that CDT is the most efficient and reliable roadmap generation technique for multiagent systems under our experimental conditions making it a preferred choice for robust pathfinding.

  @article{34774d01cc3341398188fc8353028be2,
  title = "Experimental Evaluation of Roadmap-Based Map Generation with Continuous-Time Conflict-Based Search for Multi-Agent Pathfinding",
  abstract = "This article presents an experimental evaluation of a Multi-Agent Pathfinding (MAPF) approach for large-scale robotic fleets operating in diverse outdoor environments. We generated three distinct types of roadmap graphs: Constrained Delaunay Triangulation (CDT), Voronoi Diagram (VD), and Grid-derived from an obstacle file, and assessed their quality using metrics obtained from graph theory. Then, the performance of the Continuous-time Conflict-Based Search (CCBS) algorithm was evaluated across three different environmental maps, considering practical performance metrics including makespan and failure rate. Subsequently, the roadmap generation methods were ranked based on CCBS performance in similar scenarios using the Friedman statistical test. The results indicate that CDT outperforms both VD and Grid maps, even though it does not exhibit the best graph metrics in many environments. CDT's superior performance is attributed to its enhanced interconnectedness and the availability of multiple pathways, as evidenced by its balanced metrics and structural properties. We show that CDT is the most efficient and reliable roadmap generation technique for multiagent systems under our experimental conditions making it a preferred choice for robust pathfinding.",
  keywords = "Measurement , Automation , Reliability theory , Graph theory , Path planning , Robots , Multi-agent systems",
  author = "Emmanouil Maroulis and Danial Hawari and Ken Hasselmann and {Le Fl{\'e}cher}, Emile and {De cubber}, Geert",
  year = "2025",
  month = may,
  day = "5",
  doi = "10.1109/ICARA64554.2025.10977707",
  language = "English",
  pages = "380--387",
  journal = "IEEE International Conference on Autonomous Robots and Agents, ICARA",
  issn = "2767-7745",
  url = "https://ieeexplore.ieee.org/document/10977707",
  unit= {meca-ras},
  project= {CUGS, ANIMUS, AIDEDEX, CONVOY}
  }

2023

• G. De Cubber, E. Le Flécher, A. La Grappe, E. Ghisoni, E. Maroulis, P. Ouendo, D. Hawari, and D. Doroftei, “Dual Use Security Robotics: A Demining, Resupply and Reconnaissance Use Case," in IEEE International Conference on Safety, Security, and Rescue Robotics, 2023.
  [BibTeX] [Download PDF]

  @inproceedings{ssrr2023decubber,
  title={Dual Use Security Robotics: A Demining, Resupply and Reconnaissance Use Case},
  author={De Cubber, Geert and Le Flécher, Emile and La Grappe, Alexandre and Ghisoni, Enzo and Maroulis, Emmanouil and Ouendo, Pierre-Edouard and Hawari, Danial and Doroftei, Daniela},
  booktitle={IEEE International Conference on Safety, Security, and Rescue Robotics},
  editors ={Kimura, Tetsuya},
  publisher = {IEEE},
  year = {2023},
  vol = {1},
  project = {AIDED, iMUGs, CUGS},
  location = {Fukushima, Japan},
  unit= {meca-ras},
  doi = {},
  url={https://mecatron.rma.ac.be/pub/2023/SSRR2023-DeCubber.pdf}
  }