JP2005157518A - Parking lot reservation method, program and device - Google Patents

Abstract

It is possible to make reservations for a plurality of vehicles at the same time and to reach a destination while reliably joining from a parking lot to a destination.
A search condition input unit 24 inputs an event name designated as a search condition, a reservation date, a desired number of parking spaces, a travel route from a departure place to a destination, and a driver terminal address of each car. The parking lot search unit 26 searches for a free parking lot for the desired number of parking lots including the empty parking lot closest to the destination on the moving route, and assigns it to each car. The search result notification unit 28 notifies the driver terminal of each car of the assigned parking lot and the route information from the assigned parking lot to the destination.
[Selection] Figure 1

Description

TECHNICAL FIELD The present invention relates to a parking lot reservation method, program, and apparatus for searching and reserving an empty parking lot, and in particular, a parking lot reservation method, program, and apparatus for searching and reserving a plurality of empty parking lots with a single application. About.

Conventionally, in a parking lot reservation system using a mobile terminal, a user who wants to use a store that does not have a dedicated parking lot uses a user terminal to make reservation information about the parking lot availability on the store website on the network and reservations. When the parking lot management server searches for the availability of the contract parking lot, and if there is an empty contract parking lot, it makes a reservation and sends the result to the user terminal. It is possible to reserve a contract parking lot.
JP 2002-197208 A

  However, such a conventional parking reservation system is premised on reservations for each car, and when a family member or group goes out in multiple cars, reservations are made for each car. The reservation procedure is complicated.

  In addition, if you make a reservation one by one, the available parking lots are often distributed in multiple locations, such as stores and event venues, and if there are no vacancies, separate parking lots are reserved. If you go to a family or group, you may not be able to join well unless you have a good meeting in advance after arriving at the reserved parking lot.

  In addition, the event venues are expected to be very crowded, so the situation from the parking lot to the venue is not known, and it can be said that it is quite difficult to meet and join in the middle.

An object of the present invention is to provide a parking lot reservation method, a program, and a device that can make a reservation for a plurality of vehicles at the same time and can reach a destination while reliably joining a parking lot.

The present invention provides a parking reservation method,
A search condition input step for inputting an event name, a reservation date, a desired parking number, a travel route from a departure place to a destination, and a driver terminal address of each car specified as search conditions,
A parking lot search step of searching for an empty parking lot for the desired number of parking lots including the empty parking lot closest to the destination on the moving route and assigning it to each car;
A search result notification step of notifying the driver terminal of each car of the allocation parking lot and the route information from the allocation parking lot to the destination;
It is provided with.

  According to such a parking lot reservation method of the present invention, when a family or a group divides a plurality of cars and goes to a destination such as an event venue, reservation of a parking lot of a plurality of cars is performed with one access. This can be done from the user terminal, and it is possible to apply more easily than when making a reservation one by one.

  In addition, an empty parking lot is assigned to each car by the search, and at the same time, route information from the parking lot to the destination is notified to the driver terminal of each car. You can head to your destination while meeting with the people who arrive at the parking lot.

  The search condition input step in the parking lot reservation method of the present invention inputs an entry point of each vehicle to a predetermined search area including the destination and the parking lot, and the parking lot search step includes an empty parking lot closest to the destination. For the first vehicle, and for the second and subsequent vehicles, search for an empty parking lot closest to the previously searched empty parking lot and search for an empty parking lot for the desired number of parking, A second step of determining a total travel distance for all combinations of the entry point and each searched empty parking lot, selecting a combination that minimizes the total travel distance, and assigning the searched parking lot to each vehicle; It is characterized by that.

  The first of the free parking lots thus searched is the shortest distance from the destination, and the second and subsequent cars are searched for the empty parking lot that is the shortest distance from the previous empty parking lot. You can make reservations for free parking lots as close as possible and as concentrated as possible.

  In the parking lot reservation method of the present invention, the search condition input step inputs an entry point of each vehicle with respect to a predetermined search area including the destination and the parking lot, and the parking lot search step includes a plurality of points at the destination. If there is an entrance, the total distance traveled from each entry point to each entrance is obtained for each entrance, and the entrance with the minimum total distance is set as the arrival point. This makes it possible to determine the optimum entrance suitable for the route of each car from the destination entrance.

  In the parking reservation method of the present invention, the search condition input step inputs a terminal address corresponding to a terminal type such as a personal computer or a portable terminal as the driver terminal address, and the search result notification step corresponds to the terminal type. Route information is generated and transmitted to the driver terminal.

  That is, the search result notification step creates route information based on a map and transmits it when there is no limitation on the information display function of the driver terminal as in a personal computer. In addition, if the information display function of the driver terminal is limited like a mobile phone, the search result notification step creates and transmits route information by map if the distance between the displayed routes is within a predetermined distance, and displays it. If the distance between routes to be performed is greater than or equal to a predetermined distance, route information in text is created and transmitted.

  Therefore, if the driver terminal has sufficient communication speed and display capability like a personal computer or a car navigation device, route information based on a map is transmitted and displayed. On the other hand, when the communication speed and display capability are limited as in a mobile terminal, route information by a map is transmitted if the distance between display routes is as short as 500 m, for example, and if it is as long as 500 m or longer, text information is used. Route information can be transmitted and route information from the optimal parking lot to the destination can be displayed according to the function of the driver terminal.

  Here, the search result notifying step notifies the guide information from the next farthest allocated parking lot to the destination at the junction of the route in the order of the allocated parking lot farthest from the destination as the route information by text. For this reason, it is not necessary to have all the route information from the parking lot to the destination, and the route information to the next junction is in order from the farthest, reducing the burden on the mobile terminal.

  In the search result notifying step, when there is a vehicle without the driver terminal address input, the route information of the car without the address input is added and notified to the driver terminal inputting the driver terminal address.

