JP2012215920A - Car sharing system and car sharing method - Google Patents

Car sharing system and car sharing method Download PDF

Info

Publication number
JP2012215920A
JP2012215920A JP2011078866A JP2011078866A JP2012215920A JP 2012215920 A JP2012215920 A JP 2012215920A JP 2011078866 A JP2011078866 A JP 2011078866A JP 2011078866 A JP2011078866 A JP 2011078866A JP 2012215920 A JP2012215920 A JP 2012215920A
Authority
JP
Japan
Prior art keywords
boarding
place
terminal
car sharing
person
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
JP2011078866A
Other languages
Japanese (ja)
Other versions
JP5773706B2 (en
Inventor
Kazuhiro Muto
Kota Asai
一浩 武藤
康太 浅井
Original Assignee
Japan Research Institute Ltd
株式会社日本総合研究所
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Japan Research Institute Ltd, 株式会社日本総合研究所 filed Critical Japan Research Institute Ltd
Priority to JP2011078866A priority Critical patent/JP5773706B2/en
Publication of JP2012215920A publication Critical patent/JP2012215920A/en
Application granted granted Critical
Publication of JP5773706B2 publication Critical patent/JP5773706B2/en
Application status is Active legal-status Critical
Anticipated expiration legal-status Critical

Links

Images

Abstract

PROBLEM TO BE SOLVED: To provide a car sharing system for enabling a getting-off candidate who is going to get off a car, and desires to turn over the car to a getting-on candidate to adjust a time or place with the getting-on candidate, and to achieve the matching of car use.SOLUTION: A car sharing system is configured to accept, from a getting-off candidate terminal 10 and a getting-on candidate terminal 20, the input of a place and time where and when a getting-off candidate and a getting-on candidate desire to get-off and get-on a car, and to search whether or not there exists a getting-on candidate 27 within the predetermined range of the getting-off place on a getting-off scheduled time on the basis of the received getting-on place and getting-on scheduled time, and to, when there does not exist the getting-on candidate 27, extend the range of the getting-off place, and to research whether or not there exists the getting-on candidate 27 on the basis of the received getting-on place and getting-on scheduled time.

Description

  The present invention relates to a car sharing system and a car sharing method, and more particularly, to a technology in which a customer efficiently performs car sharing using information communication technology.

  Today, awareness of environmental issues is improving, so socially friendly vehicles and socially friendly transportation systems are desired. In particular, car sharing has attracted attention from the viewpoint of reducing CO2 emissions. Car sharing is generally a service that uses a vehicle in a shorter time and a shorter distance than a rental car. For example, car sharing is used in certain areas of the community, such as around shopping streets and around city halls. In other words, car sharing can be performed in a narrow area with regional characteristics, thereby enhancing the vehicle utilization efficiency and the CO2 reduction effect. Moreover, the vehicle for performing this car sharing is an electric vehicle or a hybrid vehicle, so that the reduction effect can be further enhanced.

  In order to efficiently execute this car sharing, a method of performing car sharing by adjusting a schedule between a rider who desires to ride a vehicle and a person who drives the vehicle is known (for example, Patent Documents). 1). Moreover, in patent document 2, in order to share one vehicle with several persons, using the vehicle with a server and performing car sharing is disclosed.

JP 2005-182146 A JP 2002-342878 A

  However, in Patent Document 1 and Patent Document 2, a person who is currently driving (a person who wants to get off the vehicle) does not perform matching with a person who wants to get on the vehicle in order to discard the vehicle. Currently, when a person who wants to get off a car, he / she drops the vehicle at a car station which is a predetermined vehicle yard. However, if you change trains not only at this car station, but also at the designated safe place, if you want to get on and get off, the convenience of those who want to get off and those who want to get on will be improved. It is thought that the use of will become active.

  Furthermore, it is often difficult to exactly match the boarding location and boarding time desired by the rider with the boarding location and boarding time desired by the passenger who wants to get off. It is necessary to make adjustments within a range slightly different from the time or place.

  Therefore, in the present invention, a car sharing system that allows a vehicle rider who wants to get off the vehicle and change the ride with the rider can adjust the time or place with the rider and match the use of the vehicle. And to provide a car sharing method.

