Survey of research in the design and control of automated guided vehicle systems

Vis, Iris F. A.

doi:10.1016/j.ejor.2004.09.020

Cited by 623 publications

(247 citation statements)

References 186 publications

Supporting

Mentioning

230

Contrasting

Unclassified

Order By: Relevance

“…This problem arises in the deployment of Automated Guided Vehicle Systems (AGVSs), for instance in manufacturing where the vehicles carry materials between production stations, or at container terminals such as Hamburg and Singapore, where they carry containers to and from ships [1]. Another application domain of multi-agent transportation is taxi routing at airports [2,3], where aircraft have to taxi, e.g.…”

Section: Introductionmentioning

confidence: 99%

Context-Aware Route Planning

Mors

Witteveen

Zutt

et al. 2010

Multiagent System Technologies

View full text Add to dashboard Cite

Abstract. In context-aware route planning, there is a set of transportation agents each with a start and destination location on a shared infrastructure. Each agent wants to find a shortest-time route plan without colliding with any of the other agents, or ending up in a deadlock situation. We present a single-agent route planning algorithm that is both optimal and conflict-free. We also present a set of experiments that compare our algorithm to finding a conflict-free schedule along a fixed path. In particular, we will compare our algorithm to the approach where the shortest conflict-free schedule is chosen along one of k shortest paths. Although neither approach can guarantee optimality with regard to the total set of agent route plans -and indeed examples can be constructed to show that either approach can outperform the other -our experiments show that our approach consistently outperforms fixed-path scheduling.

show abstract

Section: Introductionmentioning

confidence: 99%

Context-Aware Route Planning

Mors

Witteveen

Zutt

et al. 2010

Multiagent System Technologies

View full text Add to dashboard Cite

show abstract

“…A heuristic similar to that of Horn (2002) is included in the simulation tests in section 7. Similar problems that involve the repositioning of idle vehicles arise in the control of automated guided vehicle (AGV) systems (Vis, 2006) and elevators (Wesselowski and Cassandras, 2007).…”

Section: Introductionmentioning

confidence: 99%

Proactive empty vehicle redistribution for personal rapid transit and taxis

Lees-Miller

Wilson

2012

Transportation Planning and Technology

View full text Add to dashboard Cite

The empty vehicle redistribution (EVR) problem is to decide when and where to move empty vehicles in a Personal Rapid Transit or taxi system. These decisions are made in real time by an EVR algorithm. A reactive EVR algorithm moves empty vehicles only in response to known requests; in contrast, a proactive EVR algorithm moves empty vehicles in anticipation of future requests. This paper describes two new proactive EVR algorithms, called Sampling and Voting (SV) and Dynamic Transportation Problem (DTP), that move empty vehicles proactively based on demand estimates from historical data. It also develops methods for assessing the performance of EVR algorithms absolutely in terms of both throughput and passenger waiting times. In simulation tests, the proposed algorithms provide lower passenger waiting times than other algorithms in the literature, and proactive movement of empty vehicles significantly reduces waiting times, usually with a modest increase in empty vehicle travel.

show abstract

“…Changes in port operations have been gradually introduced, and this trend seems to continue, as it is shown that one of the least efficient and most costly processes in ports come from internal transportation in non-automated terminals [13]. Therefore, Automated Container Terminals (ACTs) with Automated Storage and Retrieval Systems -ASRS [11] or Automated Guided Vehicles -AGVs [13] are nowadays getting more presence around the world. In Europe, the European Combined Terminal (ECT) in Rotterdam, the Netherlands, is one of the most automated container terminal in the world.…”

Section: Introduction and State Of The Artmentioning

confidence: 99%

Low Cost, Robust and Real Time System for Detecting and Tracking Moving Objects to Automate Cargo Handling in Port Terminals

Vaquero

Repiso

Sanfeliu

et al. 2015

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Abstract. The presented paper addresses the problem of detecting and tracking moving objects for autonomous cargo handling in port terminals using a perception system which input data is a single layer laser scanner. A computationally low cost and robust Detection and Tracking Moving Objects (DATMO) algorithm is presented to be used in autonomous guided vehicles and autonomous trucks for efficient transportation of cargo in ports. The method first detects moving objects and then tracks them, taking into account that in port terminals the structure of the environment is formed by containers and that the moving objects can be trucks, AGV, cars, straddle carriers and people among others. Two approaches of the DATMO system have been tested, the first one is oriented to detect moving obstacles and focused on tracking and filtering those detections; and the second one is focused on keepking targets when no detections are provided. The system has been evaluated with real data obtained in the CTT port terminal in Hengelo, the Netherlands. Both methods have been tested in the dataset with good results in tracking moving objects.

show abstract

Survey of research in the design and control of automated guided vehicle systems

Cited by 623 publications

References 186 publications

Context-Aware Route Planning

Context-Aware Route Planning

Proactive empty vehicle redistribution for personal rapid transit and taxis

Low Cost, Robust and Real Time System for Detecting and Tracking Moving Objects to Automate Cargo Handling in Port Terminals

Contact Info

Product

Resources

About