The present invention provides a program for parking reservation. This program is installed on the computer that builds the server.
A search condition input step for inputting an event name, a reservation date, a desired parking number, a travel route from a departure place to a destination, and a driver terminal address of each car specified as search conditions,
A parking lot search step for searching for an empty parking lot as close as possible to the destination on the moving route and assigning it to each car;
A search result notification step of notifying the driver terminal of each car of the allocation parking lot and the route information from the allocation parking lot to the destination;
Is executed.

The present invention provides a parking lot reservation apparatus. This parking lot reservation device includes a search condition input unit for inputting an event name designated as a search condition, a reservation date, a desired number of parking spaces, a travel route from a departure place to a destination, and a driver terminal address of each car, On the route, search for an empty parking lot as close as possible to the destination and assign it to each car, and the assigned parking lot and the route information from the assigned parking lot to the destination on the driver terminal of each car And a search result notifying unit for notifying.

  According to the parking lot reservation method of the present invention, when a family or a group divides a plurality of cars and goes to a destination such as an event venue, the user terminal can reserve a parking lot of a plurality of cars with one access. Compared to making a reservation one by one, you can apply more easily.

  In addition, an empty parking lot is assigned to each car by the search, and at the same time, route information from the parking lot to the destination is notified to the driver terminal of each car. You can head to your destination while meeting with the people who arrive at the parking lot.

  In addition, the first of the searched free parking lots is at the shortest distance from the destination, and the second and subsequent cars are searched for the empty parking lot at the shortest distance from the previous empty parking lot. You can reserve a free parking lot near and as concentrated as possible.

  In addition, if the driver terminal has sufficient communication speed and display capability like a personal computer or car navigation device, the route information by map is transmitted and displayed, while the communication speed and display like a mobile terminal. If there is a limit on the capability, route information is sent by map if the distance between the displayed routes is short, and route information by text is sent if the distance is long. The route information to the ground can be displayed.

In addition, the route information in text does not need to have all the route information from the parking lot to the destination, only the route information to the junction with the route from the next far parking lot, and the communication speed and display capability Even for mobile terminals with restrictions, route information can be displayed appropriately.

  FIG. 1 is an explanatory diagram of a parking lot reservation system to which the present invention is applied. In FIG. 1, a server 10 is a computer that provides a parking lot reservation service according to the present invention. A personal computer 12, a mobile phone 14, and a car navigation device 16 are provided as user devices for the server 10.

  The personal computer 12 is connected to the server 10 via the Internet 18. The mobile phone 14 is connected to the server 10 via a wireless telephone network (not shown). Furthermore, the car navigation device 16 is also connected to the server 10 via the same wireless communication network as the mobile phone 14.

  The server 10 is provided with functions of a communication control unit 20 and a parking lot reservation processing unit 22. The communication control unit 20 includes a communication protocol for controlling communication with each of the personal computer 12, the mobile phone 14, and the car navigation device 16 as user devices.

  The parking lot reservation processing unit 22 is realized by an application program that realizes a parking lot reservation processing function according to the present invention, and includes the processing functions of a search condition input unit 24, a parking lot search unit 26, and a search result notification unit 28. Yes.

  For this parking lot reservation processing unit 22, an event table 30, a date table 32, an input table 34, a parking table 36, a registered car table 38, an arrival distance table 40, an entrance table 42, a search area table 44, a route A table 46, a guide table 48, a landmark table 50, an allocation table 52, and a combination table 54 are connected as a database. In addition to this, there is a work table used in the process of the parking lot reservation processing unit 22 as a database, but this is omitted.

  The search condition input unit 24 provided in the parking lot reservation processing unit 22 is, for example, as a user device, an event name designated as a search condition by the personal computer 12, a reservation date, a desired number of parking spaces, and a travel route from the departure place to the destination. The driver terminal address of each car is input by setting the input conditions for the user.

  The parking lot search unit 26 searches for an empty parking lot as close as possible to the destination on the travel route input from the search condition input unit 24 and assigns it to each car. The search result notification unit 28 notifies the driver terminal of each car of the assigned parking lot and the route information from the assigned parking lot to the destination.

  Here, in the search condition input unit 24, an entry point of each vehicle with respect to a predetermined search area including a destination and a parking lot is input, and the following first and second steps are performed.

(First step)
Search for the first available parking lot for the first vehicle, search for the second and subsequent parking lots closest to the previous empty parking lot, and search for an empty parking lot for the desired number of parking lots. To do.

