A Reservation Strategy Model of Finite Berth Based on Active Parking Guidance and Information System

Reservation berth is one of most important part of parking guidance. This paper studies a reservation strategy model of finite berth. It develops reservation strategy of finite berth. Based on the every aspect of life, the strategy can obtain the last reservation berth by game- playing algorithm considering the controlling to berth of guidance system and park. This paper develops a game-playing algorithm of reservation berth by analyzing the four possible strategies: reserve strategy, lag reserve, advance breach of faith, and berth occupying. Simulation experiments show this reservation strategy can reserve berth having no use for accurate reserve berth and using parameters, which is more near to real life. It is of use value.