This is an acronym in the English language.
MDTSP = Multiple Dubins Traveling Salesman Problem
MDTSP = Multiple Dubins Travelling Salesmen Problem
MDTSP = Multi-Depot Travelling Salesman Problem
MDTSP is the term for the problem of optimal path planning to visit a set of regions by Dubins vehicle, which is also known as the Dubins Traveling Salesman Problem with Neighborhoods (DTSPN). This problem can be tackled by a transformation to other variants of the TSP or evolutionary algorithms.
