Skip to main content

Solving the Physical Vehicle Routing Problem for Improved Multi-robot Freespace Navigation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9904))

Abstract

Freespace navigation for autonomous robots is of growing industrial impact, especially in the logistics and warehousing domain. In this work, we describe a multiagent simulation solution to the physical vehicle routing problem, which extends the physical traveling salesman problem —a recent benchmark used in robot motion planning research— by considering more than one concurrent vehicle.

For the interaction of vehicles, we compute the collision of physical bodies and then apply the impact resulting from the elastic collision. A multi-threaded controller is implemented which forwards the proposed actions from each individual robot’s controller to the environment real-time simulator. For computing an optimized assignment of the pickup and delivery tasks to the vehicles we apply nested Monte-Carlo tree search.

In the experiments, we study the problem of robot navigation for automated pickup and delivery of shelves to and from picking stations.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Previously KIVA Systems.

  2. 2.

    A video animation of the solution process is avaialble at https://bitbucket.org/Denis_Golubev/pvrp/src.

References

  1. allegro.cc: 2D concave polygon collision detection (2009). https://www.allegro.cc/forums/thread/598784

  2. Applegate, D.L., Bixby, R.E., Chvtal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, New Jersey (2006)

    MATH  Google Scholar 

  3. Bittle, W.: SAT (Separating Axis Theorem) (2010)

    Google Scholar 

  4. Cazenave, T.: Nested Monte-Carlo search. In: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, Universit Paris-Dauphine, Paris (2009)

    Google Scholar 

  5. Cordeau, J.-F., Laporte, G., Savelsbergh, M.W., Vigo, D.: Vehicle routing. In: Handbooks in Operations Research and Management Science, vol. 14, pp. 367–428. Elsevier B.V (2007). Chapter 6

    Google Scholar 

  6. Cornelsen: Das große Tafelwerk: Formelsammlung für die Sekundarstufen I und II. Berlin: Cornelsen (2010). (German)

    Google Scholar 

  7. Craver, W.: Elastic Collisions (2016)

    Google Scholar 

  8. Eberly, D.: Intersection of Convex Objects: The Method of Separating Axes. Geometric Tools, LLC (2008)

    Google Scholar 

  9. Edelkamp, S., Greulich, C.: Solving physical traveling salesman problems with policy adaptation. In: IEEE Conference on Computational Intelligence in Games (CIG), pp. 1–8 (2014)

    Google Scholar 

  10. Plaku, E., Sarah, R., Stefan, E.: Observation of strains: multi-group motion planning in virtual environments. Comput. Animation Virtual Worlds (2011)

    Google Scholar 

  11. Gamma, E., Helm, R., Johnson, R.E., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Boston (1995)

    MATH  Google Scholar 

  12. Hazard, C.J., Wurman, P.R., Soup, A.: A testbed for studying resource allocation in multi-vehicle systems. In: AAAI-Workshop on Auction-Based Robot Coordination (2006)

    Google Scholar 

  13. Landau, L.D., Lifshitz, E.M.: Mechanics. Course of Theoretical Physics, vol. 1. Pergamon Press, Oxford (1969)

    Google Scholar 

  14. Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)

    MATH  Google Scholar 

  15. Neward, T.: Java 8: Lambdas, Part 1. Oracle (Java Mag.) (2013)

    Google Scholar 

  16. Oracle: Java Platform Standard 8th edn. Documentation (2016)

    Google Scholar 

  17. Perez, D., Powley, E.J., Whitehouse, D., Rohlfshagen, P., Samothrakis, S., Cowling, P.I., Lucas, S.M.: Solving the physical travelling salesman problem: tree search and macro-actions. IEEE Trans. Comput. Intell. AI Games (2013)

    Google Scholar 

  18. Perez, D., Rohlfshagen, P., Lucas, S.M.: The physical travelling salesman problem: WCCI 2012 competition (2012)

    Google Scholar 

  19. Rosin, Christopher D.: Nested rollout policy adaptation. In: IJCAI, USA (2011)

    Google Scholar 

  20. Tzoreff, T.E., Granot, D., Granot, F., Soic, G.: The vehicle routing problem with pickups and deliveries on some special graphs. Discrete Appl. Math. 116(3), 139–229 (2002)

    MathSciNet  MATH  Google Scholar 

  21. Urma, R.-G.: Processing data with Java SE 8 streams, Part 1. Oracle (Java Mag.) (2014)

    Google Scholar 

  22. Wurman, P.R., D’Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Mag. 29(1), 9 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefan Edelkamp .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Edelkamp, S., Golubev, D., Greulich, C. (2016). Solving the Physical Vehicle Routing Problem for Improved Multi-robot Freespace Navigation. In: Friedrich, G., Helmert, M., Wotawa, F. (eds) KI 2016: Advances in Artificial Intelligence. KI 2016. Lecture Notes in Computer Science(), vol 9904. Springer, Cham. https://doi.org/10.1007/978-3-319-46073-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46073-4_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46072-7

  • Online ISBN: 978-3-319-46073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics