Conflict-free Real-time AGV Routing | Zendy

Rolf H. Möhring | Zendy; Ekkehard Köhler | Zendy; Ewgenij Gawrilow | Zendy; Björn Stenzel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Conflict-free Real-time AGV Routing

Author(s) -

Rolf H. Möhring,

Ekkehard Köhler,

Ewgenij Gawrilow,

Björn Stenzel

Publication year - 2005

Publication title -

operations research proceedings

Language(s) - English

Resource type - Book series

eISSN - 2197-9294

pISSN - 0721-5924

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

Subject(s) - computer science , computation , routing (electronic design automation) , static routing , preprocessor , container (type theory) , algorithm , distributed computing , real time computing , computer network , engineering , routing protocol , artificial intelligence , mechanical engineering

. 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 (conict-free rout- ing). 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 readjust- ment 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. Ad- ditionally, in comparison to a static routing approach, used in Container Terminal Altenwerder (CTA) at Hamburg Harbour, our algorithm had an explicit advantage. Keywords: AGV Routing, online routing, shortest path with time-

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research