(Second step)
The total travel distance is obtained for all combinations of the entry point of each car and each searched vacant parking lot, the combination that minimizes the total travel distance is selected, and the searched parking lot is assigned to each car.

  In addition, there may be a plurality of entrances at the event venue as the destination. In such a case, a specific entrance among a plurality of entrances of the event venue is determined as the arrival point. That is, in the parking lot search unit 26, for a plurality of entrances at the event venue, which is a destination, for each entrance, the total distance of travel from the entry point to each entrance for each car search area is obtained. The entrance with the smallest total distance is set as the arrival point.

  In the search result notification unit 28, route information corresponding to the terminal type such as the personal computer 12, the mobile phone 14, and the car navigation device 16 as user terminals is created and transmitted. In this case, when the information display function in the user terminal is not limited and has a sufficient display capability like the personal computer 12 and the car navigation device 16, route information based on a map is created and transmitted.

  On the other hand, when the information display function is limited as in the case of the mobile phone 14, if the distance between the displayed routes is within 500 meters, for example, the route information on the map is created and transmitted, and the distance exceeds 500 meters. If it is, the route information in text is created and transmitted. Here, the route information sent to the user terminal side means a route from the assigned parking lot to the entrance of a destination such as an event venue.

  Furthermore, in the search result notification unit 28, when sending route information by text to the mobile phone 14, the amount of information increases if all route information from each parking lot to the destination that is the event venue is sent. In the order of the parking lot far from the destination, the guide information to the junction of the routes from the next far parking lot is notified as route information by text.

  For this reason, the person who goes from the farthest parking lot receives the route information in the text from the next farthest parking lot to the junction of the route, and divides it into the route information in the text from the parking lot to the junction. By sending it to the driver terminal of the car, it becomes possible to equalize the amount of information for the driver of each car when the mobile phone is a user terminal.

  Furthermore, since it is expected that some drivers do not have an email address of a personal computer or a mobile phone, in such a case, an email address is provided to the user terminal of the driver who has the email address. You will be notified by adding route information about no driver.

  Next, the contents of a database provided as a table for the server 10 of FIG. 1 will be described. FIG. 2 is an explanatory diagram of the event table 30 of FIG. In the event table 30, event names are registered in advance corresponding to event codes (event CDs).

  In the following explanation, three drivers A, B, C, for example, take their friends and family together to go to the “Nebuta Festival” venue on August 7th. A case where a parking lot reservation is made will be described as an example. In addition, the registered vehicles are expressed as registered vehicles A, B, and C corresponding to the driver.

  FIG. 3 is an explanatory diagram of the date table 32 of FIG. An event date code, an event code, and an event date are registered in the event date table 32. In this example, it is understood that the “Nebuta Festival” of the event code No. 1 in the event table 30 of FIG. 2 is the date from August 2 to August 7, and three of A, B, and C are 8 I am planning to go out with my friends and family on Monday. In the following description, “code” is indicated as “CD” in the drawings.

  FIG. 4 is an explanatory diagram of the input table 34 of FIG. In the input table 34, information input using a search condition input screen for a user terminal, which will be clarified later, is registered. In this example, an input code, an event code, a date code, a desired number, a parking limit amount and an arrival point code are registered in the input table 34.

  FIG. 5 is the parking lot table 36 of FIG. 1, in which the parking lot code, parking lot name, event code, amount, route information from the parking lot to the entrance of the venue (route information), the number of parking lots and the area are registered. Yes.

  FIG. 6 is the registered vehicle table 38 of FIG. 1, in which information relating to the vehicle used by the user using the parking lot reservation system of the present invention is registered. In the registered car table 38, there are input code, registered car code, driver name, car navigation device address, personal computer address, mobile phone address, parking code, distance 1, distance 2 and distance 3 information. It is registered.

  Here, the distance 1 of the registered vehicle table 38 indicates the distance from the departure point to the parking lot, the distance 2 indicates the distance from the parking lot to the event venue (destination), and the distance 3 indicates the data display range. “1” and “0” stored in each of the distances 1 to 3 register “1” if the distance between the two points is 500 meters or more, and “0” if the distance is within 500 meters.

  FIG. 7 is an explanatory diagram of the arrival distance table 40 of FIG. The arrival distance table 40 is provided with an item of parking lot code and event CD = 1, thereby registering the distance from each of the parking lots P1, P2 and P3 to the event venue and the total distance thereof.

  FIG. 8 is an explanatory diagram of the entrance table 42 of FIG. In the entrance table 42, entrance codes, event codes, and entrance names are registered. For example, in the “Nebuta Festival” with event CD = 1, there is one entrance and the entrance name is “front entrance”.

  FIG. 9 is an explanatory diagram of the search area table 44 of FIG. This search area table 44 registers information on the search range of the parking lot along the route from the vehicle entry point to the destination for the search target area.

  For example, the search area is divided into vertical and horizontal grid blocks, numbers 1, 2, 3, 4,... Are set for the vertical direction, and lowercase letters a, b, c, d,. The combination of both, for example, “a6” represents the block position.

  FIG. 10 is an explanatory diagram of the route table 46 of FIG. 1, from the parking lot to the event venue in FIG. 10 (A) and from the entry point to the parking lot for the search area in FIG. 10 (B). Two route tables 46-2 are registered.

  In the route table 46-1 from the parking lot to the event venue in FIG. 10A, the event venue is set to “0” for the drivers (registered vehicles) A, B, and C, and the route to that route The number set for the intersection is registered.

  “R” after the number indicates a right turn at the intersection, “L” indicates a left turn at the intersection, and A, B, and C after the number are persons coming from other parking lots. Shows the confluence of For example, the information “10L C” of the intersection No. 3 of the driver A means that the intersection No. 10 is turned to the left and indicates the merger with the driver C who arrives at another parking lot.

  In the route table 46-2 from the entry point to the parking lot in FIG. 10B, the intersection number of the route having the parking lot as “0” and the entry point as the number 1 is registered.

  FIG. 11 is an explanatory diagram of the guide table 48 of FIG. The guide table 48 is divided into Nos. Is registered. This registered No. Has registered the intersection number of the junction at the intersection number that is the route information from the parking lot of the route information in text to the mobile phone to the event venue entrance.

  For example, “No. 3” is registered for the driver A of the guidance table 48. Therefore, referring to the route table 46-1 from the parking lot to the event venue in FIG. 3 is “10L C”, and the merge point with the driver C and No. 3 are shown. The intersection information “8R, 9, 10LC” at 1, 2, 3 is created and notified to the mobile phone.

  Similarly, for the driver B, the guidance table 48 indicates No. Since this is 4, all route information is created. For the driver C, no. 3 so that no. "15R, 10A, 6B" corresponding to 1 to 3 is created as route information by text.

  FIG. 12 shows the mark table 50 of FIG. 1, in which mark codes and mark names are registered. This mark code uses the number of an intersection or a target other than the intersection, and this mark code is used in the route table of FIG.

  FIG. 13 is an explanatory diagram of the allocation table 52 of FIG. 1, and the distance from the entry point to each parking lot is registered for the parking lot code and the entry points 1, 2 and 3 of each vehicle.

  FIG. 14 is an explanatory diagram of the combination table 54 of FIG. In this combination table 54, the total distance is registered for all combinations of the parking lot codes P1 to P3 and the entry points I1, I2, and I3 in FIG.

  FIG. 15 is a time chart showing a parking lot reservation processing procedure according to the present invention performed by exchange between the server of FIG. 1 and the user terminal. In FIG. 15, the user terminal 11 includes the personal computer 12, the mobile phone 14, and the car navigation device 16 shown in FIG. 1, but the personal computer 12 having a display processing function and a high communication speed is used for parking reservation. Mainly used.

  First, in the user terminal 11, the server 10 that provides the parking lot reservation system is accessed in step S101. Access to the server 10 is performed, for example, by accessing a homepage of a parking lot reservation system and using a user ID and password issued to the user in advance by member registration.

  In response to access from the user terminal 11, the server 10 displays an event list screen on the user terminal 11 side in step S1. When the user terminal 11 responds by selecting a necessary event in step S102 for the event list screen, the server 10 displays a search condition input screen 62 as shown in FIG. 16 on the user terminal 11 side in step S2. Let

  The user terminal 11 responds to the search condition input screen 62 by selecting a necessary event in step S103. For example, in the search condition input screen of FIG. 16, “Nebuta Festival” is selected as the event name, “August 7” is selected as the reservation date, and the number of reservations is “3”. “2000 yen or less” is specified as a search condition as the amount of money in the parking lot.

  If the above search conditions have been entered, clicking on the button 62-1 will notify the server 10 of the search conditions from the user terminal 11 in FIG. 15, and the server 10 will be as shown in FIG. 17 in step S3. The detailed condition input screen is displayed on the user terminal 11, and the user terminal 11 inputs the detailed condition in step S104.

  In the detailed condition input screen 64 of FIG. 17, since the user designates 3 as the reserved number, the vehicle detailed condition inputs 66-1 to 66-3 are the first, second, It is displayed as a platform. Each vehicle detailed condition input 66-1 to 66-3 is provided with a registered vehicle name, a PC mail address, a mobile phone mail address, a car navigation mail address, and an entry point selection button.

  The detailed condition input screen 64 displays a map 68 according to the event name “Nebuta Festival”. The map 68 displays a road map of a search area including a predetermined parking location for the venue 70. In this example, the road map is provided with mark codes 1 to 18 for each intersection.

  Therefore, in the user terminal, after entering necessary information for the vehicle detailed condition inputs 66-1 to 66-3 on this detailed condition input screen 64, the entry point is selected. For example, for the first driver A, the entry point 72 is set. An entry point 74 is set for the second driver B. Further, an entry point 76 is set for the third driver C.

  Then, when the necessary detailed condition input is completed, clicking the “execute search” button 65 notifies the server 10 of the detailed condition input result in step 104 of the user terminal 11 in FIG. Parking lot search processing is executed.

  Details of the parking lot search process in step S4 in the server 10 of FIG. 15 are shown in the flowchart of FIG.

  In the parking lot search process of FIG. 18, an arrival point determination process is performed in step S1. This arrival point determination process is a process in which, for example, when there are a plurality of entrances at an event venue as a destination, one of them is set as the arrival point. In step S2, search area range storage processing is performed. This search area range storing process is a process for determining a search range of a parking lot along the route from the entry point to the arrival point of each vehicle.

  Subsequently, in step S3, a parking lot closest to the arrival point is searched for among the parking lots satisfying the search condition, and then in the second and subsequent searches, the closest parking lot is searched from the previously searched parking lot. . Subsequently, in step S4, the remaining number of parking spaces searched is subtracted from the desired number, and the search process is terminated when the desired number becomes zero. And in step S5, after performing the parking lot allocation process which allocates the parking lot which was able to be searched with respect to each vehicle, it returns to step S5 of FIG. 15, and displays the screen of a search result.

  19 and 20 are examples of destinations that are the target of the arrival point determination process in step S1 of FIG. 18, and FIG. 21 shows a work table and an arrival distance table created by the destination point determination process.

  In the venue 70 as the destination of FIG. 19, three entrances a, b, and c are provided. In such a case, the total of the distance traveled from the entry point of each car set to the map for searching the parking lot to each entrance a, b, c is obtained, and the entrance with the shortest distance arrives. A point.

  FIG. 20 shows the venue 70 in FIG. 19 for two car drivers X and Y from the entry point of the search area to the entrances a, b and c as shown in FIGS. 20 (A), (B) and (C). And the work tables 78-1 to 78-3. Based on the work tables 78-1 to 78-3, the table contents in which the distances to the entrances a, b, and c and the total distances are registered for the drivers X and Y of each car as shown in FIG. After that, the entrance b corresponding to “3.1 Km” which is the shortest distance in the total distance is determined as the arrival point.

  In the venue 70 of the map 68 shown on the detailed condition input screen 64 in FIG. 17, there is one entrance. Therefore, in the arrival point determination process in step S1 in FIG. Will be determined as the arrival point.

  FIG. 21 is an explanatory diagram of the search area range storing process in step S2 of FIG. FIG. 21A shows a map 68 used for the search area range storage processing, and the map 68 is divided at regular intervals, for example, in units of 100 meters in length and width, and the area codes 1, 2, 3 are set, and area codes a, b, c,... Are set in the horizontal direction.

  Since the entry points 72, 74, and 76 of each car are set for such a map 68, a route from there to the venue 70 is obtained, and an area of 8 blocks around the block on the route is searched. By setting the range, the search area 75 is set on the map 68. In this search area 75, each cell is registered as an area code such as “a6, a7, a8, a9...” With the input code = 1 in the search area table 44 of FIG.

  FIG. 22 is an explanatory diagram of the parking lot assignment process in step S5 of FIG. First, as shown in FIG. 22A, with respect to the search area map 68, the process of steps S3 and S4 following the search area range storage process in step S2 of FIG. Assume that the parking lot P2 closest to 70 is searched, the parking lot P3 closest to the parking lot P2 is searched, and the parking lot P1 closest to the parking lot P3 is searched.

  The process of assigning the registered vehicles A, B, C of the drivers A, B, C to the three parking lots P1, P2, P3 thus searched is performed. This parking lot assignment process first calculates the total distance traveled from the entry points 72, 74, 76 to the parking lots P1, P2, P3 for all combinations of the registered vehicles A, B, C and the parking lots P1, P2, P3. ing. Next, a parking lot is allocated based on the combination having the smallest total travel distance among all the combinations.

  FIG. 22B is an allocation table 52 that stores the travel distances from the entry points 72, 74, and 76 of the registered vehicles A, B, and C to the parking lots P1, P2, and P3 with respect to the map 68. FIG. 22C shows a combination table 54 in which all combinations of the parking lots P1, P2, and P3 are registered for the registered vehicles A, B, and C, and the total distance in each combination is referred to the allocation table 52. Looking for.

  If this combination table 54 can be created, the parking lot P1 is set for the registered vehicle A based on the combination (ABC) = (P1, P2, P3) at the head of the table in which the total distance is 0.6 km, which is the shortest distance. For the registered vehicle B, the parking lot P2 is assigned, and for the registered vehicle C, the parking lot P3 is assigned.

  When the parking lot assignment process ends in step S5 in FIG. 18, the process returns to step S5 in the server 10 in FIG. 15, and the search result screen 82 shown in FIG.

  In the search result screen 82 of FIG. 23, as a result of searching by the parking lot search process on the map 68 including the venue 70 and the parking lot, the parking lots P1, assigned to the registered vehicles A, B, C are shown. P2 and P3 are displayed. When the user approves the parking lot assignment in the map 68, the user clicks the “Confirm” button 82-2.

  On the other hand, if it is desired to change the allocated parking lot, the “re-execute” button 82-1 is clicked. In FIG. 15, it is determined in step S105 that the parking lot has not been determined, and the process returns to step S104 to display the detailed condition input screen 64 of FIG. 17, and the user starts over from this detailed condition input.

  When the user clicks to confirm the parking lot in step S105 of the user terminal 11 in FIG. 15, a confirmation notification is sent to the server 10, and the server 10 executes a confirmation process in step S6. In the confirmation process in step S6, one parking lot P1, one parking lot P2, and one parking lot P3 are determined as a result of the search from the remaining number in the number work table 80 before confirmation shown in FIG. The determined number is subtracted to obtain the stored contents of the number work table 80 in FIG.

  Next, the process proceeds to step S7 in the server 10 of FIG. 15, and a route range determination process that becomes a route from the assigned parking lot to the venue is executed. Details of the route range determination processing in step S7 are shown in the flowchart of FIG.

  In FIG. 25, in the route range determination process for determining the route from the parking lot to the venue, in step S1, the mark code on the route from the parking lot to the arrival point (venue entrance) is stored in the route table for each registered vehicle. Store. For example, taking the map 68 of FIG. 26A as an example, the stored contents of the route table 46 as shown in FIG.

  That is, the parking lot P1 is assigned to the registered vehicle A, and the route from the parking lot P1 to the venue 70 with the number 0 is (8, 9, 10, 6, 3, 0) as a landmark code. This is registered in the route table 46. For the registered vehicle B, the route from the parking lot P2 to the venue is (7, 6, 3, 0) as a mark code, and this is registered in the route table 46. Further, the registered vehicle C has a mark code (15, 10, 6, 3, 0) because it is a route from the parking lot P3 to the venue 70. Further, regarding the route table 46, “R” is attached when turning right at the intersection, and “L” is attached when turning left.

  Next, the process proceeds to step S2 of FIG. Is stored in the guidance table. That is, as shown in the guide table 48 of FIG. 26B, in the route table 46, the intersection table “0”, that is, the route table No. Are registered in the guide table 48. This is No. for registered car A. No. 6 for registered vehicle B. No. 4 for registered car C. 5

Next, in step S3 of FIG. 25, the values in the route table 46 are compared from the bottom, and the last point where the mark codes match is set as the joining point. Specifically, as shown in FIG.
When searching for B and C from the bottom to the top of the table number, the mark codes for registered cars A, B, and C will match for "0, 3, 6" and will not match thereafter. Then, the point of the last mark code “6” that matches is set as the merge point.

  Next, if a merge point is set in step S4 of FIG. The route table No. of the point is indicated in the guidance table except for the registered car having. And a registered vehicle code to be a meeting partner is also stored.

  That is, as in the guide table 46 of FIG. Is the registered vehicle B, the registered vehicle B has the No. of the guide table 46. 4 is left as it is. For the other registered vehicles A and C, the route table No. indicating the mark code “6” that is the meeting point is shown. As for registered vehicle A, No. 4 for registered car C. 3 is stored. For the registered vehicle B, the registered content No. in the guidance table 48 at this stage. 4 is confirmed.

  Next, the process proceeds to step S5 in FIG. 25, and the mark codes are compared from the bottom to the registered cars that have not been confirmed. If they match, the process returns to step S4 to change and merge the guide table 46. Store the other party. That is, as shown in FIG. 26D, the registered vehicles A and C that have not been confirmed for the route table 46 are compared from the bottom to the top, and the mark code “10” matches here. To do.

  And the smallest route table No. at the junction. For the registered vehicle C other than the registered vehicle C, that is, for the registered vehicle A, the route table No. No. 3 is also stored, and the registered car C, which is the joining partner, is stored next to the mark code “10” of the registered car A in the route table 46. Since there is no matching mark code for the search from the bottom to the top after that, the series of route range determination processing ends.

  Next, it returns to step S8 in the server 10 of FIG. 15, and performs a car navigation transmission process. Since the car navigation transmission process is basically the same as the PC transmission process in step S9, the PC transmission process will be described in detail.

  FIG. 27 is a flowchart showing details of the PC transmission processing in step S9 of FIG. In the PC transmission process using the user terminal 11 as a personal computer, the presence / absence of a PC mail address is searched for the registrant reserved in step S1. Subsequently, in step S2, it is checked whether there is a registered car having no PC mail address. If there is, a check is made in step S3 whether the registered car having the PC mail address has the smallest registration number.

  If it is the smallest registered vehicle, the route information of the registered vehicle and the route information of the registered vehicle not having the PC mail address are transmitted by mail in step S4. On the other hand, if there is no registered vehicle that does not have a PC mail address in step S2 or if the registration number is not the smallest among registered vehicles that have a PC mail address in step S3, each registered vehicle is registered in step S5. Send route information by email.

  FIG. 28 is an explanatory diagram of the PC address table 92 referred to in the PC transmission process of FIG. In FIG. 28A, since the PC e-mail addresses are registered for all of the registered vehicles A, B, and C, the route information of each registered vehicle is transmitted to each of them by e-mail.

  On the other hand, in the case of FIG. 28B, the PC e-mail address is registered for the registered vehicles B and C, but the PC e-mail address is not registered for the registered vehicle A. In this case, the registration number The route information of the registered vehicle A that does not have the PC email address is added to the route information of the registered vehicle B with respect to the PC email address of the registered vehicle B having the smallest number, and the email is transmitted.

  FIG. 29 is an example of a transmission mail for the registered vehicle B corresponding to the PC address table 92 of FIG. In the transmission mail 94 for the registered vehicle B, the route information 94-1 for the registered vehicle A having no PC mail address is added to the route information 94-2 for the registered vehicle B and transmitted.

  As a result, the driver A of the registered car A who does not have the PC mail address receives the notification of the mail contents received by the user terminal of the driver B of the registered car B having the PC mail address, that is, the personal computer, and knows the reservation contents. be able to.

  Next, the mobile phone transmission process of step S10 in the server 10 of FIG. 15 is performed. The details of this cellular phone transmission process are shown in the flowchart of FIG. In the mobile phone transmission process of FIG. 30, if it is determined in step S1 that the vehicle is a registered car in which a mobile mail address is entered, the process proceeds to step S2, and the distance between routes, that is, from the assigned parking lot to the destination. Check if the distance is within 500m.

  If it is within 500 m, the amount of information that can be displayed on a map by a mobile phone is reached, so the process proceeds to step S3, where map information is created, and an email is transmitted in step S5. On the other hand, if the distance between routes is 500 m or more in step S2, text information is created in step S4 and mail is transmitted in step S5 because map information cannot be displayed on the mobile phone properly. .

  FIG. 31 is an explanatory diagram of the mobile phone mail reception screen 96 transmitted to the mobile phone in step S5 of FIG. This cellular phone mail reception screen 96 does not have map information, but has only the contents of “minimum route information” and “all route information” as text information.

  FIG. 32 is a flowchart of the text information creation process in step S4 of FIG. In this text information creation process, for the route table 46 created as shown in FIG. The contents of the mark code for each registered vehicle are described in order starting from 1. Subsequently, at step S2, if there is a merge point, right turn, or left turn, that point is described.

  FIG. 33 is a specific explanatory diagram of the text information creation process. FIG. 33 (A) shows the mark table 50, FIG. 33 (B) shows the registered vehicle A portion of the route table 46, and FIG. 33 (C). Next, the guide table 48 is taken out for the registered vehicle A, and based on these, text route information 98 as shown in FIG. 33 (D) is created.

  That is, the route table 46 No. Using the one mark code “8”, the mark table 50 is referred to and “Shinmachi intersection” is acquired. Also, “turn right” is acquired from “R” in the route table 46. Thus, “1. Shinmachi intersection right turn” on the first line of the text information 98 can be created. Similarly, the route table 46 No. Text information of “2. Shinmachi 2-chome intersection” is created for 2. Furthermore, route table No. For the mark code “10” of “3”, “Odori intersection” is acquired from the mark table 50, “Left turn” is acquired from “L” of the route table 46, and “(C ) ”. Here, referring to the guidance table 48, the registered vehicle A has a No. in the route table 46. 3 indicates the final position of the route information. The creation of text information is completed up to 3.

  FIG. 34 shows side-by-side mobile phone mail receiving screens 96, 100, and 102 created for registered vehicles A, B, and C. FIG. For the route information indicated as an index on the mail reception screens 96, 100, 102, map information is created when the distance between two points is within 500 m, and text information is created for 500 m or more. Since the mail reception screens 96 and 102 have text information, the text information is extracted and shown as text route information 104, 106, and 108 on the right side. Other route information is created as map information.

  Among these, in the mobile phone mail reception screen 96 of the registered car A, the text shown by extracting both the minimum route information and the entire route information as text information on the right side for the route information from the parking lot to the event venue. The route information 104, 106 is shown, but in the mail reception screen 102 of the registered vehicle C, the minimum route information from the parking lot to the junction is created as map information, and only for all route information The text route information 108 extracted and shown as text information is created.

  For this reason, even if a mobile phone has a low display capacity compared to a personal computer or car navigation device, the route information from the parking lot to the destination is sent to each mobile phone with text information or map information with approximately the same amount of information. Can be displayed.

  The server 10 and the personal computer 16 in FIG. 1 are realized by computer hardware resources as shown in FIG. 35, for example.

  35, the bus 201 of the CPU 200 has a RAM 202, a hard disk controller (software) 204, a floppy disk driver (software) 210, a CD-ROM driver (software) 214, a mouse controller 218, a keyboard controller 222, a display controller 226, A communication board 230 is connected.

  The hard disk controller 204 is connected to the hard disk drive 206 and loaded with a program for executing the parking reservation process according to the present invention. When the computer is started, the necessary program is called from the hard disk drive 206 and expanded on the RAM 202. To execute.

  A floppy disk drive (hardware) 212 is connected to the floppy disk driver 210 and can read / write data from / to the floppy disk (R). A CD drive (hardware) 216 is connected to the CD-ROM driver 214, and data and programs stored on the CD can be read.

  The mouse controller 218 transmits the input operation of the mouse 220 to the CPU 200. The keyboard controller 222 transmits an input operation of the keyboard 224 to the CPU 200. The display controller 226 performs display on the display unit 228. The communication board 230 uses a communication line 232 including radio, and performs communication with an external personal computer, a mobile phone, and a car navigation device.

  In the above embodiment, the event venue is taken as an example of the parking lot reservation target. However, the present invention is not limited to this, and stores and facilities where parking lots are distributed around the destination. For example, the parking lot reservation process can be applied to any destination in the same manner.

  In the above embodiment, a case where a plurality of units are reserved at the same time is taken as an example, but it is possible to reserve only one unit without any problem.

  Furthermore, the present invention includes appropriate modifications that do not impair the objects and advantages thereof, and is not limited by the numerical values shown in the above embodiments.