In order to solve the above problems, the input device of the present invention includes the following solution.
(1) A car sharing server that is communicably connected to a passenger requesting terminal that is used by a passenger who wants to ride and a passenger terminal that is desired to be used by a passenger who wants to get off. There,
Boarding person terminal data receiving means for receiving boarding place and boarding time data from the boarding terminal;
Alighting destination terminal data receiving means for receiving data of alighting location and a scheduled time of getting off from the alighting desire terminal,
Ride applicant search means for searching for whether or not there is a person who wants to get in a predetermined range of the alighting location at the received scheduled time of getting off based on the received location and the scheduled time of boarding. When,
If there is no person who wants to get on the board, the predetermined range of the place to get off is expanded, and whether or not the person who wants to get on is present is searched again based on the received boarding place and the scheduled boarding time. And a re-search means.

  That is, the car sharing server receives the data of the boarding place and the scheduled boarding time from the boarding requester terminal, and receives the data of the boarding place and the scheduled boarding time from the boarding terminal. Then, based on the received boarding location and the scheduled boarding time, whether or not there is a person who wants to board in the predetermined range of the boarding location at the received scheduled boarding time. Here, when there is no person who wants to get on the board, the predetermined range of the place to get off is enlarged, and whether or not there is a person who wants to get on is searched again based on the boarding place and the scheduled boarding time. Therefore, the user who gets off the vehicle and desires to get off the vehicle can change the time or place with the person who wants to get on the vehicle and match the use of the vehicle.

  (2) The car sharing server may further include the following solution. As a result of the search by the rider searching means and the re-searcher, if it is determined that there is a passenger who wants to get on, data for displaying the number of riders on the map around the disembarking place is displayed. Data transmission means for transmitting to the terminal for requesting to get off the vehicle is provided.

  Therefore, it is possible to display the number of people who want to get on the map around the place of getting off specified by the person who wants to get off.

  (3) The car sharing server may further include the following solution. The boarding applicant search means and the re-search means refer to the storage amount of the vehicle to determine whether or not the boarding person is present within a predetermined range of the boarding place and the received boarding location. A search is performed based on the scheduled boarding time.

  Therefore, the boarding location can be determined based on the amount of power stored in the vehicle.

  (4) The car sharing server may further include the following solution. The get-off person terminal data receiving means receives the travel route of the vehicle, and if the re-search means determines that the rider does not exist, a predetermined getting-off is performed on the received travel route. It is characterized by proposing a place.

  Therefore, it is possible to propose a rider who desires a boarding place on the travel route of the vehicle to a person who wants to get off.

(5) The car sharing system may further include the following solution. A car sharing server that is communicably connected to a passenger requesting terminal that is used by a passenger who wants to ride and a passenger who wants to get off a vehicle, and that matches the use of a vehicle that is used by the passenger who wants to get off.
Boarding person terminal data receiving means for receiving boarding place and boarding time data from the boarding terminal;
Alighting destination terminal data receiving means for receiving data of alighting location and a scheduled time of getting off from the alighting desire terminal,
An undesired person searching means for searching whether or not there is a person who wants to get off at a predetermined range of the boarding place at the received boarding time based on the received place and the scheduled time of getting off. ,
When there is no person who wants to get off, the predetermined range of the place to get off is expanded, and whether or not the person who wants to get off is present is searched again based on the received place to get off and the scheduled time to get off. And a re-search means.

  That is, the car sharing server receives the data of the boarding place and the scheduled boarding time from the boarding requester terminal, and receives the data of the boarding place and the scheduled boarding time from the boarding terminal. Then, at the received scheduled boarding time, a search is made based on the received boarding location and the scheduled getting-off time whether or not there is a person who wants to get off in a predetermined range of the boarding location. Here, when there is no person who wants to get off, the predetermined range of the place to get off is expanded, and whether or not there is a person who wants to get off is searched again based on the received place to get off and the scheduled time of getting off. Therefore, the rider who uses the vehicle can get off the vehicle, adjust the time or place with the rider who wants to change the train, and match the use of the vehicle.

  (6) The car sharing system may further include the following solution. As a result of the search by the get-off request search means and the re-search means, when it is determined that the get-off request exists, the data for displaying the number of vehicles of the get-off request on the map around the get-off place Is provided with a map transmission means for transmitting the information to the passenger requesting terminal.

  Accordingly, it is possible to display the number of vehicles of the person who wants to get off the vehicle on the map around the boarding place designated by the person who wants to get on the vehicle.

  According to the present invention, a car sharing system that enables a vehicle rider who wants to get off a vehicle and change a train with a rider can adjust the time or place with the rider and match the use of the vehicle. And a car sharing method can be provided.

