What do the weights of edges in Djikstra represent?

edit

In general Djikstra weights can be used to encode some important information not only distance. For instance, you can compute the time to travel, or the battery depletion estimation between two vertices. Dijkstra's algorithm can be used to find "shortest" path where shortest means smallest total weight, taking distance as shortest distance, time as smallest amount of time taken to complete the path etc.

Hence, the representation of the weights is arbitrary, generally speaking the weights are used as a distance because is usually the most suitable and easy way to do path planning between nodes, but you can have another metric or even an aggregation of information from several metrics.

You will need to analyze how you want to model the problem of indoor path planning with the turtlebot, it may depend on your indoor environment, its limitations and structure. Usually when you generate a graph in order to apply path planning algorithm you decide the distance between nodes and the weights assigned to each edge, modeling the estimated behavior of the movement of the robot and taking into account its physical and hardware limitations.

But I will say, I will glad to hear what other members more experienced in this field have to say about this problem.