Dissertation/Thesis Abstract

Time efficiency analysis of an Automatic Parking system
by Mishra, Anil Kumar, M.S., California State University, Long Beach, 2012, 46; 1517736
Abstract (Summary)

In this thesis, a time analysis for parking and retrieval process inside an Automatic Parking system (APS) by five different set of Automated Guided vehicle (AGV) systems has been performed. The time analysis has been done to check the performances of different APS configurations, which is based on the varying combinations of system's parking spaces and its entries and exits. The number of entries/exits in the systems governs the number of AGVs in use by the various system configurations.

The APS configurations considered in this study include, systems with one entry /one exit and 2 AGVs, systems with two entries/two exits and four AGV's, systems with three entries/three exits and six AGVs, systems with four entries/four exits and eight AGVs, and lastly, systems with five entries/five exits and ten AGVs. The number of APS parking spaces considered in this study includes 50, 100, 150, 200, 250, 500, 1,000, 1,500, 2,000 and 2,500 spaces. The time taken by the AGV systems to park/ retrieve a vehicle in an APS has been compared with a maximum acceptable time for the parking/retrieval process as found in the literature W. Based on the results obtained, observations have been made about the relationship between the number of parking spaces in an APS and the corresponding number of entries/exits required to perform the parking/retrieval process efficiently. Furthermore, suggestions have been made for the future simulation analyses.

Indexing (document details)
Advisor: Bahr, Behnam
Commitee:
School: California State University, Long Beach
School Location: United States -- California
Source: MAI 51/01M(E), Masters Abstracts International
Source Type: DISSERTATION
Subjects: Automotive engineering, Mechanical engineering
Keywords:
Publication Number: 1517736
ISBN: 978-1-267-47097-3
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest