Turn penalty problem model for minimum time AGV routing

Author

Lee, J.H. ; Chung, C.-Y. ; Lee, B.H. ; Choi, M.H.

Author_Institution

Autom. & Syst. Res. Inst., Seoul Nat. Univ., South Korea

Volume

3

fYear

1997

fDate

9-14 Nov 1997

Firstpage

1323

Abstract

The minimum time AGV routing problem (MTARP) has been generally modeled as a shortest path routing problem with time window constraints. Previous results on MTARP, however, considered the velocity of each AGV to be constant. In this paper, it is asserted that the MTARP should consider turn penalty if acceleration/deceleration of each AGV is taken into account. Considering turn penalty yields an equivalent converted network from the given guidepath network, which can be an explicit network model for MTARP

Keywords

automatic guided vehicles; control system analysis; motion control; time optimal control; acceleration; control simulation; deceleration; equivalent converted network; guidepath network; minimum time AGV routing problem; shortest path routing problem; time window constraints; turn penalty problem model; Acceleration; Automation; Centralized control; Communication system traffic control; Costs; Joining processes; Motion control; Routing; Shortest path problem; Time factors;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Electronics, Control and Instrumentation, 1997. IECON 97. 23rd International Conference on

Conference_Location

New Orleans, LA

Print_ISBN

0-7803-3932-0

Type

conf

DOI

10.1109/IECON.1997.668506

Filename

668506