It is a figure showing the whole car sharing system which is a suitable embodiment of the present invention. It is a figure which shows the functional block of the boarding applicant terminal 20, the passenger requesting terminal 10, and the car sharing server 100 which comprise the car sharing system which is suitable embodiment of this invention. It is a flowchart which shows the car matching process (get-off person side) which is preferred embodiment of this invention. It is a figure which shows the screen image displayed on the alighting person terminal 10 which is suitable embodiment of this invention. It is a flowchart which shows the search range table which is suitable embodiment of this invention. It is a flowchart which shows the car matching process (boarding person side) which is suitable embodiment of this invention. It is a figure which shows the screen image displayed on the boarding applicant terminal 20 which is suitable embodiment of this invention.

  DESCRIPTION OF EMBODIMENTS Hereinafter, embodiments for carrying out the present invention (hereinafter referred to as embodiments) will be described in detail with reference to the accompanying drawings. Note that the same reference numerals are assigned to the same elements throughout the description of the embodiment.

[Overall configuration of car sharing system]
FIG. 1 is a diagram illustrating an overall configuration of a car sharing system 1. The car sharing system 1 includes vehicles 50a and 50b (hereinafter referred to as vehicles 50) that are driven by passengers 17a and 17b (hereinafter referred to as passengers 17), and terminals 10a and 10b (hereinafter referred to as vehicles) mounted on the vehicle 50. , Boarding request terminal 10a, public line network 3, car sharing server 100, boarding terminal 27a, 27b (hereinafter, boarding person 27) used by boarding terminal 20a, 20b (hereinafter, boarding request) Terminal 20). In FIG. 1, only two passenger requesting terminals 10 and two passenger requesting terminals 20 are shown. However, a large number of passenger requesting terminals 10, passenger requesting terminals 20 and the car sharing server 100 are communicably connected. It is desirable that

  In the present embodiment, the vehicle 50 applied in the car sharing system 1 will be described on the assumption that it is an automobile, but it may be a bicycle, a motorcycle, or the like.

  The getting-off passenger terminal 10, the passenger requesting terminal 20, and the car sharing server 100 are communicably connected to each other via the public network 3 regardless of whether they are wired or wireless.

  Based on FIG. 2, components of the car sharing system 1 will be described.

  The disembarkation requester terminal 10 is a terminal that is used by a disembarkation requester 17 who uses the vehicle 50 and desires to dismount the vehicle 50 at a predetermined location. The disembarkation requester terminal 10 is a terminal mounted on a vehicle and may be a car navigation system. That is, as long as it is provided with the control unit 11, the data storage unit 12, the data communication unit 13, the touch panel unit 14, and the GPS unit 15, the get-off applicant terminal 10 may be any on-vehicle device.

  The control unit 11 includes a CPU (Central Processing Unit), a RAM (Random Access Memory), a ROM (Read Only Memory), and the like, and includes a wireless communication device connected to the public network 3 as the data communication unit 13. The data storage unit 12 includes one or both of an HDD (Hard Disk Drive) and an SSD (Solid State Drive). Furthermore, the touch panel unit 14 includes a display unit such as a liquid crystal monitor that displays an image, and includes a touch panel that accepts input from the user and an input unit such as voice input.

  The GPS unit 15 is a device that can receive radio waves from a GPS (Global Positioning System) satellite, and by operating the control unit 11 to calculate the distance to the GPS satellite, It is a device which can calculate position information (latitude, longitude).

  When the car navigation system is installed, the data storage unit 12 stores map data for guiding the vehicle to the destination.

  The boarding applicant terminal 20 is a terminal used by a boarding applicant 27 who wants to board the vehicle 50 at a predetermined place. The passenger requesting terminal 20 may be a smartphone, a mobile phone, a notebook computer, an electronic book terminal, a slate terminal, or the like. The passenger requesting terminal 20 may be an arbitrary communication terminal as long as it includes the control unit 21, the data storage unit 22, the data communication unit 23, and the touch panel unit 24. Furthermore, it is desirable to include a GPS unit 25.

  The control unit 21 includes a CPU (Central Processing Unit), a RAM (Random Access Memory), a ROM (Read Only Memory), and the like. The data communication unit 23 includes a wireless communication device, and the data storage unit 22 includes an HDD ( One or both of a hard disk drive (Shard Disk Drive) and an SSD (Solid State Drive) are provided. Furthermore, the touch panel unit 24 includes a display unit such as a liquid crystal monitor that displays an image, and includes a touch panel that accepts input from the user and an input unit such as voice input.

  The GPS unit 25 is a device that can receive radio waves from a GPS (Global Positioning System) satellite, and by calculating the distance to the GPS satellite in cooperation with the control unit 21, the position on the earth It is a device capable of calculating information (latitude, longitude).

  The car sharing server 100 is a server that adjusts the scheduled boarding time (scheduled boarding time) and the boarding place (boarding site) of the boarding applicant terminal 20 and the boarding terminal 10. The car sharing server 100 includes a control unit 101, a data communication unit 103, a member ID database 104, and a map database 105.

  The control unit 101 includes a CPU (Central Processing Unit), a RAM (Random Access Memory), a ROM (Read Only Memory), and the like. The data communication unit 103 includes a communication device that is communicably connected to the public line network 3.

  The member ID database 104 is a database in which member IDs of members registered in the car sharing system 1 are stored. The member ID is transmitted / received from the disembarkation applicant terminal 10 and the passenger request terminal 20, and the member ID database 104 determines whether the transmitted / received member ID is usable in the car sharing system 1.

  The map database 105 stores map data on which the vehicle 50 travels, and searches for a predetermined place on the map data from the time and place received from the passenger requesting terminal 10 and the passenger requesting terminal 20.

  The control unit 101 appropriately accesses the member ID database 104 and the map database 105 and executes each process described later.

  The car sharing server 100 cooperates with these hardware components to obtain a passenger terminal data receiving means, a passenger requesting terminal data receiving means, a passenger requesting search means, a re-searching means, a passenger requesting means searching means, and a data transmitting means. Is realized.

[Car matching processing (for those who want to get off)]
Next, with reference to FIG. 3, the car matching process executed by the get-off applicant terminal 10, the car sharing server 100, and the ride-on applicant terminal 20 will be described. The car matching process includes a process for a person who wants to get off and a process for a person who wants to get on the vehicle as will be described with reference to FIG.

  First, the boarding applicant terminal 20 transmits the boarding location and the boarding scheduled time to the car sharing server 100 according to the input operation of the boarding applicant 27 (step S01). For example, a map may be displayed on the rider desire terminal 20 and an entry of a scheduled ride time, which is a desired ride time, may be received from the rider 27 at a place where the ride is desired on the map.

  The car sharing server 100 stores the boarding location and the scheduled boarding time received from the boarding applicant terminal 20 (step S02).

  On the other hand, the terminal 10 for getting off the terminal accepts the input of the destination as the destination of the vehicle 50 from the person 17 for getting off the car (step S03). The terminal 10 for getting off the vehicle determines the location of the vehicle 50 and the scheduled time of getting off from the destination, and transmits the determined location and the scheduled time of getting off to the car sharing server 100 (step S04). Although not shown, the car sharing server 100 receives and stores the transmitted getting-off location and scheduled get-off time.

  In addition, the car sharing server 100 may receive and store data on a travel route from the disembarkation applicant terminal 10 to the destination.

  Next, the car sharing server 100 searches based on the received boarding location and the scheduled boarding time whether or not there is a passenger who wants to board in the predetermined range of the boarding location at the received scheduled boarding time (step). S05). In the first search, the car sharing server 100 searches the first search range with reference to the search range table shown in FIG.

  The search range table is a table for determining a range when searching for the rider who wants to get on or 27 who gets off the vehicle, and is a table stored in the car sharing server 100. Although details will be described later, the search range changes according to the number of searches, the first search that is the first search, the second search that is the second search, and the like. The search range table is a table in which the number of searches and the search range are associated with each other.

  This will be described with reference to FIG. FIG. 4 is a screen image displayed on the terminal 10 for getting off the passenger. It is assumed that the terminal 10 for which the user wishes to get off determines the point A as the place of getting off and the scheduled time of getting off is 14:50. In the first search, referring to the search range table, the search range is 30 meters, and it is searched whether or not there is a rider 27 within the circle range with the radius of 30 meters centered on the point A.

  In FIG. 4, since the search has not been performed (step S06: “NO”), the process proceeds to step S07. In step S07, the car sharing server 100 determines the radius of the next expanded circle with reference to the search range table in order to perform the second search as the search range expansion process.

  Then, the process returns to step S05, and a search for passengers who wish to board is performed again. In this example, when the second search is performed with a radius of 200 meters, the point 41 and the point 42 of the passenger who wants to get on are searched (step S06: “YES”). The car sharing server 100 transmits the scheduled boarding times and the boarding locations of the searched points 41 and 42 to the get-off destination terminal 10 (step S08).

  The get-off desiring person terminal 10 receives the boarding location and the scheduled boarding time, and accepts an operation from the getting-off candidate 17 to accept the boarding place and the scheduled boarding time (step S09).

  For example, the screen image of FIG. Here, the route of the vehicle 50 to the destination A point is displayed, which indicates that the vehicle 50 arrives at the point A at 14:50. In addition, each circle of the first search range and the second search range is shown for explanation of the embodiment, and does not have to be displayed on the get-off applicant terminal 10.

  The point 41 and the point 42 are at least composed of the boarding place of the rider 27 and the scheduled boarding time, and may include the number of riders 27 who want to board at the same boarding place. For example, the point 42 indicates that three riders 27 want to ride around 15:05 at this point on the map.

  Here, when the person who wants to get off the vehicle selects and selects either the point 41 or the point 42 and accepts the boarding place and the scheduled boarding time (step S09: “YES”), the car sharing server is determined as the matching is established. 100 is notified (step S11).

  If it is not possible to accept the boarding place and the scheduled boarding time at either the point 41 or the point 42 (step S09: NO), the person who wishes to get off the vehicle notifies the car sharing server 100 that the matching is not established (step S10). In response to this, the car sharing server 100 executes the search range expansion process (step S07) again. For example, referring to the search range table, the third search is performed again with a radius of 1 km (step S05).

  In step S12, the car sharing server 100 determines the time and place of the approved boarding scheduled time and boarding place, and transmits the decision to the boarding terminal 20 and the boarding terminal 10 (step S13). In response to this, the boarding applicant terminal 20 and the boarding terminal 10 display the determined location and time (steps S14 and S15).

  The vehicle 50 is an automobile that consumes a predetermined fuel, for example, a gasoline automobile that consumes fuel such as gazoline, a fuel cell vehicle that uses hydrogen as fuel, and an electric automobile that consumes electricity. In this case, depending on the amount of fuel and the amount of electricity stored, the disembarkation place desired by the disembarkation requester 17 is forcibly replenished with fuel (a gasoline station if gasoline) or a storage battery charging station (hereinafter, “ It may be set to “replenishment station”). That is, when the rider 27 uses the replenishment station as the boarding place, the replenishment station may be set as the getting-off place with reference to the charge amount of the vehicle 50. For example, charging is performed when the amount of electricity stored in the vehicle 50 falls below a predetermined rate (for example, 30% or below), or when the amount of electricity stored in the vehicle 50 falls below a predetermined rate when reaching the destination. Set the place to get off at the station.

  Similarly, when the power storage amount of the vehicle 50 is small, a place where the travel distance is short may be set as the getting-off place. That is, when the person who wants to board 27 uses the place where the travel distance is short as the boarding place, the boarding place may be set as the getting-off place with reference to the charge amount of the vehicle 50.

  In the search range table, the search range is expanded by enlarging the range of the circle centered on the destination in the above description. However, other than this, for example, the search range table is far from the destination, and up to the destination. The search range may be expanded on the extended line of the travel route.

