Information processor
The information processing device addresses the issue of vehicles searching for parking by calculating the difference between actual and route distances, offering an index to improve guidance and congestion management.
Patent Information
- Application Number
- JP2023077021
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-09
- Publication Date
- 2024-11-21
- Estimated Expiration
- 2043-05-09
AI Technical Summary
Existing navigation systems fail to provide accurate information on available parking spaces, leading to vehicles searching for parking lots, which can cause traffic congestion and user dissatisfaction, making it difficult to distinguish and address such congestion effectively.
An information processing device that calculates and outputs an index based on the difference between the actual distance traveled by a vehicle searching for a parking spot and the distance on a predetermined route to the spot, using position sensors and navigation data to determine the vehicle's behavior before parking.
Provides an index quantifying the distance wasted in searching for parking, correlating with user dissatisfaction and traffic jam likelihood, enabling better guidance and congestion management.
Smart Images

Figure 2024161945000001_ABST
Abstract
Description
[Technical field]
[0001] The present invention relates to an information processing device. [Background technology]
[0002] Patent Document 1 discloses a system for obtaining real-time information about available parking spaces around a destination and providing guidance on a route to a parking space that meets certain conditions. [Prior art documents] [Patent documents]
[0003] [Patent Document 1] Patent Publication No. 2022-037197 Summary of the Invention [Problem to be solved by the invention]
[0004] It is an object of the present invention to provide an indication that a vehicle has traveled in search of parking. [Means for solving the problem]
[0005] One aspect of the present invention is an information processing device including a control unit configured to execute the following: acquire a parking location of a vehicle; acquire a first location which is a location where the vehicle first enters within a first predetermined distance from the parking location; acquire a first distance actually traveled by the vehicle from the first location to the parking location; acquire a second distance on a predetermined route from the first location to the parking location; and output an index corresponding to the behavior of the vehicle before parking in response to a comparison between the first distance and the second distance.
[0006] Further, other aspects of the present invention are an information processing method for causing a computer to execute the above-described information processing, a program for causing a computer to execute this information processing method, and a computer-readable storage medium on which this program is non-temporarily stored. Effect of the Invention
[0007] The present invention can provide an indication that a vehicle has traveled in search of parking spaces. [Brief description of the drawings]
[0008] [Figure 1] 1 is a diagram showing a schematic configuration of a system according to an embodiment. [Diagram 2] 1 is a diagram showing a travel path of a vehicle assuming that the vehicle travels from a first point toward a parking point from the beginning. FIG. [Diagram 3] FIG. 2 is a block diagram illustrating an example of a configuration of a vehicle and a server that configure the system according to the embodiment. [Figure 4] 5 is a flowchart showing a process of outputting a parking distance difference in the server in the first embodiment. [Diagram 5] 13 is a flowchart showing a process of outputting a parking distance difference in a server according to the second embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0009] If a parking lot recommended by the vehicle's navigation system becomes full before the user arrives at the parking lot, the user must search for another parking lot. If the navigation system does not provide information about parking lot availability, the user must search for an available parking lot on their own. In order to find a parking space, vehicles may drive around the vicinity. If many vehicles drive around in this way looking for a parking space, traffic congestion may occur. Furthermore, in tourist spots, user satisfaction may decrease. On the other hand, even if traffic congestion occurs due to such a cause, it may be difficult to distinguish it from traffic congestion caused by other causes. This may make it difficult to take appropriate measures to alleviate the traffic congestion.
[0010] In order to solve such problems, an information processing device that is one aspect of the present disclosure includes a control unit configured to perform the following operations: acquire a parking location of the vehicle; acquire a first location that is a location where the vehicle first enters within a first predetermined distance from the parking location; acquire a first distance that the vehicle actually travels from the first location to the parking location; acquire a second distance on a predetermined route from the first location to the parking location; and output an index corresponding to the behavior of the vehicle before parking in response to a comparison between the first distance and the second distance.
[0011] The parking location of the vehicle can be obtained by receiving, for example, a detection value of a position information sensor mounted on the vehicle from the vehicle. The parking location of the vehicle can be, for example, a location where the vehicle's system is shut down by operating the power switch of the vehicle, a location where the IG-ON state is changed to IG-OFF state, or a location where the door is locked from outside the vehicle. The first predetermined distance is a distance that causes a difference in the travel distance between when the vehicle runs around to search for a parking space before parking at the parking location and when the vehicle is parked toward the parking location from the beginning. The first predetermined distance is, for example, 1 km. The first point is a point where the vehicle first enters within the first predetermined distance from the parking location, so even if the vehicle moves outside the first predetermined distance from the parking location and then enters within the first predetermined distance again in one trip, the first point does not change. The first distance is a distance that the vehicle actually traveled from the first point to the parking location. This first distance can be obtained, for example, according to the travel history of the vehicle.
[0012] The control unit also acquires a second distance in the predetermined route. The predetermined route is, for example, a route of the vehicle when the vehicle travels from the beginning with the parking point as a target point. The predetermined route may be, for example, the shortest route from the first point to the parking point. The shortest route is, for example, a route that the vehicle can travel on a road that is passable in the shortest distance. As another example, the predetermined route may be a general route from the first point to the parking point. For example, a route in which a road that is relatively easy for the vehicle to pass, such as a main road, is preferentially selected may be the predetermined route. As another example, the predetermined route may be a route assumed to be a straight line connecting the first point to the parking point. In this case, the second distance is equal to the first predetermined distance.
[0013] Here, the difference between the first distance and the second distance becomes larger as the vehicle drives around in search of a parking space. In other words, the larger the difference between the first distance and the second distance, the longer the distance the vehicle has traveled in search of a parking space. Therefore, the difference between the first distance and the second distance can be treated as an index corresponding to the behavior of the vehicle before parking. By outputting this index, for example, the method of guiding the vehicle to the parking space can be reviewed. As another example, the ratio between the first distance and the second distance may be used as an index corresponding to the behavior of the vehicle before parking.
[0014] Hereinafter, an embodiment of the present invention will be described with reference to the drawings. The configurations of the following embodiments are examples, and the present invention is not limited to the configurations of the embodiments. In addition, the following embodiments can be combined as much as possible.
[0015] First Embodiment FIG. 1 is a diagram showing an outline of a system 1 according to an embodiment. In the example of FIG. 1, the system 1 includes a vehicle 10 and a server 30. Although one vehicle 10 is illustrated in FIG. 1 as an example, the present invention is not limited to this and there may be a plurality of vehicles 10. The vehicle 10 and the server 30 are connected to each other via a network N1. Note that the network N1 may be, for example, the Internet. The network N1 may be a global public communication network such as a wide area network (WAN) or other communication network. The network N1 may also include a telephone communication network such as a mobile phone, or a wireless communication network such as Wi-Fi (registered trademark).
[0016] FIG. 1 shows the travel path of the vehicle 10 until the vehicle 10 is parked at the parking point A2. In FIG. 1, the outline arrow indicates the traveling direction of the vehicle 10. First, the vehicle 10 passes through the first point A1. The first point A1 is the point where the vehicle 10 first entered within a first predetermined distance from the parking point A2. The first entry point here is, for example, the first entry point in the trip immediately before the vehicle 10 is parked at the parking point A2. The vehicle 10 travels from the first point A1 toward the first parking lot P1. However, since the first parking lot P1 is full, the vehicle 10 next travels toward the second parking lot P2. However, since the second parking lot P2 is also full, the vehicle 10 further travels toward the parking point A2 and is finally parked at the parking point A2. In this way, the vehicle 10 reaches the parking point A2 after passing through the first point A1, the first parking lot P1, and the second parking lot P2. In this manner, the vehicle 10 travels around within or outside the first predetermined distance from the parking spot A2 to reach the parking spot A2.
[0017] On the other hand, FIG. 2 is a diagram showing the travel path of the vehicle 10 when it is assumed that the vehicle 10 travels from the first point A1 to the parking point A2 from the beginning. In FIG. 2, the outline arrow indicates the traveling direction of the vehicle 10. The vehicle 10 reaches the parking point A2 from the first point A1 via the intersection A3. The difference between the actual travel distance (first distance) of the vehicle 10 shown in FIG. 1 and the assumed travel distance (second distance) of the vehicle 10 shown in FIG. 2 corresponds to the distance from the intersection A3 via the first parking lot P1 and the second parking lot P2 and back to the intersection A3. This difference in distance can be said to be the distance traveled by the vehicle 10 in vain to search for a parking lot. And, the shorter the difference in distance, the shorter the travel time can be, so that the user's satisfaction is increased and the occurrence of traffic congestion can be suppressed.
[0018] Therefore, the server 30 outputs an index according to the behavior of the vehicle 10 before parking, in response to a comparison between the first distance and the second distance. For example, this index is an index indicating how far the vehicle 10 has traveled to search for a parking space. This index is output, for example, as a difference between the first distance and the second distance. As another example, this index may be output as a ratio between the first distance and the second distance. For example, the server 30 causes a display to display the difference between the first distance and the second distance.
[0019] Next, the hardware and software configurations of the vehicle 10 and the server 30 will be described with reference to Fig. 3. Fig. 3 is a block diagram showing an example of the configuration of the vehicle 10 and the server 30 constituting the system 1 according to the present embodiment. The server 30 has a control unit 31, a storage unit 32, a communication module 33, and an input / output device 34.
[0020] The server 30 can be configured as a computer having a processor (CPU, GPU, etc.), a main storage device (RAM, ROM, etc.), and an auxiliary storage device (EPROM, hard disk drive, removable media, etc.). The auxiliary storage device stores an operating system (OS), various programs, various tables, etc., and by executing the programs stored therein, it is possible to realize various functions (software modules) that meet a predetermined purpose, as described below. However, some or all of the modules may be realized as hardware modules by hardware circuits such as ASICs and FPGAs.
[0021] The control unit 31 is a computing unit that executes a predetermined program to realize various functions of the server 30. The control unit 31 can be realized by a hardware processor such as a CPU. The control unit 31 also includes a RAM, a ROM (Read Only Memory), It may be configured to include a cache memory, etc. The control unit 31 will be described in detail later.
[0022] The storage unit 32 is a means for storing information, and is configured with a storage medium such as a RAM, a magnetic disk, a flash memory, etc. The storage unit 32 stores programs executed by the control unit 31, data used by the programs, etc. The storage unit 32 also has databases (vehicle information DB 321 and map information DB 322) built therein, and the vehicle information and map information collected from each vehicle 10 are stored in the databases.
[0023] The vehicle information DB321 stores position information and time information of the vehicle 10 linked to the vehicle ID. The position information and time information are linked to the vehicle ID and transmitted from the vehicle 10 at predetermined time intervals. The vehicle information DB321 also stores the startup state of the system of the vehicle 10. For example, the time when the system of the vehicle 10 started up (power-on time) and the time when the system was shut down (power-off time) are stored. Hereinafter, the vehicle ID, position information, time information, and information related to the startup state of the system of the vehicle 10 are collectively referred to as vehicle information. The control unit 31 stores the vehicle information received from the vehicle 10 in the vehicle information DB321.
[0024] In addition, the map information DB322 stores map information such as link data relating to roads (links), node data relating to node points, intersection data relating to each intersection, search data for searching routes, section data relating to sections, and lane data relating to the number of lanes.
[0025] The communication module 33 is a communication interface for connecting the server 30 to the network N1. The communication module 33 may be configured to include, for example, a network interface board, a wireless communication interface for wireless communication, etc. The server 30 can perform data communication with each vehicle 10 via the communication module 33.
[0026] The input / output device 34 is a means for receiving an input operation performed by an operator and presenting information to the operator. Specifically, the input / output device 34 includes devices for input such as a mouse and a keyboard, and devices for output such as a display and a speaker. The input / output device 34 may be integrally configured with, for example, a touch panel display.
[0027] Note that the specific hardware configuration of the server 30 may be such that components are omitted, replaced, or added as appropriate depending on the embodiment.
[0028] Next, the vehicle 10 will be described. The vehicle 10 includes a control unit 11, a storage unit 12, a communication module 13, a position information sensor 14, and a power switch. The control unit 11 is a calculation unit that realizes various functions of the vehicle 10 by executing a predetermined program. The control unit 11 can be realized by a hardware processor such as a CPU. The control unit 11 may also include a RAM, a ROM (Read Only Memory), a cache memory, and the like.
[0029] The storage unit 12 is a means for storing information, and is composed of storage media such as RAM, a magnetic disk, a flash memory, etc. The storage unit 12 stores programs executed by the control unit 11, data used by the programs, etc. The storage unit 12 stores detection values of the position information sensor 14.
[0030] The communication module 13 is a communication means for connecting the vehicle 10 to the network N1. In this embodiment, the vehicle 10 can communicate with other devices (e.g., the server 30) via the network N1 using mobile communication services such as 3G, LTE, 5G, and 6G. Cut.
[0031] The position information sensor 14 acquires position information (e.g., latitude and longitude) of the vehicle 10 at a predetermined period. The position information sensor 14 is, for example, a GPS (Global Positioning System) receiving unit. , wireless communication unit, etc.
[0032] The power switch 15 is a switch for changing the start-up state of the vehicle 10, and is a switch for starting the vehicle 10 or stopping the functions of the vehicle 10 by being pressed by the driver. A state in which the driver presses the power switch 15 to start the vehicle 10 is referred to as a power-on state, and a state in which the user presses the power switch 15 again to stop the functions of the vehicle 10 is referred to as a power-off state. The power switch 15 may be an IG switch. The power-on state corresponds to the IG-on state, and the power-off state corresponds to the IG-off state.
[0033] The control unit 11 of the vehicle 10 transmits the detection value of the position information sensor 14 and the startup state of the vehicle 10 together with the vehicle ID and time information to the server 30 at predetermined time intervals. In this manner, the control unit 11 of the vehicle 10 transmits the vehicle information to the server 30 at predetermined time intervals. Note that the startup state of the vehicle 10 may be transmitted to the server 30 only when the driver operates the power switch 15. Here, when the system of the vehicle 10 is not started, the server 30 can determine that the vehicle 10 is in a parked state.
[0034] Next, the control unit 31 of the server 30 will be described in detail. The control unit 31 of the server 30 calculates a first distance, which is the actual travel distance of the vehicle 10 from the first point A1 to the parking point A2, based on the vehicle information acquired from the vehicle 10. For this purpose, the control unit 31 identifies the parking point A2 of the vehicle 10 and the first point A1, which is the point where the vehicle 10 first entered within a first predetermined distance from the parking point A2. The parking point A2 is acquired from the vehicle information, for example, as the point where the system of the vehicle 10 is shut down. The first point A1 is acquired from the vehicle information as the point where the vehicle 10 first entered within a first predetermined distance from the parking point A2 in the trip in which the vehicle 10 moved to the parking point A2. The first distance can be calculated by calculating and accumulating the travel distance between the first point A1 and the parking point A2 from the position of the vehicle 10 at each time from the first point A1 to the parking point A2.
[0035] Further, the control unit 31 of the server 30 calculates the second distance. Therefore, the control unit 31 generates the shortest route from the first point A1 to the parking point A2. The shortest route is the route with the shortest distance among the routes that the vehicle 10 can travel from the first point A1 to the parking point A2. This shortest route may be a route presented when a route from the first point A1 to the parking point A2 is searched for by a navigation system.
[0036] Then, the control unit 31 calculates the difference between the first distance and the second distance. This difference is called the parking distance difference. The parking distance difference corresponds to the extra distance traveled by the vehicle 10 to search for a parking lot. After calculating the parking distance difference, the server 30 outputs the parking distance difference from the input / output device 34. At this time, for example, the parking distance difference is displayed on a display.
[0037] Next, a process of outputting the parking distance difference in the server 30 will be described. Fig. 4 is a flowchart showing a process of outputting the parking distance difference in the server 30 in the first embodiment. The flowchart shown in Fig. 4 is executed for each vehicle 10 in an area (referred to as a target area) that provides an index according to the behavior of the vehicle 10 before parking. Note that the description will be given assuming that the vehicle information DB 321 stores vehicle information corresponding to a plurality of vehicles 10. The target area can be arbitrarily set by the operator of the server 30.
[0038] In step S101, the control unit 31 determines whether the vehicle 10 is parked. For example, the control unit 31 determines that the vehicle 10 is parked when the state changes from a power-on state (which may be an IG-on state) to a power-off state (which may be an IG-off state). The state of the power switch 15 (which may be an IG switch) is included in the vehicle information transmitted from the vehicle 10 and is stored in the vehicle information DB 321. If a positive determination is made in step S101, the process proceeds to step S102, and if a negative determination is made, the routine is terminated.
[0039] In step S102, the control unit 31 extracts vehicle information of the target vehicle 10 from the vehicle information DB 321. In step S103, the control unit 31 acquires the parking spot A2. The control unit 31 acquires the position of the vehicle 10 at the time when the power switch 15 of the vehicle 10 is turned off as the parking spot A2. Next, in step S104, the control unit 31 acquires the first point A1. The control unit 31 acquires the point where the vehicle 10 first enters within a first predetermined distance (e.g., 1 km) from the parking spot A2 as the first point A1. At this time, the first point A1 is identified from the transition of the position of the vehicle 10 in the trip when the vehicle 10 arrives at the parking spot A2.
[0040] In step S105, the control unit 31 calculates a first distance. The control unit 31 calculates the distance that the vehicle 10 has actually traveled from the first point A1 acquired in step S104 to the parking point A2 acquired in step S103. At this time, the control unit 31 calculates the distance that the vehicle 10 has actually traveled from the transition of the position of the vehicle 10. In step S106, the control unit 31 generates the shortest route from the first point A1 acquired in step S104 to the parking point A2 acquired in step S103. The control unit 31 generates the shortest route by using information stored in the map information DB 322. A known technique can be used to generate this shortest route. Note that in this routine, the shortest route is generated. However, as another example, a route based on the travel history of the other vehicle 10 may be generated. For example, the shortest route among the routes that the other vehicle 10 has traveled from the first point A1 to the parking point A2 may be generated in step S106. As yet another example, the route traveled by the most number of vehicles 10 among the routes traveled by the other vehicles 10 from the first point A1 to the parking point A2 may be generated in step S106. In this way, a realistic index can be obtained by comparing the routes actually traveled by the other vehicles 10. As another example, a route connecting the first point A1 to the parking point A2 with a straight line may be generated in step S106. In this way, the shortest route can be generated simply without requiring map data. Therefore, the cost of using map data and the cost of searching for the shortest route are not required.
[0041] In step S107, the control unit 31 calculates the second distance. The control unit 31 calculates the distance of the shortest route generated in step S106 based on the map information stored in the map information DB 322. A known technique can be used for this calculation. As another example, when a route that connects the first point A1 to the parking point A2 in a straight line is generated in step S106, the first predetermined distance used in step S104 can be used as the second distance.
[0042] In step S108, the control unit 31 calculates the parking distance difference. The control unit 31 calculates the parking distance difference by subtracting the second distance calculated in step S107 from the first distance calculated in step S105. Then, in step S108, the control unit 31 outputs the parking distance difference calculated in step S108 as an index according to the behavior of the vehicle 10 before parking. Note that the parking distance difference calculated in step S108 may be stored in the storage unit 32 and the parking distance difference may be output in response to a request from the operator.
[0043] As described above, according to this embodiment, the parking distance difference can be calculated and provided as an index according to the behavior of the vehicle 10 before parking at the parking spot A2. This makes it possible to quantify how far one vehicle 10 has driven around in search of a parking space. In other words, it becomes possible to determine how much unnecessary distance the vehicle 10 has traveled before parking. This index correlates with the degree of user dissatisfaction and the likelihood of traffic jams occurring, and can therefore be used to improve these. It is also possible to provide the percentage of vehicles 10 that have driven around in search of a parking space.
[0044] <Second embodiment> In the second embodiment, the parking distance difference is calculated only for the vehicles 10 whose distance from the departure point of the vehicle 10 to the parking point A2 is equal to or greater than the second predetermined distance. Here, the parking distance difference provided in the first embodiment can be provided as an index for the case where a tourist drives around the tourist spot to search for a parking space at the tourist spot, for example. However, if the case where a person living in the tourist spot drives around the tourist spot to do daily shopping or the like is also included, it will not be in keeping with the purpose. Therefore, in the second embodiment, the parking distance difference is provided excluding the behavior of the vehicle 10 of the local resident. Here, the departure point of the vehicle 10 of the local resident is considered to be at a certain distance from the parking point A2. Therefore, the vehicle 10 of the local resident can be excluded by calculating the parking distance difference only for the vehicles 10 whose distance from the departure point of the vehicle 10 to the parking point A2 is equal to or greater than the second predetermined distance. The second predetermined distance is stored in the storage unit 32 as a distance at which the vehicle 10 of the local resident can be excluded.
[0045] Next, a process of outputting the parking distance difference in the server 30 will be described. Fig. 5 is a flowchart showing a process of outputting the parking distance difference in the server 30 in the second embodiment. The flowchart shown in Fig. 5 is executed for each vehicle 10 in the target area. Note that the description will be given assuming that the vehicle information DB 321 stores vehicle information corresponding to a plurality of vehicles 10. Also, a description of the steps in which the same process as in the flowchart shown in Fig. 4 is executed will be omitted.
[0046] In the flowchart shown in FIG. 5, when the process of step S103 is completed, the process proceeds to step S201. In step S201, the control unit 31 acquires a starting point. The starting point is a point where the vehicle 10 starts in the trip in which the vehicle 10 moves to the parking spot A2. This starting point is a point where the power switch 15 is operated to change from a power-off state to a power-on state. In step S202, the control unit 31 calculates a distance from the parking spot A2 acquired in step S103 to the starting point acquired in step S201. This distance is, for example, a straight-line distance. Then, in step S203, the control unit 31 determines whether the distance calculated in step S202 is equal to or greater than a second predetermined distance. If the determination in step S203 is affirmative, the process proceeds to step S104, and if the determination is negative, the control unit 31 ends this routine.
[0047] As described above, according to this embodiment, it is possible to provide an index corresponding to the behavior of the vehicle 10 before parking with higher accuracy.
[0048] <Other embodiments> The above embodiment is merely an example, and the present invention may be modified as appropriate within the scope of the gist of the present invention. The processes and means described in this disclosure may be freely combined and implemented as long as no technical contradiction occurs. In addition, a process described as being performed by one device may be shared and executed by multiple devices. Alternatively, a process described as being performed by different devices may be executed by one device. In a computer system, the hardware configuration (server configuration) by which each function is realized can be flexibly changed.
[0049] Also, for example, the first predetermined distance for identifying the first point may be set according to the density of parking lots. For example, if the distance between parking lots is long and the first predetermined distance is set relatively short, the vehicle 10 may drive around to search for a parking lot outside the first predetermined distance. Therefore, a more realistic indicator can be obtained by setting the first predetermined distance according to the range in which the vehicle 10 is expected to drive around. Therefore, the lower the density of parking lots, the longer the first predetermined distance may be.
[0050] The control unit 31 may further be configured to obtain a first ratio, which is the ratio of the vehicles 10 among the plurality of vehicles 10 whose difference between the first distance and the second distance is equal to or greater than a predetermined difference during a busy season; obtain a second ratio, which is the ratio of the vehicles 10 among the plurality of vehicles 10 whose difference between the first distance and the second distance is equal to or greater than a predetermined difference during a slow season; and output a ratio obtained by subtracting the second ratio from the first ratio as the ratio of the vehicles 10 that searched for a parking lot during the busy season. Here, the behavior during the slow season is considered to be behavior corresponding to the daily life of local residents. Furthermore, the vehicles 10 of local residents behave similarly to those in the slow season even during the busy season. Since this behavior is not behavior for searching for a parking lot, the accuracy of the index can be improved by excluding it from the ratio of the vehicles 10 that searched for a parking lot during the busy season.
[0051] Furthermore, when the vehicle 10 stops at a predetermined facility, the control unit 31 may acquire the distance that the vehicle 10 actually traveled from the predetermined facility to the parking spot A2 as the first distance. Here, the travel to the predetermined facility where pick-up and drop-off are performed is not a behavior for searching for a parking lot, so the accuracy of the index can be improved by treating the subsequent behavior as the behavior of the vehicle 10 that has searched for a parking lot. The predetermined facility is, for example, a station or a school.
[0052] The present invention can also be realized by supplying a computer program implementing the functions described in the above embodiments to a computer, and having one or more processors of the computer read and execute the program. Such a computer program may be provided to the computer by a non-transitory computer-readable storage medium connectable to the system bus of the computer, or may be provided to the computer via a network. Non-transitory computer-readable storage media include, for example, any type of disk, such as a magnetic disk (floppy disk, hard disk drive (HDD), etc.), an optical disk (CD-ROM, DVD disk, Blu-ray disk, etc.), a read-only memory (ROM), a random access memory (RAM), an EPROM, an EEPROM, a magnetic card, a flash memory, an optical card, and any type of medium suitable for storing electronic instructions. [Explanation of symbols]
[0053] 1 System 10 Vehicles 30 Servers 31 Control Unit 32 Storage section 33 Communication Module 34 Input / Output Devices
Claims
1. Obtaining a parking location of the vehicle; acquiring a first point that is a point where the vehicle first enters within a first predetermined distance from the parking point; obtaining a first distance that the vehicle actually travels from the first location to the parking location; Obtaining a second distance along a predetermined route from the first location to the parking location; outputting an index corresponding to a behavior of the vehicle before parking in response to a comparison between the first distance and the second distance; An information processing device comprising a control unit configured to execute the above.
2. The control unit acquires a distance in a shortest route as the second distance. The information processing device according to claim 1 .
3. The control unit acquires the first predetermined distance as the second distance. The information processing device according to claim 1 .
4. The control unit acquires, as the second distance, a distance corresponding to a route of another vehicle from the first point to the parking point in the past, which is stored in a storage unit. The information processing device according to claim 1 .
5. The control unit outputs the indicator only to a vehicle whose starting point is a point that is a second predetermined distance or more from the parking point. The information processing device according to claim 1 .
Citation Information
Patent Citations
Path finding device, path finding method, path finding program, and recording medium
JP2008180678A
Guidance system and guidance program
JP2018080933A
Parking lot navigation method and system
JP2022037197A