Here, the features of the present invention are enumerated as follows.
(Appendix)
(Appendix 1)
A search condition input step for inputting an event name, a reservation date, a desired parking number, a travel route from a departure place to a destination, and a driver terminal address of each car specified as search conditions,
On the travel route, a parking lot search step of searching for an empty parking lot as close as possible to the destination and assigning it to each car;
A search result notification step of notifying the driver terminal of each car of route information from the allocated parking lot and the allocated parking lot to the destination;
A parking lot reservation method characterized by comprising: (1)

(Appendix 2)
In the parking lot reservation method described in Appendix 1,
The search condition input step inputs an entry point of each vehicle for a predetermined search area including a destination and a parking lot,
The parking lot search step includes:
Search for the first available parking lot for the first vehicle, and search for the second and subsequent parking lots closest to the last searched empty parking lot to find the number of parking lots you want to park. The first step;
The second step of finding the total moving distance for all combinations of the entry point of each car and each searched empty parking lot, selecting the combination that minimizes the total moving distance, and assigning the searched parking lot to each car When,
A parking lot reservation method characterized by comprising: (2)

(Appendix 3)
In the parking lot reservation method described in Appendix 1,
The search condition input step inputs an entry point of each vehicle for a predetermined search area including a destination and a parking lot,
In the parking lot search step, when there are a plurality of entrances at the destination, the total travel distance from each entry point to each entrance is obtained for each entrance, and the entrance with the minimum total distance is set as the arrival point. A parking lot reservation method characterized by that. (3)