[Car matching process (on the rider)]
Next, with reference to FIG. 6, a car matching process executed by the passenger requesting terminal 20, the car sharing server 100, and the passenger leaving terminal 10 will be described.

  First, the get-off request terminal 10 transmits a get-off place and a scheduled get-off time to the car sharing server 100 in response to an input operation of the get-off request person 17 (step S20). For example, a map may be displayed on the person who wants to get off the vehicle, and an input of a scheduled time of getting off, which is a time when the user wants to get off, may be received from the person who wants to get off the vehicle on the map.

  The car sharing server 100 stores the getting-off location and the expected getting-off time received from the getting-off request terminal 10 (step S21).

  On the other hand, the boarding applicant terminal 20 receives the boarding place and the scheduled boarding time input from the boarding applicant 27 (step S22). The boarding applicant terminal 20 transmits the boarding scheduled time and boarding location to the car sharing server 100 (step S23). Although not shown, the car sharing server 100 receives and stores the transmitted boarding time and boarding place.

  Next, the car sharing server 100 searches based on the received getting-off location and the scheduled getting-off time whether or not there is a person who wants to get off in the predetermined range of the getting-on location at the received scheduled getting-on time (step). S24). In the first search, the car sharing server 100 searches the first search range with reference to the search range table shown in FIG.

  This will be described with reference to FIG. FIG. 7 is a screen image displayed on the rider desire terminal 20. The boarding applicant terminal 20 determines the point B as a boarding place, and this boarding time is assumed to be 15:00. In the first search, when the search range table is referred to, the search range is 30 meters, and it is searched whether or not there is a person 17 who wants to get off in the circle range with the point B as the center and a radius of 30 meters.

  In the example of FIG. 7, since the search has not been performed (step S25: “NO”), the process proceeds to step S26. In step S26, the car sharing server 100 determines the radius of the next expanded circle with reference to the search range table in order to perform the second search as the search range expansion process.

  Then, the process returns to step S24 to search again for the person who wants to get off. In this example, when searching for a radius of 200 meters as the second search, the point 61 of the rider is searched (step S25: “YES”). The car sharing server 100 transmits the getting-off location and the scheduled getting-off time of the searched point 61 to the passenger requesting terminal 20 (step S27).

  The boarding applicant terminal 20 receives the getting-off location and the scheduled getting-off time, and accepts an operation from the getting-together 27 regarding whether or not to accept the getting-off location and the scheduled getting-off time (step S28).

  For example, the screen image of FIG. Here, the rider 27 inputs that he / she wishes to get to the point B at 15:00. The circles of the first search range, the second search range, and the third search range are shown for explanation of the embodiment, and may not be displayed on the rider desire terminal 20.

  The points 60, 61, and 62 are at least composed of a get-off place of the person who wants to get off and a scheduled get-off time, and may include the number of vehicles of the person who wants to get off at the same get-off place. For example, a point 62 indicates that four vehicles desire to get off at around 15:00 on this map.

  Here, when the rider 27 selects the point 61 and accepts the place of getting off and the scheduled time of getting off (step S28: "YES"), the car sharing server 100 is notified as matching is established (step S28). S31).

  If the rider 27 cannot accept the drop-off location at the point 61 and the scheduled drop-off time (step S28: "NO"), the car sharing server 100 is notified that the matching is not established (step S29). In response to this, the car sharing server 100 executes the search range expansion process (step S26) again. For example, referring to the search range table, the third search is performed again with a radius of 1 km (step S24). In this way, the points 60 and 62 shown in FIG. 7 are searched.

  In step S31, the car sharing server 100 determines the time and place of the approved scheduled get-off time and drop-off place, and transmits the decision to the get-off request terminal 10 and the ride request terminal 20 (step S32). In response to this, the disembarkation applicant terminal 10 and the rider desire terminal 20 display the determined location and time (steps S33 and S34).

  The means and functions described above are realized by a computer (including a CPU, a server, an apparatus, and various terminals) reading and executing a predetermined program. The program is provided in a form recorded on a computer-readable recording medium such as a flexible disk, CD (CD-ROM, etc.), DVD (DVD-ROM, DVD-RAM, etc.), for example. In this case, the computer reads the program from the recording medium, transfers it to the internal storage device or the external storage device, stores it, and executes it. The program may be recorded in advance in a storage device (recording medium) such as a magnetic disk, an optical disk, or a magneto-optical disk, and provided from the storage device to a computer via a communication line.

  As mentioned above, although this invention was demonstrated using embodiment, it cannot be overemphasized that the technical scope of this invention is not limited to the range as described in the said embodiment. It will be apparent to those skilled in the art that various modifications or improvements can be added to the above-described embodiments. Further, it is apparent from the scope of the claims that the embodiments added with such changes or improvements can be included in the technical scope of the present invention.

