Comparison of IP and CNF Models for Control of Automated Valet Parking Systems
Abstract: In automated valet parking system, a central computer controls a number of robots which have the capability to move in two directions, under cars, lift a car up, carry it to another parking slot, and drop it. We study the theoretical throughput limitations of these systems: Given a car park layout, an initial configuration of a car park (location of cars, robots), into a desired, terminal configuration, what is the optimal set of control instructions for the robots to reorganize the initial into the terminal configuration. We propose a discretization, and compare an Integer Programming model and a CNF-model on real-world and random test data.
Keywords: Computational Optimization, Integer Programming, Mathematical Programming.
Category 1: Integer Programming (0-1 Programming )
Category 2: Applications -- OR and Management Sciences (Transportation )
Category 3: Applications -- Science and Engineering (Facility Planning and Design )
Citation: 1, Ulikooli17, 51014 Tartu, Estonia, 02/2017
Entry Submitted: 02/24/2017
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|