Advertisement

Multi-robot Multi-goal Motion Planning with Time and Resources

  • Stefan EdelkampEmail author
  • Junho Lee
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11649)

Abstract

This paper addresses multi-robot multi-goal motion planning with temporal and resources constraints. It solves the vehicle routing problem for mobile robots that operate according to their system dynamics, and which have to visit a number of waypoints scattered in a two-dimensional map environment with obstacles, while satisfying time window and capacity constraints. We compute the shortest path distances between each pair of waypoints in advance, and Monte-Carlo search plans the vehicles’ tour through adaptation of a rollout policy, while adding the constraints to its optimization objective. Macro actions enable the vehicles to run in real-time with best actions being distributed to the individual controllers. We analyze how the simulation is affected by varying parameters such as the number of vehicles.

References

  1. Adewumi, A.O., Adeleke, O.J.: A survey of recent advances in vehicle routing problems. Int. J. Syst. Assur. Eng. Manag. 9(1), 155–172 (2018)CrossRefGoogle Scholar
  2. Barshan, B., Durrant-Whyte, H.F.: An inertial navigation system for a mobile robot. In: Proceedings of the 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), vol. 3, pp. 2243–2248 (1993)Google Scholar
  3. Bortfeldt, A.: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comput. Oper. Res. 39(9), 2248–2257 (2012)MathSciNetCrossRefGoogle Scholar
  4. Cazenave, T.: Nested Monte-Carlo search. In: IJCAI, vol. 9, pp. 456–461, July 2009Google Scholar
  5. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)MathSciNetCrossRefGoogle Scholar
  6. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)MathSciNetCrossRefGoogle Scholar
  7. Edelkamp, S., Greulich, C.: Solving physical traveling salesman problems with policy adaptation. In: IEEE Conference on Computational Intelligence and Games (CIG), pp. 1–8, August 2014Google Scholar
  8. Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Transp. Sci. 40(3), 342–350 (2006)CrossRefGoogle Scholar
  9. Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. EJOR 162(1), 220–238 (2005)CrossRefGoogle Scholar
  10. Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. EJOR 189(2), 293–309 (2008)MathSciNetCrossRefGoogle Scholar
  11. Koskosidis, Y.A., Powell, W.B., Solomon, M.M.: An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transp. Sci. 26(2), 69–85 (1992)CrossRefGoogle Scholar
  12. Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345–358 (1992)MathSciNetCrossRefGoogle Scholar
  13. Lenstra, J.K., Kan, A.R.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221–227 (1981)CrossRefGoogle Scholar
  14. Mazzeo, S., Loiseau, I.: An ant colony algorithm for the capacitated vehicle routing. Electron. Notes Discret. Math. 18, 181–186 (2004)MathSciNetCrossRefGoogle Scholar
  15. Perez, D., et al.: Solving the physical traveling salesman problem: tree search and macro actions. IEEE Trans. CI AI Games 6(1), 31–45 (2014)Google Scholar
  16. Perez, D., Rohlfshagen, P., Lucas, S.M.: The physical travelling salesman problem: WCCI 2012 competition. In: 2012 IEEE Evolutionary Computation (CEC), pp. 1–8, June 2012Google Scholar
  17. Reddy, H.: PATH FINDING-Dijkstra’s and A* algorithm’s. Int. J. IT Eng. 1–15 (2013)Google Scholar
  18. Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: IJCAI, pp. 649–654, July 2011Google Scholar
  19. Takes, F., Kosters, W.A.: Applying Monte Carlo techniques to the capacitated vehicle routing problem. In: BNAIC (2010)Google Scholar
  20. Toth, P., Vigo, D.: Branch-and-bound algorithms for the capacitated VRP. In: The Vehicle Routing Problem, pp. 29–51. SIAM (2002)Google Scholar
  21. Ursani, Z., Essam, D., Cornforth, D., Stocker, R.: Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput. 11(8), 5375–5390 (2011)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of InformaticsKing’s College LondonLondonUK

Personalised recommendations