1 Car Sharing System 3 Public Line Network 10 Get-off Hope Terminal 20 Passenger Hope Terminal 100 Car Sharing Server

Claims (8)

  1. A car sharing server that is communicably connected to a passenger requesting terminal that is used by a passenger who wants to ride and a passenger who wants to get off a vehicle, and that matches the use of a vehicle that is used by the passenger who wants to get off.
    Boarding person terminal data receiving means for receiving boarding place and boarding time data from the boarding terminal;
    Alighting destination terminal data receiving means for receiving data of alighting location and a scheduled time of getting off from the alighting desire terminal,
    Ride applicant search means for searching whether or not there is a person who wants to get in a predetermined range of the alighting location at the received alighting scheduled time based on the received alighting location and the expected boarding time; ,
    If there is no person who wants to get on the board, the predetermined range of the place to get off is expanded, and whether or not the person who wants to get on is present is searched again based on the received boarding place and the scheduled boarding time. Re-search means;
    Car sharing server with
  2. The car sharing server according to claim 1,
    As a result of the search by the rider searching means and the re-searcher, if it is determined that there is a passenger who wants to get on, data for displaying the number of riders on the map around the disembarking place is displayed. A car sharing server comprising data transmission means for transmitting to the terminal for requesting to get off.
  3. The car sharing server according to claim 1,
    The boarding applicant search means and the re-search means refer to the storage amount of the vehicle to determine whether or not the boarding person is present within a predetermined range of the boarding place and the received boarding location. A car sharing server for searching based on the scheduled boarding time.
  4. The car sharing server according to claim 1,
    The disembarkation applicant terminal data receiving means receives the travel route of the vehicle,
    In the re-search means, if it is determined that the person who wants to get on the vehicle does not exist, a car sharing server that proposes a predetermined getting-off place on the received travel route.
  5. A car sharing server that is communicably connected to a passenger requesting terminal that is used by a passenger who wants to ride and a passenger who wants to get off a vehicle, and that matches the use of a vehicle that is used by the passenger who wants to get off.
    Boarding person terminal data receiving means for receiving boarding place and boarding time data from the boarding terminal;
    Alighting destination terminal data receiving means for receiving data of alighting location and a scheduled time of getting off from the alighting desire terminal,
    An undesired person searching means for searching whether or not there is a person who wants to get off at a predetermined range of the boarding place at the received boarding time based on the received place and the scheduled time of getting off. ,
    When there is no person who wants to get off, the predetermined range of the place to get off is expanded, and whether or not the person who wants to get off is present is searched again based on the received place to get off and the scheduled time to get off. Re-search means;
    Car sharing server with
  6. The car sharing server according to claim 5,
    As a result of the search by the get-off request search means and the re-search means, when it is determined that the get-off request exists, the data for displaying the number of vehicles of the get-off request on the map around the get-off place A car sharing server comprising map transmission means for transmitting the information to the ride request terminal.
  7. A method executed by a car sharing server that is communicably connected to a passenger requesting terminal used by a passenger who wants to ride and a passenger requesting terminal used by a passenger who wants to get off, and performs matching of use of the vehicle used by the passenger who wants to get off Because
    Receiving the boarding place and boarding time data from the boarding terminal,
    Receiving the data of the place of getting off and the scheduled time of getting off from the terminal for requesting to get off;
    Searching based on the received boarding location and the scheduled boarding time whether or not there is a person who wants to board in the predetermined range of the boarding location at the received scheduled boarding time;
    If there is no person who wants to get on the board, the predetermined range of the place to get off is expanded, and whether or not the person who wants to get on is present is searched again based on the received boarding place and the scheduled boarding time. Steps,
    Car sharing method with
  8. A method executed by a car sharing server that is communicably connected to a passenger requesting terminal used by a passenger who wants to ride and a passenger requesting terminal used by a passenger who wants to get off, and performs matching of use of the vehicle used by the passenger who wants to get off Because
    Receiving the boarding place and boarding time data from the boarding terminal,
    Receiving the data of the place of getting off and the scheduled time of getting off from the terminal for requesting to get off;
    Searching whether or not there is a person who wants to get off in a predetermined range of the boarding place at the received boarding scheduled time based on the received boarding place and the scheduled boarding time;
    When there is no person who wants to get off, the predetermined range of the place to get off is expanded, and whether or not the person who wants to get off is present is searched again based on the received place to get off and the scheduled time to get off. Steps,
    Car sharing method with
