Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Turn penalty problem model for minimum time AGV routing
By: Lee, J.H.; Choi, M.H.; Lee, B.H.; Chung, C.-Y.;
1997 / IEEE / 0-7803-3932-0
This item was taken from the IEEE Conference ' Turn penalty problem model for minimum time AGV routing ' 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.
Minimum Time Agv Routing Problem
Shortest Path Routing Problem
Time Window Constraints
Turn Penalty Problem Model
Equivalent Converted Network
Shortest Path Problem
Communication System Traffic Control
Time Optimal Control
Automatic Guided Vehicles
Control System Analysis