(Appendix 4)
In the parking lot reservation method described in Appendix 1,
The search condition input step inputs a terminal address corresponding to a terminal type such as a personal computer or a mobile terminal as the driver terminal address,
The search result notifying step generates route information corresponding to the terminal type and transmits the route information to the driver terminal.

(Appendix 5)
The parking lot reservation method according to appendix 4, wherein the search result notifying step creates and transmits route information based on a map when there is no restriction on the information display function of the driver terminal. Reservation method.

(Appendix 6)
In the parking lot reservation method according to attachment 4, in the search result notifying step, when the information display function of the driver terminal is limited, if the distance between the displayed routes is within a predetermined distance, the route information based on the map A parking lot reservation method characterized in that if the distance between displayed routes is greater than or equal to a predetermined distance, text route information is generated and transmitted.

(Appendix 7)
In the parking reservation method according to appendix 1, the search result notification step includes, as route information by the text, a merging point of routes from the next farthest parking lot to the destination in order of the farthest parking lot from the destination. A parking lot reservation method, characterized by notifying the guide information until.

(Appendix 8)
In the parking lot reservation method according to attachment 1, in the search result notifying step, when there is a vehicle without an input of the driver terminal address, there is no address input to the driver terminal inputting the driver terminal address. A parking reservation method, characterized by adding car route information and notifying.