JP2011078866A 2011-03-31 2011-03-31 Car sharing system, car sharing method Active JP5773706B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2011078866A JP5773706B2 (en) 2011-03-31 2011-03-31 Car sharing system, car sharing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2011078866A JP5773706B2 (en) 2011-03-31 2011-03-31 Car sharing system, car sharing method

Publications (2)

Publication Number Publication Date
JP2012215920A true JP2012215920A (en) 2012-11-08
JP5773706B2 JP5773706B2 (en) 2015-09-02

Family

ID=47268656

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2011078866A Active JP5773706B2 (en) 2011-03-31 2011-03-31 Car sharing system, car sharing method

Country Status (1)

Country Link
JP (1) JP5773706B2 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014071873A (en) * 2012-10-02 2014-04-21 Hitachi Automotive Systems Ltd Vehicle management device and vehicle management method
WO2015141291A1 (en) * 2014-03-19 2015-09-24 日産自動車株式会社 Shared vehicle management device and program
WO2016165801A1 (en) * 2015-04-16 2016-10-20 Daimler Ag Booking of rentable vehicles in a car sharing system
JP6315120B1 (en) * 2017-02-28 2018-04-25 株式会社デンソー Car sharing management device, car sharing system, and car sharing management program

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002324296A (en) * 2001-04-26 2002-11-08 Toyota Motor Corp Vehicle lending system
JP2002342878A (en) * 2001-05-11 2002-11-29 Honda Motor Co Ltd Car sharing management system
JP2005182146A (en) * 2003-12-16 2005-07-07 Fujitsu Ltd Transfer route guidance system and route guidance server

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002324296A (en) * 2001-04-26 2002-11-08 Toyota Motor Corp Vehicle lending system
JP2002342878A (en) * 2001-05-11 2002-11-29 Honda Motor Co Ltd Car sharing management system
JP2005182146A (en) * 2003-12-16 2005-07-07 Fujitsu Ltd Transfer route guidance system and route guidance server

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2014071873A (en) * 2012-10-02 2014-04-21 Hitachi Automotive Systems Ltd Vehicle management device and vehicle management method
WO2015141291A1 (en) * 2014-03-19 2015-09-24 日産自動車株式会社 Shared vehicle management device and program
JPWO2015141291A1 (en) * 2014-03-19 2017-04-06 日産自動車株式会社 Shared vehicle management device and program
US10360518B2 (en) 2014-03-19 2019-07-23 Nissan Motor Co., Ltd. Shared vehicle management device
WO2016165801A1 (en) * 2015-04-16 2016-10-20 Daimler Ag Booking of rentable vehicles in a car sharing system
JP6315120B1 (en) * 2017-02-28 2018-04-25 株式会社デンソー Car sharing management device, car sharing system, and car sharing management program

