Hi again @Anes, hopefully you may have found a solution to you path problem using the navigation mesh.
For future clarification on the method I was suggested I have produced a PG. It is rough and ready and for proper use it will need refinement.
https://www.babylonjs-playground.com/#BC8IWV#9
Set the start and end points (0 to 10) on lines 278, 279
The design process is
Create the buildings (or maze or whatever) with access points - red objects in the PG.
Number the access points.
Draw a plan of access points and possible paths. Number the corners, (way points, junctions, decision points or whatever you want to call them). The are the nodes for the Dijkstra’s algorithm.
Form a list of nodes.
Using the node points form a list of edges, ie pairs of adjoining neighbours.
Form the graph from the nodes and edges, set a start node and end node and build a path from node to node.