(Appendix 9)
On the computer,
A search condition input step for inputting an event name, a reservation date, a desired parking number, a travel route from a departure place to a destination, and a driver terminal address of each car specified as search conditions,
On the travel route, a parking lot search step of searching for an empty parking lot closest to the destination and assigning it to each car;
A search result notification step of notifying the driver terminal of each car of route information from the allocated parking lot and the allocated parking lot to the destination;
A program characterized by having executed.

(Appendix 10)
A search condition input unit for inputting the event name, reservation date, desired number of parking spaces, the route from the departure place to the destination, and the driver terminal address of each car,
On the travel route, a parking lot search unit that searches for an empty parking lot closest to the destination and assigns it to each car,
A search result notification unit for notifying a driver terminal of each car of route information from the allocated parking lot and the allocated parking lot to the destination;
A parking lot reservation apparatus comprising:

Explanatory diagram of a parking lot reservation system to which the present invention is applied Explanatory drawing of the event table in FIG. Explanatory drawing of the date table in FIG. Explanatory drawing of the input table in FIG. Explanatory drawing of the parking lot table in FIG. Explanatory drawing of the registration vehicle table of FIG. Explanatory drawing of the arrival distance table of FIG. Explanatory drawing of the entrance table of FIG. Explanatory drawing of the search area table of FIG. Explanatory drawing of the route table in FIG. Explanatory drawing of the guidance table of FIG. Explanatory drawing of the mark table of FIG. Explanatory drawing of the allocation table in FIG. Explanatory drawing of the combination table of FIG. Time chart showing processing procedure of server and user terminal in FIG. Explanatory drawing of the search condition input screen sent to the user terminal Explanatory drawing of the detailed condition input screen sent to the user terminal Flowchart of parking lot search process in step S4 by the server of FIG. Explanatory drawing of the arrival point determination process by step S1 of FIG. Explanatory drawing of the work table and arrival distance table created by the arrival point determination process of FIG. Explanatory drawing of the range storage process of the search area by step S2 of FIG. Explanatory drawing of the parking lot allocation process by step S1 of FIG. Explanatory drawing of the search result screen displayed by step S5 of FIG. Explanatory drawing of the confirmation process by step S6 of FIG. The flowchart which showed the detail of the route range determination process by FIG.15 S7 Explanatory drawing of the route range determination process of FIG. Flowchart of PC transmission processing in step S9 of FIG. Explanatory drawing of the PC address table referred in the PC transmission processing of FIG. Explanatory drawing of the route information transmitted by the PC transmission process of FIG. Flowchart of cellular phone transmission processing in step S10 in FIG. Explanatory drawing of mobile phone mail transmitted in FIG. Flowchart of text information creation processing in FIG. Explanatory drawing of the text information creation process by FIG. Explanatory drawing of mail that sends route information according to the type of user terminal Explanatory drawing of the hardware environment of the computer which implement | achieves the server of FIG.