Also Published As

Publication number Publication date
JP5773706B2 (en) 2015-09-02

Similar Documents

Publication Publication Date Title
RU2523192C2 (en) Methods, devices and map databases for green routing
JP4554653B2 (en) Route search method, route search system, and navigation apparatus
RU2571450C2 (en) Method of multimodal navigation
CN103531025B (en) A kind of share-car method utilizing line sectionalizing method to carry out match information
US8612140B2 (en) Navigation system with constrained resource route planning mechanism and method of operation thereof
JP2006112932A (en) Navigation system for electric vehicle
CN102564426B (en) Information provider unit and server, vehicle assistance system, guider
RU2501088C2 (en) Cheap vehicle routing
US9304009B2 (en) Method and apparatus for providing passenger embarkation points for points of interests
EP2293523A1 (en) Providing routing to a mobile terminal
US7711468B1 (en) System and method for controlling speed of a moving vehicle
US20130041941A1 (en) Crowd-Sourcing of Information for Shared Transportation Vehicles
AU2014213486B2 (en) Predictive transit calculations
US20110313880A1 (en) System and method for selecting transportation resources
US20120290652A1 (en) Arrangement and method for transport sharing
EP2665051A1 (en) Information providing method for mobile terminal and apparatus thereof
US9159238B2 (en) Location-aware selection of public transportation
JP2006113892A (en) Automatic operation management system for electric vehicle
US9880014B2 (en) Navigation system with session transfer mechanism and method of operation thereof
DE102012200143A1 (en) Method and device for loading guidance
Shaheen et al. One-way carsharing’s evolution and operator perspectives from the Americas
US8583367B2 (en) System and method for displaying a route based on a vehicle state
JP5494270B2 (en) Information providing apparatus and information providing method
CN103575285A (en) Route planning device
US20090005963A1 (en) Method, Apparatus and Computer Program Product for Providing Route Planning Based on Personal Activity Plans of Multiple Individuals

Legal Events

Date Code Title Description
A621 Written request for application examination

Free format text: JAPANESE INTERMEDIATE CODE: A621

Effective date: 20140219

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20141021

A977 Report on retrieval

Free format text: JAPANESE INTERMEDIATE CODE: A971007

Effective date: 20141022

A521 Written amendment

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20141215

TRDD Decision of grant or rejection written
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20150630

A61 First payment of annual fees (during grant procedure)

Free format text: JAPANESE INTERMEDIATE CODE: A61

Effective date: 20150630

R150 Certificate of patent or registration of utility model

Ref document number: 5773706

Country of ref document: JP

Free format text: JAPANESE INTERMEDIATE CODE: R150

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250