Efficient algorithm for kind of exploration problem with N vehicles
Jinchuan Cui · Journal of systems engineering · 2008
This paper studies a kind of exploration problem with N vehicles.That is:how to arrange the travel order properly to make one of the vehicles go the farthest.By modeling,the authors trans- form the original exploration problem to a scheduling problem with an exponential computational time complexity.This paper firstly analyzes the 2-vehicles case for simplicity,and gives the determinative condition for obtaining the optimal solution.Then the authors extend the 2-vehicles to N-vehicles case,and obtain a special case for which the problem is proved to be efficiently solvable.An effi- cient algorithm is proposed which can get the optimal solution for the special case.Numerical exam- ples are stated at last.