Explanation of symbols

10: Server 11: User terminal 12: Personal computer 14: Mobile phone 16: Car navigation device 18: Internet 20: Communication control unit 22: Parking lot reservation processing unit 24: Search condition input unit 26: Parking lot search unit 28: Search Result notification unit 30: Event table 32: Date table 34: Input table 36: Parking table 38: Registered car table 40: Arrival distance table 42: Entrance table 44: Search area table 46: Route table 48: Guide table 50: Marking table 52: Assignment table 54: Combination table 62: Search condition input screen 64: Detailed condition input screen 68: Map 70: Venue (destination)
72, 74, 76: entry points 86, 88, 90: route 92: PC address table 94: PC mail 96, 100, 102: mobile phone mail reception screen 98, 104, 106, 108: text route information

Claims (3)

A search condition input step for inputting an event name, a reservation date, a desired parking number, a travel route from a departure place to a destination, and a driver terminal address of each car specified as search conditions,
On the travel route, a parking lot search step of searching for an empty parking lot as close as possible to the destination and assigning it to each car;
A search result notification step of notifying the driver terminal of each car of route information from the allocated parking lot and the allocated parking lot to the destination;
A parking lot reservation method characterized by comprising:
In the parking lot reservation method according to claim 1,
The search condition input step inputs an entry point of each vehicle for a predetermined search area including a destination and a parking lot,
The parking lot search step includes:
Search for the first available parking lot for the first vehicle, and search for the second and subsequent parking lots closest to the last searched empty parking lot to find the number of parking lots you want to park. The first step;
The second step of finding the total moving distance for all combinations of the entry point of each car and each searched empty parking lot, selecting the combination that minimizes the total moving distance, and assigning the searched parking lot to each car When,
A parking lot reservation method characterized by comprising:
In the parking lot reservation method according to claim 1,
The search condition input step inputs an entry point of each vehicle for a predetermined search area including a destination and a parking lot,
In the parking lot search step, when there are a plurality of entrances at the destination, the total of the travel distances from the entry points to the entrances is obtained for each entrance, and the entrance with the minimum total distance is set as the arrival point. A parking lot reservation method characterized by that.

Images