Conflict-free Real-time AGV Routing

Rolf H. Möhring (), Ekkehard Köhler, Ewgenij Gawrilow () and Björn Stenzel ()
Additional contact information
Rolf H. Möhring: Technische Universität Berlin
Ewgenij Gawrilow: Technische Universität Berlin
Björn Stenzel: Technische Universität Berlin

A chapter in Operations Research Proceedings 2004, 2005, pp 18-24 from Springer

Abstract: Abstract We present an algorithm for the problem of routing Automated Guided Vehicles (AGVs) in an automated logistic system. The algorithm avoids collisions, deadlocks and livelocks already at the time of route computation (conflict-free routing). After a preprocessing step the real-time computation for each request consists of the determination of a shortest path with time-windows and a following readjustment of these time-windows. Both is done in polynomial-time. Using goal-oriented search we get computation times which are appropriate for real-time routing. Additionally, in comparison to a static routing approach, used in Container Terminal Altenwerder (CTA) at Hamburg Harbour, our algorithm had an explicit advantage.

Keywords: Short Path; Transit Time; Collision Avoidance; Priority Queue; Short Path Problem (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-27679-1_3

Ordering information: This item can be ordered from
http://www.springer.com/9783540276791

DOI: 10.1007/3-540-27679-3_3

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().