Skip to main content Accessibility help
×
Home

Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming

Published online by Cambridge University Press:  10 August 2018

MARTIN GEBSER
Affiliation:
University of Potsdam, Germany (e-mail: gebser@cs.uni-potsdam.de)
PHILIPP OBERMEIER
Affiliation:
University of Potsdam, Germany (e-mail: gebser@cs.uni-potsdam.de)
TORSTEN SCHAUB
Affiliation:
University of Potsdam, Germany (e-mail: gebser@cs.uni-potsdam.de)
MICHEL RATSCH-HEITMANN
Affiliation:
Mercedes-Benz Ludwigsfelde GmbH, Germany
MARIO RUNGE
Affiliation:
Mercedes-Benz Ludwigsfelde GmbH, Germany
Corresponding
E-mail address:
Rights & Permissions[Opens in a new window]

Abstract

Automated storage and retrieval systems are principal components of modern production and warehouse facilities. In particular, automated guided vehicles nowadays substitute human-operated pallet trucks in transporting production materials between storage locations and assembly stations. While low-level control systems take care of navigating such driverless vehicles along programmed routes and avoid collisions even under unforeseen circumstances, in the common case of multiple vehicles sharing the same operation area, the problem remains how to set up routes such that a collection of transport tasks is accomplished most effectively. We address this prevalent problem in the context of car assembly at Mercedes-Benz Ludwigsfelde GmbH, a large-scale producer of commercial vehicles, where routes for automated guided vehicles used in the production process have traditionally been hand-coded by human engineers. Such ad-hoc methods may suffice as long as a running production process remains in place, while any change in the factory layout or production targets necessitates tedious manual reconfiguration, not to mention the missing portability between different production plants. Unlike this, we propose a declarative approach based on Answer Set Programming to optimize the routes taken by automated guided vehicles for accomplishing transport tasks. The advantages include a transparent and executable problem formalization, provable optimality of routes relative to objective criteria, as well as elaboration tolerance towards particular factory layouts and production targets. Moreover, we demonstrate that our approach is efficient enough to deal with the transport tasks evolving in realistic production processes at the car factory of Mercedes-Benz Ludwigsfelde GmbH.

Type
Original Article
Copyright
Copyright © Cambridge University Press 2018 

References

Banbara, M., Kaufmann, B., Ostrowski, M., and Schaub, T. 2017. Clingcon: The next generation. Theory and Practice of Logic Programming 17, 4, 408461.CrossRefGoogle Scholar
Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., and Schaub, T. 2012. ASP-Core-2: Input language format.Google Scholar
Erdem, E., Kisa, D., Öztok, U., and Schüller, P. 2013. A general formal framework for pathfinding problems with multiple agents. In Proceedings of AAAI'13. AAAI Press, 290296.Google Scholar
Fisher, M. 2008. Temporal representation and reasoning. In Handbook of Knowledge Representation. Elsevier Science, 513550.CrossRefGoogle Scholar
Fox, M. and Long, D. 2003. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20, 61124.CrossRefGoogle Scholar
Gebser, M., Janhunen, T., and Rintanen, J. Declarative encodings of acyclicity properties. Journal of Logic and Computation, in press.Google Scholar
Gebser, M., Kaminski, R., Kaufmann, B., Lindauer, M., Ostrowski, M., Romero, J., Schaub, T., and Thiele, S. 2015. Potassco User Guide. University of Potsdam.Google Scholar
Gebser, M., Kaminski, R., Kaufmann, B., and Schaub, T. 2012. Answer Set Solving in Practice. Morgan and Claypool Publishers.Google Scholar
Lifschitz, V. 1999. Answer set planning. In Proceedings of ICLP'99. MIT Press, 2337.Google Scholar
Neubauer, K., Wanko, P., Schaub, T., and Haubelt, C. 2017. Enhancing symbolic system synthesis through ASPmT with partial assignment evaluation. In Proceedings of DATE'17. IEEE Press, 306309.Google Scholar
Nguyen, V., Obermeier, P., Son, T., Schaub, T., and Yeoh, W. 2017. Generalized target assignment and path finding using answer set programming. In Proceedings of IJCAI'17. IJCAI/AAAI Press, 12161223.Google Scholar
Son, T., Baral, C., and Tuan, L. 2004. Adding time and intervals to procedural and hierarchical control specifications. In Proceedings of AAAI'04. AAAI Press, 9297.Google Scholar
Zhou, N., Barták, R., and Dovier, A. 2015. Planning as tabled logic programming. Theory and Practice of Logic Programming 15, 4–5, 543558.CrossRefGoogle Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 241 *
View data table for this chart

* Views captured on Cambridge Core between 10th August 2018 - 26th January 2021. This data will be updated every 24 hours.

Access
Hostname: page-component-898fc554b-t4g97 Total loading time: 0.341 Render date: 2021-01-26T07:04:29.979Z Query parameters: { "hasAccess": "1", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false }

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *