Linguistic geometry tools for multiple agents with variable speeds

In the creation of a linguistic geometry universal test-bed, it is necessary to incorporate an algorithm for tuning this test-bed for the specific problem domains. One of such domains is the class of problems with multiple agents moving with variable speeds. This capacities should be incorporated into the lower level languages of LG. The paper provides an algorithm that deals with varying relations of reachability as a model of varying speeds of agents involved in a problem