TWI550534B - System for matching users and a method thereof - Google Patents

System for matching users and a method thereof Download PDF

Info

Publication number
TWI550534B
TWI550534B TW101118072A TW101118072A TWI550534B TW I550534 B TWI550534 B TW I550534B TW 101118072 A TW101118072 A TW 101118072A TW 101118072 A TW101118072 A TW 101118072A TW I550534 B TWI550534 B TW I550534B
Authority
TW
Taiwan
Prior art keywords
point
request
information
sharing
pairing
Prior art date
Application number
TW101118072A
Other languages
Chinese (zh)
Other versions
TW201349146A (en
Inventor
張凱傑
Original Assignee
張凱傑
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 張凱傑 filed Critical 張凱傑
Priority to TW101118072A priority Critical patent/TWI550534B/en
Publication of TW201349146A publication Critical patent/TW201349146A/en
Application granted granted Critical
Publication of TWI550534B publication Critical patent/TWI550534B/en

Links

Description

Co-occupant matchmaking system and method thereof

A system and method for co-occupant matchmaking, and in particular to a system and method for pairing all starting and ending positions of a common passenger.

In recent years, with the popularity and booming of global positioning systems, many vehicles are equipped with global positioning systems to provide positioning and navigation services, and various services for applying global positioning system have emerged.

The traditional dispatching system includes a server and a vehicle end, and the server continuously receives the latitude and longitude returned by the vehicle end to know the current position of the vehicle end. When the user calls the car, the taxi is dispatched to the passenger station according to the passenger's informed travel point and is willing to carry the passenger to the passenger. Among them, the passenger can inform the passenger point by means of the passenger verbally informing the service personnel, or entering the pre-established location through the interactive voice response system, or even providing the latitude and longitude of the passenger point to the delivery system through the global positioning system or electronic map. So that the server can calculate the nearest vehicle to the ride point and dispatch the vehicle to the passenger.

However, due to the economic downturn, more and more passengers hope to share taxis with other passengers. In this way, they can share the taxi fares with other passengers and reduce expenses. However, the current dispatch system assigns vehicles. After the guest, the vehicle that has already been transported will not be assigned again, and then another passenger will be picked up at another location. Therefore, the service of the ride can not be provided.

In summary, it can be seen that in the prior art, there has been a long-standing problem that the co-occupation service pairing co-occupants cannot be provided, and therefore it is necessary to propose an improved technical means to solve this problem.

In view of the prior art, there is a problem that there is no co-occupation service pairing co-occupant, and the present invention discloses a system and method for co-occupant matchmaking, wherein: the system of the co-occupant matchmaking disclosed by the present invention, at least The method includes: a receiving module, configured to receive a first reciprocating request transmitted by the first device, and to receive a second reciprocating request transmitted by the second device, where the first reciprocating request includes an initiation of the initiating point Point information and destination information indicating the destination point, the second co-multiplication request includes information about the common point of the shared point and the information of the vehicle point under the drop-off point; requesting a selection module for using the information of the origin point Co-occupation point information, the destination point information, and each of the drop-off point information selects a second co-multiplied request; the transmission module transmits the co-occupant information to the first device and/or the dispatching system, and the co-occupant information includes at least The share-sharing point information included in the selected second multi-share request; the pairing module is configured to pair the first share request with the selected second share request.

The method for composing pairing of a occupant according to the present invention comprises the steps of: receiving a first commencing request transmitted by a first device, where the first mashup request includes information indicating an origination point of the originating point and a destination point. The destination information is received; the second multi-share request transmitted by the second device is received, and the second multi-share request includes the information of the common point indicating the shared point and the information of the vehicle point under the drop-off point; Multiplying point information, the destination point information, and each of the drop-off point information to select a second co-multiplication request; pairing the first co-multiplication request with the selected second co-multiplication request; transmitting the co-occupant information to the dispatching system, the occupant The information includes the originating point information, the destination point information, the sharing point information and the getting off point information included in the second sharing request paired with the first sharing request.

The system and method disclosed by the present invention are as above, and the difference from the prior art is that the present invention receives a first co-multiplication request including information of origination point and destination point information. And receiving a second sharing request including the sharing point information and the getting off point information, and calculating a starting distance between the reference point and the sharing point according to the originating point information, the common point information, the destination point information, and the getting off point information, and Calculate the angle between the reference point and the destination point and the end point formed by the reference point to the drop point, and/or calculate the overlap ratio of the origin point to the destination point and the route of the commutator point to the drop point, thereby pairing the first multiplication request with the first The two-share request is used to solve the problems existing in the prior art, and the technical effect of pairing appropriate user sharing can be achieved.

The features and embodiments of the present invention will be described in detail below with reference to the drawings and embodiments, which are sufficient to enable those skilled in the art to fully understand the technical means to which the present invention solves the technical problems, and The achievable effects of the present invention.

The present invention can pair two or more users so that the paired users can share.

The system operation of the present invention will be described below with reference to the system architecture diagram of the carrier-matching pairing of the present invention proposed in the "Fig. 1". As shown in FIG. 1, the system of the present invention includes a receiving module 110, a reference point determining module 140, a request selecting module 160, a transmitting module 170, and a pairing module 180.

The receiving module 110 is responsible for receiving a plurality of sharing requests. The co-multiplication request is a device (not shown) that is compatible with the user operation of the present invention, whereby the start and end points of the ride are set, and the device operated by the user generates and transmits to the receiving module 110. The device operated by the user includes a mobile phone, a personal digital assistant (PDA), a computer, etc., but the present invention is not limited to the above.

The device operated by the user will be based on the start/end point of the ride set by the user. The information indicating the start point/the end point is obtained, and the obtained information indicating the start point/the end point is added to the generated multiplication request. Wherein, the information indicating the start point/the end point includes, but is not limited to, the latitude and longitude of the start point/the end point, the address of the start point/the end point, the landmark around the start point/the end point, and the start point/the end point in the present invention on the electronic map Coordinates defined in etc.

In some embodiments, the multi-share request does not only include information indicating the start point and the end point, for example, it can also include identification data indicating the identity of the user, the number of users desired by the user, whether the user carries a heavy object, Any one or more types of information such as large baggage or pets, or whether the user is willing to talk during sharing. The identification data includes but is not limited to the user's ID number, the user's email account, and the user applies for it. The account number, or the identification code of the user in the present invention, and the like, the identification data includes, but is not limited to, pre-stored in the device used by the user, or input when the user sets the starting point and the midpoint.

In the present invention, the reception request received by the receiving module 110 is referred to as a "first sharing request", and the device transmitting the first sharing request is referred to as a "first device", and the operation of the first device is operated. The first user is referred to as the "first user". The starting point and the ending point set by the first user on the first device are respectively referred to as "initiating point" and "destination point", and the first sharing request may be included in the first sharing request. The information indicating the originating point/destination point is referred to as "initiating point information" / "destination point information", and the identification data indicating that the first user identity in the first multi-share request is referred to as "first identification data"; Similarly, in the present invention, the other sharing request received after the receiving module 110 receives the first sharing request is referred to as a "second sharing request", and the device transmitting the second sharing request is called For the "second device", the user who operates the second device is referred to as the "second user", and the starting point and the ending point set by the second user on the second device are respectively referred to as "common sharing". "point" and "get off", the information in the second co-occupation request that can indicate the share/off point is called "shared point information" / "get off point information", and the second share request can represent The identification data of the second user identity is referred to as "second identification data". In fact, the difference between the first multi-share request and the second multi-share request is not limited thereto. For example, the latest received multi-share request may be regarded as the first multi-share request, and the other common The multiplication request is for the second co-multiplication request.

In addition, in some embodiments, the receiving module 110 can receive the selected data transmitted by the first device in addition to receiving the sharing request. In addition, the receiving module 110 can also receive the deleted data transmitted by the first device and/or the second device. Wherein, the selected data/delete data corresponds to one or more second sharing requests.

The path planning module 140 is responsible for planning the driving route. In some embodiments, the path planning module 140 may be configured according to the origin information and the destination information in the first multiplication request received by the receiving module 110, and the second second multiplication request received by the receiving module 110. The information of the shared point information and the information of the getting off point are respectively planned by the originating point indicated by the initiating point information, the destination point indicated by the destination point information, and the common point information included in a second second multiplication request. The multiplication point and the one or more expected driving routes of the vehicle points indicated by the vehicle point information included in the second sharing request, that is, the number of expected driving routes planned by the path planning module 140 and the receiving mode The number of second reciprocal requests received by group 110 is the same.

In another embodiment, the path planning module 140 may also plan a reference driving route according to the origin information and the destination point information in the first sharing request received by the receiving module 110, and may be configured according to the receiving module 110. The shared point information and the drop-off point information in each of the received second multi-share requests are separately planned for the shared travel route. That is, the number of shared driving routes planned by the path planning module 140 The amount is one more than the number of second multiplication requests received by the receiving module 110 (one base driving route plus multiple commuting driving routes). Among them, the reference driving route and the shared driving route may both contain one or more driving routes.

The request selection module 160 is responsible for selecting a second co-multiplication request from each of the second reciprocal requests received by the receiving module 110.

The request selection module 160 may include a reference point decision unit 161, a distance calculation unit 162, an included angle calculation unit 163, and a request selection unit 166a as shown in FIG. 2A.

The reference point decision unit 161 is responsible for selecting a specific point among the expected driving routes planned by the path planning module 140 as a reference point. In general, the reference point selected by the reference point determining unit 161 is a common point represented by the originating point information indicated by the originating point information in the first multiplicative request or the second multiplicative point information, but The reference points mentioned in the present invention are not limited thereto. For example, when the shared driving route to the destination point and the getting-off point requires the bridge to cross the river or the viaduct is required, the reference point determining unit 161 can select the position of the lower bridge as the reference point, and if, for example, when sharing The reference point determining unit 161 can also be wounded when the desired driving route from the point to the destination point and the getting off point needs to be bypassed due to terrain or road conditions such as buildings, facilities, mountains, lakes, traffic regulations, or road closures that cannot be traversed. The position after the line is selected as the reference point.

The distance calculating unit 162 is responsible for calculating the originating point information according to the originating point information in the first reciprocating request received by the receiving module 110 and the sharing point information in each second multiplying request received by the receiving module 110. The distance between the indicated origin and the common point represented by each of the shared point information, that is, the number of distances calculated by the distance calculating unit 162 and the second multiplied by the receiving module 110 The number of requests is the same. The distance calculated by the distance calculating unit 162 is referred to as a “starting distance” in the present invention, and the starting distance may be a linear distance between the originating point and the common point, but the starting distance of the present invention is not For example, the starting distance may also be the length of the shortest path from the originating point to the sharing point.

The angle calculation unit 163 is responsible for calculating the reference point determining unit according to the destination point information in the first sharing request received by the receiving module 110 and the getting off point information in each second sharing request received by the receiving module 110. The angle between the target point indicated by the reference point-to-destination point information determined by 161 and the point of the vehicle point indicated by the reference point to the information of each of the getting-off points, that is, the number of angles calculated by the angle calculating unit 163 is the same as the receiving mode. The number of second reciprocal requests received by group 110 is the same. The angle calculated by the included angle calculating unit 163 is referred to as "end angle" in the present invention.

In practice, the angle calculation unit 163 may calculate the angle of the end point using the coordinates of the reference point, the destination point, the drop point on the electronic map, or the latitude and longitude, or calculate the angle of the end point using a vector, a distance, or a trigonometric function, but the present invention proposes The manner in which the included angle calculation unit 163 calculates the angle of the end point is not limited to the above.

The request selecting unit 166a determines whether the distance calculated by the distance calculating unit 162 according to the riding point information in each second sharing request meets the distance threshold, and determines that the angle calculating unit 163 is in accordance with each second sharing request. The exit angle information calculates whether the angle of the end point meets the angle threshold value, and selects the second multiplication request that the starting point distance meets the distance threshold value and the end point angle meets the angle threshold value. When the starting distance is less than or not greater than the distance threshold, the request selecting unit 166a determines that the starting distance meets the distance threshold. When the ending angle is less than or less than the angle threshold, the request selecting unit 166a determines that the ending angle meets the angle threshold. Where the distance The threshold value and the angle threshold are usually preset values of the system, but the invention is not limited thereto.

In some embodiments, if the first share request includes the information of the number of passengers, the request selection unit 166a selects at most the number of passengers in the first share request when selecting the second share request. The same number of second share requests. If the information about the number of passengers is also included in the second multi-share request, the request selection unit 166a also selects the second multi-share request with reference to the number of people in the first multi-share request.

The request selection module 160 may also include an overlap matching unit 165 and a request selecting unit 166b as shown in FIG. 2B.

The overlapping comparison unit 165 is responsible for comparing the reference driving route planned by the path planning module 140 with each of the shared driving routes planned by the path planning module 140, and calculating the reference driving route and each sharing after the comparison. The overlapping ratio of the driving route, if the reference driving route and/or the shared driving route includes a plurality of driving routes, the overlapping matching unit 165 compares and calculates the overlapping ratio of the various driving route combinations, and outputs the combination of various driving routes. The highest overlap ratio. In general, the overlap ratio calculated by the overlap matching unit 165 is a percentage, but the invention is not limited thereto.

The request selection unit 166b is responsible for selecting the overlap ratio of the reference driving route calculated by the overlapping comparison unit 165 and each of the shared driving routes, and selecting the highest overlapping ratio among the respective shared driving routes planned by the path planning module 140. Take the route and choose to plan a second multiplication request for the shared ride route with the highest overlap ratio.

The request selecting unit 166b may further select the shared driving route according to the length of the shared driving route when the overlapping ratio of the reference driving route and the respective shared driving route is the same or similar, that is, requesting the selecting unit 166b in the reference driving route. When the overlapping ratios of the respective shared driving routes are the same or similar, the shortest shared driving route of the driving route can be selected, thereby selecting a second sharing request for planning the shared riding route with the same overlapping ratio and the shortest shared driving route.

In addition, the request selection module 160 may also include a reference point determination unit 161, a distance calculation unit 162, an included angle calculation unit 163, an overlap comparison unit 165, a request selection unit 166a, and a request selection unit 166b. At this time, the request selecting unit 166a may first select a plurality of seconds according to the starting point distance calculated by the distance calculating unit 162 and the ending angle calculated by the angle calculating unit 163, and the starting point distance meets the distance threshold and the ending angle meets the angle threshold. After the multiplication request, the overlap matching unit 165 calculates the overlap ratio of the reference driving route and the shared driving route according to the second sharing request selected by the request selecting unit 166a, so that the request selecting unit 166b further selects the second sharing request. .

The transmitting module 170 is responsible for transmitting the occupant information to the first device. The sharer information transmitted by the transfer module 170 to the first device includes the share point information in the second share request selected by the request selection module 160, and the sharer information may also include the requested selection module. 160 the get-off point information in the selected second multi-share request, or the second identification data in the second multi-share request.

In some embodiments, the transmitting module 170 can also transmit the originating point information and the destination point information in the first reciprocal request to the second device that transmits the second reciprocating request paired by the pairing module 180.

The transfer module 170 may also transmit the co-occupant information to the dispatch system (not shown). The carrier information transmitted by the transmitting module 170 to the dispatching system includes the originating point information and the destination point information in the first sharing request, and the second sharing request selected by the requested selection module 160 (the paired module) 180 pairs of second-share requests) Share the information and the drop-off point information. In this way, the dispatching system can dispatch the vehicle to the first user and the second user according to the origin information, the destination information, the boarding point information, and the drop-off point information transmitted by the transmitting module 170.

In practice, the transmitting module 170 can transmit only the occupant information including the mashed point information to the first device, or only the occupant including the originating point information, the destination point information, the riding point information, and the getting off point information. Information to the dispatching system, or to transmit the information of the passengers including the information of the shared point to the first device, and also transmit the information of the passengers including the information of the originating point, the destination point information, the riding point information, and the getting off point information to the party Car system.

The pairing module 180 is responsible for the first sharing request received by the pairing receiving module 110 and the second sharing request selected by the requested selection module 160.

In some embodiments, if the receiving module 110 transmits the plurality of commutator information to the first device, the receiving module 110 receives the selected data of the one or more co-occupants selected by the first device. The pairing module 180 will pair the first sharing request with the second sharing request corresponding to the selected data received by the receiving module 110. The selection data corresponds to the included common point information and the drop-off point information, and corresponds to one or more second sharing requests transmitted to the first device or corresponding to the second identification data in the second sharing request. .

In some embodiments, after the pairing module 180 pairs the first sharing request and the second sharing request, if the receiving module 110 receives the deleted data transmitted by the first device, the pairing module 180 cancels the first Pairing the pairing of one or more second sharing requests corresponding to the received deletion data; and if the receiving module 110 receives the deleted data transmitted by the second device, the pairing module 180 cancels The first multi-share request is paired with the second device transmitting the deleted data.

In addition, the present invention further includes an additional parameter determination module 150 and an evaluation office. Module 190.

The parameter determining module 150 is configured to determine whether the first pairing parameter corresponding to the first identification data included in the first sharing request matches the second pairing parameter corresponding to the second identification data included in the second sharing request, When the second selection request is selected, the request selection module 160 may select the second pairing parameter and the first pairing parameter that the starting point distance meets the distance threshold, the ending angle meets the angle threshold, and the included second identification data corresponds. A matching second multiplication request.

The first pairing parameter/second pairing parameter corresponding to the first identification data/second identification data includes items of user data, acceptable materials, and user evaluations, wherein the user data includes the user's name, age, and Information on gender, occupation, etc. Acceptable information includes acceptable gender of the co-occupier, acceptable commuter occupation, acceptable age of the commuters, acceptance of the commuters carrying heavy loads or large luggage, acceptance of sharing Whether to carry a pet, an acceptable number of people to share, whether to accept a conversation when sharing, an acceptable method of sharing a shared amount, a priority pairing object, a rejection of a matching object, etc., and the user evaluation includes when the user is the first user. The number of evaluations obtained, the positive evaluation obtained when the user is the first user, the negative evaluation obtained when the user is the first user, the number of evaluations obtained when the user is the second user, and the user is The positive evaluation obtained when the second user is obtained, and the negative evaluation obtained when the user is the second user, but the first pairing parameter proposed by the present invention/ Information contained two paired parameters are not limited to the above.

In general, the parameter determination module 150 may determine whether the first user included in the first multi-share request carries the information of the heavy object or the large baggage or the pet and the second user-acceptable data of the second pairing parameter. Whether to accept the passengers carrying heavy objects or large luggage, whether to accept the passengers to carry pets and other information for comparison, parameter judgment mode The group 150 can also compare the gender, age, and occupation data in the user data of the first pairing parameter and the acceptable gender, acceptable age, and acceptable occupation in the second user acceptable data of the second pairing parameter. The data, the parameter determining module 150 may also compare the data of the first user acceptable data of the first pairing parameter, whether to accept the sharing time, the acceptable amount of money, and the second user of the second pairing parameter. Whether the data in the acceptable data is accepted during the sharing, the acceptable amount of money, and the like, and the parameter determination module 150 can also compare whether the second pairing parameter matches the first pairing parameter. When the parameter comparison module 150 matches the items, the parameter determination module 150 can determine that the first pairing parameter matches the second pairing parameter.

The parameter determination module 150 may also compare whether the rejection pairing object of the first pairing parameter includes the second identification data, and whether the rejection pairing object of the second pairing parameter includes the first identification data, and if yes, the parameter determination module 150 The first pairing parameter may be determined to be inconsistent with the second pairing parameter. If not, the parameter determining module 150 may determine that the first pairing parameter matches the second pairing parameter.

In addition, the parameter determining module 150 determines that the priority matching object corresponding to the first pairing parameter includes the second identification data, or the priority matching object that matches the second pairing parameter includes the first identification data, the parameter determining module 150 determines The first pairing parameter is consistent with the second pairing parameter, and the pairing module 180 can preferentially pair the first user with the second user.

The evaluation processing module 190 is configured to adjust, according to the first evaluation data, the first pairing parameter corresponding to the first identification data in the first sharing request after the receiving module 110 receives the first evaluation data transmitted by the second device. User evaluation in . The first evaluation data transmitted by the second device may include the first identification data, or Contains the second identification material.

If the first evaluation data includes the first identification data, the evaluation processing module 190 can directly adjust the user evaluation in the first pairing parameter corresponding to the first identification data according to the first identification data, and if the second evaluation data only The second identification data is included, and the evaluation processing module 190 can determine, according to the pairing result of the pairing module 180, the first identification data of the first user that is shared with the second user who transmits the first evaluation data, and according to the The determined first identification data adjusts the user evaluation in the first pairing parameter corresponding to the first identification data. The evaluation processing module 190 can write the user evaluation into the positive evaluation or the negative evaluation of the first user according to the quality of the user evaluation received by the receiving module 110, and modify the evaluation of the first user. The number is used to adjust the user rating of the first user.

The evaluation processing module 190 may further adjust the use of the second pairing parameter corresponding to the second identification data in the second sharing request according to the second evaluation data after receiving the second evaluation data transmitted by the first device. Evaluation. The second evaluation data transmitted by the first device may include the second identification data, and may also include the first identification data, and the evaluation processing module 190 adjusts the second pairing parameter corresponding to the second identification data according to the second evaluation data. The manner of user evaluation in the user is the same as the user evaluation corresponding to the first identification data according to the first evaluation data, and therefore will not be described again.

Next, the operation system and method of the present invention will be explained in the first embodiment, and please refer to the "3A" diagram of the method for the method of pairing of the occupants of the present invention. In this embodiment, it is assumed that two users want to use the present invention to share a taxi with other people, and two users can pair with each other, one of the users uses a mobile phone with a GPS system, and the other user uses computer.

The user using the mobile phone can execute the software compatible with the present invention in the mobile phone, and after executing, the software can provide the user to select a destination (end point) from the pre-established materials, input whether to carry heavy objects or large luggage or pets. And selecting information such as whether to share the conversation or the like, so that the software can read the latitude and longitude of the destination selected by the user from the pre-established data, and obtain the user through the GPS system of the first device. After the latitude and longitude of the location (starting point), the sharing request is transmitted to the present invention. The sharing request transmitted by the software includes the latitude and longitude of the location of the user, the latitude and longitude of the destination, and the identification data indicating the user.

The user of the computer can also execute the software compatible with the present invention in the computer, and the software can provide the user to select the starting point (starting point) and the destination (end point) from the electronic map after input, and input whether to carry the heavy object. Or large baggage or pets, and information such as whether to choose whether to share or not, so that the software can transmit the sharing request to the present invention after reading the latitude and longitude of the departure place and the destination selected by the user through the electronic map. The sharing request transmitted by the software includes the latitude and longitude of the departure place and the destination selected by the user, and the identification data indicating the user.

In this embodiment, it is assumed that there is no unshared request in the system of the present invention. Therefore, after the receiving module 110 receives the sharing request transmitted by the mobile phone, the system of the present invention waits for other sharing requests. Pairing is not started until another co-multiplication request is received. That is, after the receiving module 110 receives the sharing request transmitted by the computer, since the embodiment assumes that the sharing request transmitted by the mobile phone and the sharing request transmitted by the computer can be paired, therefore, In an embodiment, the sharing request transmitted by the mobile phone is a first sharing request, the mobile phone is a first device, the user of the mobile phone is a first user, and the sharing request transmitted by the mobile phone is a second sharing. The request is that the computer is a second device, and the user of the computer is a second user.

In this embodiment, it is assumed that, as shown in FIG. 4A, the location of the first user is the originating point 411, the destination selected by the first user is the destination point 412, and the second user is in the electronic map. The selected starting point is the sharing point 421, and the second user selects the ending point in the electronic map as the getting off point 422, and the receiving module 110 receives the first sharing request transmitted by the first device (handset) ( After the step 202) and the second sharing request transmitted by the second device (computer) (step 206), the request selection module 160 can select according to the originating point information, the common point information, the destination point information, and the information of each getting off point. A second multiplication request (step 250). Assuming that the request selection module 160 includes a reference point determining unit 161, a distance calculating unit 162, an included angle calculating unit 163, and a request selecting unit 166a, the present embodiment will display the path planning module 140 as shown in the flow of "FIG. 3B". According to each second multiplication request received by the receiving module 110, the originating point represented by the originating point information and the sharing point indicated by the common point information included in each second sharing request may be respectively planned. The destination point indicated by the point information and the plurality of expected driving routes of the drop-off point indicated by the vehicle point information included in the second sharing request (step 251). In this embodiment, if there is only one second multiplication request, the path planning module 140 will only plan a starting point as the originating point, passing the common point and the destination point/getting off point, and the ending point as the getting off point/destination point. The expected driving route, and if there are multiple second sharing requests, the path planning module 140 will plan the same expected driving route as the second sharing request, and the starting point of each expected driving route is initiated. Point, through a certain point of sharing and destination point / get off point, the end point is the get off point / destination point, where the share point and the get off point in the same expected driving route are shared by the same second multiplication request Point information and the information of the drop-off point.

After the path planning module 140 separately plans the expected driving route according to the originating point information, the common point information, the destination point information, and the respective getting off point information (step 251), the reference point determining unit 161 may plan in the path planning module 140. The reference point is determined in the expected driving route (step 252). In the present embodiment, it is assumed that the reference point decision unit 161 decides the origination point as the reference point.

After the reference point determining unit 161 determines the reference point (step 252), the distance calculating unit 162 may be based on the originating point information in the first sharing request (latitude and longitude of the first user's location) and the second sharing request. The point information (the latitude and longitude of the starting point selected by the second user in the electronic map) calculates the starting distance 311 between the originating point and the sharing point (step 253), and the angle calculating unit 163 can perform the purpose in the first sharing request. Point information (latitude and longitude of the destination selected by the first user) and the drop-off point information in the second multi-share request (latitude and longitude of the end point selected by the second user in the electronic map) to calculate the reference point (initiation point) to The destination point is at an angle 312 from the end point of the origination point to the drop-off point (step 254).

In practice, the distance calculation unit 162 calculates the starting distance between the originating point and the sharing point according to the common point information (step 253), and the angle calculating unit 163 calculates the reference point to the destination point and the reference point according to the destination point information and the getting off point information. The step of the end angle to the drop point (step 254) is not limited by the order, that is, the distance calculation unit 162 can calculate the start distance before or after the angle calculation unit 163 calculates the end angle.

The distance calculation unit 162 calculates the starting distance between the originating point and the sharing point according to the originating point information and the common point information (step 253), and the angle calculating unit 163 calculates the reference point to the destination point and the reference according to the destination point information and the getting off point information. After the point to the end point of the drop-off point (step 254), the request selection unit 166a can be based on the distance The starting distance calculated by the calculating unit 162 and the ending angle calculated by the angle calculating unit 163 select the second sharing request received by the receiving module 110 (step 255). In the present embodiment, assuming that the distance threshold is 500 meters and the angle threshold is 30 degrees, if the starting distance 311 calculated by the distance calculating unit 162 is 413 meters, the angle 312 calculated by the angle calculating unit 163 is included. At 28 degrees, the request selection unit 166a determines that the starting distance 311 between the originating point 411 and the sharing point 421 meets the distance threshold, and the angle 312 from the originating point 411 to the destination point 412 to the ending point of the originating point 411 to the getting off point 422 is also In accordance with the angle threshold, the request selection unit 166a selects the shared point information included to represent the common point 421 and includes the second point request that the lower point information represents the second point 422.

In practice, if the parameter determination module 150 is further included in the system of the present invention, the parameter determination module 150 can be configured as before the request selection module 160 selects the second sharing request according to the starting point distance and the ending angle (step 250). As shown in the flow of FIG. 3B, it is first determined whether the first pairing parameter corresponding to the first identification data in the first multi-share request is the second pairing parameter corresponding to the second identification data in the second sharing request. Matches (step 230). Then, when the second selection request is selected, the request selection module 160 selects the corresponding starting distance to meet the distance threshold, the corresponding end angle meets the angle threshold, and the corresponding second identification data matches the first identification data. Second commuting request.

After requesting the selection module 160 to select the second reciprocal request (step 250), the transmitting module 170 can transmit the occupant information to the first device (the handset used by the first user) (step 262). In this embodiment, it is assumed that the sharer information transmitted by the transfer module 170 includes the share point information and the get-off point information in the second share request selected by the request selection module 160, wherein the share point information Separate from the drop-off point information The address of the shared point and the name of the intersection where the drop-off point is located.

Also after requesting the selection module 160 to select the second reciprocal request (step 250), the pairing module 180 can pair the first reciprocal request with the second reciprocal request selected by the requested selection module 160 (step 280a), That is, the first user of the match is shared with the second user, so that the first user can intercept the taxi to the second user.

In practice, after the pairing module 180 pairs the first sharing request and the second sharing request (step 280a), the transmitting module 170 can transmit the originating point information and the destination point information to transmit the paired second sharing request. The second device (the computer used by the second user) (step 266), so that the second user knows the start and end points of the first user shared, but the invention is not limited thereto.

In addition, after requesting the selection module 160 to select the second sharing request (step 250), the transmitting module 170 may also transmit the originating point information and the destination point information in the first sharing request, and pair with the first sharing request. The sharing point information and the getting off point information in each second multi-share request are sent to the taxi dispatching system outside the invention, so that the paying system of the taxi can dispatch the taxi to initiate the first user, carrying the first use The second user is connected to the second user, and then the first user and the second user are carried to the destination point, and then the first user is disembarked, and then the second user is loaded to the drop-off point.

The operation system and method of the present invention will be described below with reference to the second embodiment. Please refer to the flow of "3A". In the present embodiment, it is assumed that two users want to use the present invention for sharing. In this embodiment, it is assumed that the starting point and the ending point of the first user of the two users are the originating point 411 and the destination point 412, respectively, and the starting point and the ending point of the other second user are respectively the sharing point 421 and getting off the vehicle. Point 422, as shown in Figure 4B.

After the two users respectively operate the device to transmit the multi-share request to the server executing the present invention, the receiving module 110 can receive the shared request transmitted by the two users (steps 202, 206). Next, the request selection module 160 may select a second sharing request according to the origination point information, the common point information, the destination point information, and each of the getting off point information (step 250).

In the present embodiment, it is assumed that the park 602 cannot be traversed in the map represented by the "Fig. 4B". Therefore, the expected driving route 721 planned by the route planning module 140 will start from the originating point 411 and pass through After the point 421 is shared, the park 602 is bypassed, and at the destination point 412, the last point 422 is finally the end point (step 251).

If the request selection module 160 includes the reference point determining unit 161, the distance calculating unit 162, the angle calculating unit 163, and the request selecting unit 166a, the reference point determining unit 161 will plan the expected driving route 721 planned by the path planning module 140. The position in which the bypass is completed is determined as the reference point 500 (step 252). Then, the request selection module 160 selects the second reciprocal request and the subsequent process will be the same as the first embodiment, and therefore will not be described again.

Similarly, after the path planning module 140 plans the driving directions 731, 732 from the common point 421 to the destination point 412 and the drop-off point 422 or the drop-off point 432 according to the map as shown in "FIG. 4C" (step 251). If the expected driving route 731, 732 has to pass through the bridge 606, the reference point determining unit 161 can determine the position of the leaving bridge 606 as the reference point 500 (step 252).

After the reference point determining unit 161 determines the reference point (step 252), the distance calculating unit 162 can calculate the departure starting point 411 according to the originating point information in the first sharing request and the sharing point information in the two second sharing requests. The starting distance from the two sharing points 421, 431 (step 253), the angle calculating unit 163 is based on the first sharing request The target point information in the middle and the getting off point information in the two second multiplication requests respectively calculate the angle 312 between the reference point 500 to the destination point 412 and the end point of the reference point 500 to the drop point 422, and the reference point 500 to the destination point 412 and the reference. From the point 500 to the end angle 322 of the drop-off point 432 (step 254), the request selection unit 166a may select the second share request according to the start distance calculated by the distance calculation unit 162 and the end angle calculated by the angle calculation unit 163 ( Step 255).

The operation system and method of the present invention will be described below with reference to the third embodiment. Please refer to the flow of "3A". In this embodiment, it is assumed that three users want to use the invention to share. In this embodiment, it is assumed that the starting point and the ending point of the first user of the three users are the originating point 411 and the destination point 412, respectively, and the starting points of the remaining two second users are the sharing point 421 and the sharing. Point 431 and the end point are the getting off point 422 and the getting off point 432, respectively, as shown in "Fig. 5A".

After the three users respectively operate the device to transmit the multi-share request to the server executing the present invention, the receiving module 110 can receive the shared request transmitted by the three users (steps 202, 206). Next, the request selection module 160 may select a second sharing request according to the origination point information, the common point information, the destination point information, and each of the getting off point information (step 250). Assuming that the request selection module 160 includes a reference point determining unit 161, a distance calculating unit 162, an included angle calculating unit 163, and a request selecting unit 166a, the present embodiment will display the path planning module 140 as shown in the flow of "FIG. 3B". According to the two second multiplication requests received by the receiving module 110, the originating point represented by the originating point information and the common point and the destination represented by the common point information included in each second multiplication request may be respectively planned. The destination point indicated by the point information and the plurality of expected driving directions 751, 755 of the getting off point indicated by the getting off point information (step 251), and then the reference point determining unit 161 may not make an additional judgment, or The origination point 411 in the expected driving route planned by the path planning module 140 may be determined as a reference point when it is judged that the viaduct, the expressway, or the detour is not passed (step 252).

After the reference point determining unit 161 determines the reference point (step 252), the distance calculating unit 162 can calculate the departure starting point according to the originating point information in the first sharing request and the sharing point information in the two second sharing requests. The starting point distance 311/321 between the 411 and the two sharing points 421/431 (step 253), that is, the distance calculating unit 162 calculates two starting distances, and the angle calculating unit 163 according to the destination point information in the first sharing request And the get-off point information in the two second multi-share requests, respectively calculating the starting point 312/322 of the starting point 411 (reference point) to the destination point 412 and the starting point 411 to the two getting-off points 422/432 (step 254), That is, the angle calculation unit 163 calculates the angles of the two end points.

Then, the request selection unit 166a may select the second sharing request received by the one or two receiving modules 110 according to the starting distance calculated by the distance calculating unit 162 and the ending angle calculated by the angle calculating unit 163 (step 255). ). In this embodiment, it is assumed that the starting point distance 311 between the originating point 411 and the sharing point 421 is 413 meters, the starting point distance 321 between the initiating point 411 and the sharing point 431 is 315 meters, and the destination point 412 initiates the point 411 to get off. The end angle 312 formed by the point 422 is 28 degrees, and the end point angle 322 formed by the destination point 412 originating point 411 is 47 degrees. If the distance threshold is 500 meters and the angle threshold is 30 degrees, Point 412 initiates point 411. The end point angle 322 formed by the drop point 432 exceeds the angle threshold. Therefore, although the starting point distance 321 between the originating point 411 and the common point 431 meets the distance threshold value, and is smaller than the originating point 411 and the common point 421. The starting distance 311 between the requests, the request selection module 160 only selects the information and the inclusion of the common point including the representation of the common point 421 A second multiplication request indicating the vehicle point information under the drop-off point 422, and does not select the second-share request including the share-sharing point information indicating the share-sharing point 431 and the vehicle-point information indicating the drop-off point 432.

On the other hand, if the request selection module 160 includes the overlap comparison unit 165 and the request selection unit 166b, the path planning module 140 can be configured according to the receiving module 110 as shown in the flow of the "3C". The origination point information and the destination point information included in the first first multiplication request are received, and the planning starting point is the starting point and the ending point are the reference driving route 761 of the destination point indicated by the destination point information (step 256). And according to each second multiplication request received by the receiving module 110, respectively planning a starting point for the common multiplication point represented by each second multiplication request and the end point being the same second common multiplication The commuting lanes 765 and 766 (step 257) of the destination point indicated by the destination point information included in the request are as shown in "Fig. 5B".

Thereafter, the overlap comparison unit 165 can calculate an overlap ratio of the reference driving route 711 and the shared riding route 765/766. In the present embodiment, it is assumed that the overlap ratio unit 165 calculates that the overlap ratio of the reference driving route 761 and the shared riding route 765 is 73%, and the overlapping ratio of the reference driving route 761 to the shared riding route 766 is 19%.

After the overlap ratio unit 165 calculates the overlap ratio of the reference driving route and the shared riding route, the request selecting unit 166b may select a second sharing request according to the overlapping ratio of the reference driving route and each of the shared driving routes (step 259). . In the present embodiment, since the overlapping ratio of the reference driving route 761 to the shared riding route 765 is higher than the overlapping ratio of the reference driving route 761 and the shared riding route 766, the request selecting unit 166b will select to include the planned sharing. The second route request of the driving route 765 and the second point of the information of the getting off point information.

In this embodiment, since the request selection module 160 selects only the common point information including the representation of the common point 421 and the second sharing request including the information of the vehicle points under the drop-off point 422, the request selection module 160 is requested. The process after the second multi-share request (step 250) is selected will be the same as the first embodiment, and therefore will not be described again.

The operation system and method of the present invention will be described below with reference to the fourth embodiment. Please refer to the flow of "3A". In this embodiment, it is assumed that three users want to use the invention to share. In this embodiment, it is assumed that the starting point and the ending point of the first user of the three users are the originating point 411 and the destination point 412, respectively, and the starting points of the remaining two second users are the sharing point 421 and the sharing. Point 451 and the end point are the getting off point 422 and the getting off point 452 as shown in "5C".

After the three users respectively operate the device to transmit the multi-share request to the server executing the present invention, the receiving module 110 can receive the shared request transmitted by the three users (steps 202, 206). Next, the request selection module 160 may select a second sharing request according to the origination point information, the common point information, the destination point information, and each of the getting off point information (step 250).

If the request selection module 160 includes the reference point determining unit 161, the distance calculating unit 162, the included angle calculating unit 163, and the request selecting unit 166a, the present embodiment will display the path planning module 140 as shown in the flow of "3B". According to each second multiplication request received by the receiving module 110, the originating point represented by the originating point information and the sharing point indicated by the common point information included in each second sharing request may be respectively planned. The destination point indicated by the point information and the plurality of expected driving routes of the drop-off point indicated by the vehicle point information included in the second sharing request (step 251). In this embodiment, since there are two second co-multiplication requests, the path planning module 140 will plan and start with two expected driving routes, one of which is the starting point of the expected driving route. To initiate point 411, and through the common point 421 and the destination point 412, the destination is the drop-off point 422, the starting point of the other expected driving route is the originating point 411, and the passing point 451 and the destination point 412, and the ending point is the getting-off point 452. .

After the path planning module 140 separately plans the expected driving route according to the originating point information, the common point information, the destination point information, and the respective getting off point information (step 251), the reference point determining unit 161 can determine the reference point from the expected driving route. (Step 252). In the present embodiment, it is assumed that the reference point decision unit 161 decides the origination point 411 as the reference point.

After the reference point determining unit 161 determines the reference point (step 252), the distance calculating unit 162 can calculate the departure starting point according to the originating point information in the first sharing request and the sharing point information in the two second sharing requests. 411 and the common point 421 and the starting point distance 311, 331 between the originating point 411 and the sharing point 451 (step 253), the angle calculating unit 163 according to the destination point information in the first sharing request and the two second sharing requests The get-off point information in the middle calculates the start point 312, 332 of the departure start point 411 (reference point) to the destination point 412 and the start point 411 to the drop-off point 422 and to the drop-off point 452, respectively (step 254).

Then, the request selection unit 166a can select the second starting point distance calculated by the distance calculating unit 162 and the two ending angles calculated by the angle calculating module 163 to select all or part of the second total received by the receiving module 110. Multiply the request (step 250). In this embodiment, it is assumed that the starting point distance 311 between the originating point 411 and the sharing point 421 is 413 meters, the starting point distance 331 between the originating point 411 and the sharing point 451 is 315 meters, and the destination point 412 initiates the point 411 to get off. The angle 312 formed by the point 422 is 28 degrees, and the angle 332 formed by the point 452 of the point 411 of the point 411 is 20 degrees. If the threshold is 500 meters and the threshold is 30, the threshold is 30. The request selection module 160 determines that the starting point distance 311 between the originating point 411 and the sharing point 421 and the starting point distance 331 between the originating point 411 and the sharing point 451 all meet the distance threshold, and the destination point 412 initiates the point 411. The end angle 312 formed by the drop point 422 and the end angle 332 formed by the destination point 412 launch point 452 of the drop point 452 also meet the angle threshold. Therefore, the request selection unit 166a selects all the second share requests, that is, Two second multi-share requests received by the receiving module 110 are selected.

If the request selection module 160 includes the overlap comparison unit 165 and the request selection unit 166b in addition to the reference point decision unit 161, the distance calculation unit 162, the included angle calculation unit 163, and the request selection unit 166a, the request selection unit is requested. After the 166a selects the second multi-subscription request, the path planning module 140 may, according to the flow of the "3C", the path planning module 140 may include the origin information included in the first reciprocating request received by the receiving module 110. And the destination point information, the planning starting point is the starting point 411 indicated by the originating point information, and the ending point is the reference driving route 781 of the destination point 412 indicated by the destination point information (step 256), and may be received according to the receiving module 110. Each second multiplication request is planned to be a common point 42/451 represented by the common point information included in each second multiplication request, and the end point is represented by the vehicle point information included in the same second sharing request The commuting route 785/786 of the bus point 422/452 is below (step 257), as shown in "Fig. 5C".

Thereafter, the overlap comparison unit 165 can calculate the overlap ratio of the reference driving route 781 and the shared riding route 785/786. In the present embodiment, it is assumed that the overlap ratio unit 165 calculates that the overlap ratio of the reference travel route 781 and the shared travel route 785 is 60%, and the overlap ratio between the reference travel route 781 and the shared travel route 786 is also 60%.

After the overlap ratio unit 165 calculates the overlap ratio of the reference driving route and the shared riding route, the request selecting unit 166b may select a second sharing request according to the overlapping ratio of the reference driving route and each of the shared driving routes (step 259). . In this embodiment, since the overlapping ratio of the shared driving route 785 and the shared driving route 786 to the reference driving route 781 is the same 60%, the request selecting unit 166b can also simultaneously select the path planning module 140 to plan. The second multi-ride request of the shared travel route 785 and the shared travel route 786, that is, the two second multi-share requests received by the receiving module 110.

In fact, when the overlapping ratio of the two or more shared driving routes to the reference driving route is the same, the request selecting unit 166b further selects the second sharing request according to the length of the shared driving route 785 and the shared riding route 786. In this embodiment, if the length of the shared travel route 785 is shorter than the shared travel route 786, the request selection unit 166b will select the route planning module 140 to plan a common ride route 785 with a shorter travel route. Second commuting request.

In practice, if the parameter determination module 150 is further included in the system of the present invention, the parameter determination module 150 may be in the "3D map" before requesting the selection module 160 to select the second sharing request (step 250). As shown in the process, it is first determined whether the first pairing parameter corresponding to the first identification data in the first sharing request matches the second pairing parameter corresponding to the second identification data in the second sharing request (step 230). Then, when the second selection request is selected, the request selection module 160 selects the corresponding starting distance to meet the distance threshold, the corresponding end angle meets the angle threshold, and the corresponding second identification data matches the first identification data. The second multiplication request, that is, if the parameter determination module 150 determines the first pairing parameter corresponding to the first identification data in the first sharing request and the second identification data in the second sharing request Corresponding second The pairing parameters do not match, even if the starting distance between the sharing point indicated by the sharing point information in the second sharing request and the starting point meets the distance threshold value, and the sharing point information in the second sharing request is represented by The angle between the exit point and the starting point formed by the originating point and the destination point also meets the angle threshold, and the request selection module 160 does not select the second sharing request. In this embodiment, it is assumed that the parameter determining module 150 determines that the second pairing parameter corresponding to the second identification data in the two second sharing requests is the first corresponding to the first identification data in the first sharing request. The pairing parameters are consistent. Therefore, the request selection module 160 also selects two second sharing requests received by the receiving module 110.

After the request selection module 160 selects the second co-multiplication request (step 250), the delivery module 170 can transmit the co-occupant information to the first device (step 262). In this embodiment, it is assumed that the sharer information transmitted by the transfer module 170 includes the share point information in the second share request selected by the request selection module 160, wherein the share point information is a share point. The latitude and longitude allows the first device to mark the two-user shared point of the two second users in the electronic map displayed by the first device according to the latitude and longitude transmitted by the transmission module 170.

Also after requesting the selection module 160 to select the second reciprocal request (step 250), the pairing module 180 can pair the first reciprocal request with the two second co-multiplication requests selected by the requested selection module 160 (step 280a). That is, the first user of the match is shared with the two second users, so that the first user can block the taxi to go to the two shared points one by one to connect the two second users to the shared taxi.

In practice, after the pairing module 180 pairs the first sharing request and the second sharing request (step 280a), the transmitting module 170 can transmit the originating point information and the destination point information to transmit the paired second sharing request. The second device (step 266). In this embodiment, that is, the transmission module 170 transmits the origination point information and the destination point information separately. Sending to the device used by the two second users, and even the transmitting module 170 can transmit the common point data and the getting off point information in the other second sharing request paired with the first sharing request to the second The device used by the user causes the two second users to know the starting point and the ending point of the first user or all users, but the invention is not limited thereto.

In the above embodiment, after the transmitting module 170 transmits the occupant information to the first device (step 262), the receiving module 110 can wait for receiving the first device to return as shown in the flow of "3E". Selection data (step 270). The first user may operate the first device to select a common multiplication by the sharing point represented by the two common point information included in the share passenger information and the drop-off point indicated by the two get-off point information. The first device generates a corresponding selection data, and transmits the generated selection data to the receiving module 110.

The receiving module 110 receives the selection data returned by the first device (step 270). Then, the pairing module 180 can pair the first sharing request and the second sharing request corresponding to the selected data according to the selection data received by the receiving module 110 (step 280b).

After the pairing module 180 pairs the first sharing request and the second sharing request corresponding to the selected data received by the receiving module 110 (step 280b), the transmitting module 170 can transmit the originating point information and the destination point information to A second device that transmits the paired second multiplication request (step 266) causes the second user to know the start and end points of the first user to be shared.

The transmitting module 170 may even respectively transmit the sharing point information and/or the getting off point information in the other second sharing request paired with the first sharing request to the second device transmitting the second sharing request, in this implementation In the example, the transfer module 170 transmits Initiating point information, destination point information, sharing point information indicating the sharing point 451, and the getting off point information indicating the getting off point 452 to transmitting the point information indicating the sharing point 421 and the point information indicating the getting off point 422 The second device of the second multiplication request, and the transmission initiation point information, the destination point information, the common point information indicating the common point 421, and the drop-off point information indicating the getting-off point 422 to the transmission including the indication of the common point 451 A second means of sharing the point information with a second co-multiplication request indicating the point information under the drop-off point 452.

In addition, in the above four embodiments, the pairing module 180 pairs the first sharing request with the second sharing request selected by the requested selection module 160 (step 280a) or pairing the first sharing request and corresponding selection. After the second reciprocal request of the data (step 280b), the receiving module 110 may receive the deleted data transmitted by the first device as shown in the flow of the "3F" (step 242), and the pairing module 180 may The deleted data received by the receiving module 110 cancels pairing of the paired second shared data with the first shared data (step 246). The first user can select the co-occupant to be shared according to the common device and the getting-off point displayed by the first device, so that the first device generates corresponding deletion data, and transmits the generated information. The data is deleted to the receiving module 110.

After the transmitting module 170 transmits the originating point information and the destination point information to the second device that transmits the paired second sharing request (step 266), the second user can operate the second device to cause the second device to generate the phase. Corresponding deletion data is transmitted, and the generated deletion data is transmitted to the receiving module 110. The receiving module 110 can receive the deleted data transmitted by the second device as shown in the process of the “3F” (step 242), and the pairing module 180 can cancel the paired according to the deleted data received by the receiving module 110. Pairing of the second collocation data with the first collocation data (step 246).

In addition, in the above four embodiments, if the system of the present invention further includes an evaluation processing module 190, after each shared user arrives at the end point, the pairing module 180 is paired with the first common multiplication in practice. Requesting a second reciprocal request selected by the requested selection module 160 (step 280a) or pairing the first reciprocal request with a second reciprocal request corresponding to the selected material (step 280b), the first user/second use The first device/second device can be operated to transmit a second user evaluation/first user evaluation corresponding to the second identification data/first identification data indicating the second user/first user to perform the present invention. The server.

As shown in the flow of the "3G", the receiving module 110 receives the second evaluation data/first evaluation corresponding to the second identification data/first identification data transmitted by the first device/each second device. After the data (steps 291, 295), the evaluation processing module 190 can adjust the second evaluation data/first evaluation data corresponding to the second evaluation data/first evaluation data received by the receiving module (steps 293, 297). ).

In summary, it can be seen that the difference between the present invention and the prior art is that there is a first co-multiplication request for receiving information including the origination point information and the destination point information, and a second co-multiplication request for receiving the information of the share point and the get-off point information. And calculating a starting distance between the originating point and the sharing point according to the information of the originating point, the information of the common point, the information of the destination point, and the information of each getting off point, and calculating the angle between the starting point and the destination point and the starting point formed by the starting point to the getting off point, And/or calculating the overlap ratio of the originating point to the destination point and the driving route of the commuting point to the getting off point, so as to combine the first sharing request and the second sharing request technical means, the prior art can be solved by using a technical means There is a problem that there is no sharing service to match the rider, and the technical effect of pairing appropriate user sharing is achieved.

Furthermore, the method for pairing and matching of the occupants of the present invention can be implemented in hardware, software or a combination of hardware and software, or can be implemented in a centralized manner in a computer system or This is achieved by a distributed approach in which different components are interspersed among several interconnected computer systems.

While the embodiments of the present invention have been described above, the above description is not intended to limit the scope of the invention. Any modification of the form and details of the practice of the present invention, which is a matter of ordinary skill in the art to which the present invention pertains, is a patent protection of the present invention. range. The scope of the invention is to be determined by the scope of the appended claims.

110‧‧‧ receiving module

140‧‧‧Path Planning Module

150‧‧‧Parameter judgment module

160‧‧‧Request selection module

161‧‧‧ benchmark point decision unit

162‧‧‧Distance calculation unit

163‧‧‧ Angle calculation unit

165‧‧‧Overlapping unit

166a‧‧‧Request selection unit

166b‧‧‧Request selection unit

170‧‧‧Transmission module

180‧‧‧ Pairing module

190‧‧‧Evaluation processing module

311~331‧‧‧ starting distance

312~332‧‧‧End angle

411‧‧‧Initiation point

412‧‧‧ destination

421‧‧‧Common points

422‧‧‧Get off

431‧‧‧Common points

432‧‧‧Get off

451‧‧‧Common points

452‧‧‧Get off

500‧‧‧ benchmark

602‧‧‧ Park

606‧‧‧ Bridge

721‧‧‧Expected driving route

731, 732‧‧‧ expected driving path

751, 755‧‧‧ Expected driving route

761‧‧‧ benchmark driving route

765, 766‧‧‧ ride path

781‧‧‧Based driving route

785, 786‧‧ ‧ ride path

Step 202‧‧‧ receives the first reciprocating request transmitted by the first device, where the first reciprocating request includes information indicating the origin of the originating point and the destination information indicating the destination point

Step 206‧‧‧ receives a second multiplication request transmitted by the second device, where the second co-multiplication request includes information about the common point of the shared point and the indication of the drop-off point Get off point information

Step 230‧‧‧ determines whether the first pairing parameter corresponding to the first identification data in the first sharing request matches the second pairing parameter corresponding to the second identification data in the second sharing request

Step 242‧‧‧ Receive the deleted data transmitted by the first device/second device

Step 246‧‧‧ Cancel the pairing of the first multi-share request with the paired second-share request

Step 250‧‧‧Select the second multi-share request based on the information of the origination point, the information of the common point, the destination point information, and the information of each drop-off point

Step 251‧‧‧Develop the driving route separately according to the information of the origination point, the information of the common point, the information of the destination point and the information of each drop-off point

Step 252‧‧‧Determining the reference point in the driving route

Step 253‧‧‧ Calculate the starting distance between the originating point and the sharing point based on the originating point information and the common point information

Step 254‧‧‧ Calculate the angle from the reference point to the destination point and the end point of the reference point to the drop-off point based on the destination point information and the get-off point information

Step 255‧‧‧Selecting the second multiplication request, the distance between the common point indicated by the shared point information included in the selected second multiplication request and the starting point is less than the distance threshold, and the reference point is The angle between the vehicle point and the end point of the reference point to the destination point indicated by the vehicle point information included in the selected second multiplication request is less than the angle threshold value.

Step 256‧‧‧ Plan the driving route based on the information of the originating point and the destination information

Step 257‧‧‧ Plan for the shared ride route based on the shared point information and the drop-off point information

Step 259‧‧‧Select according to the overlap ratio between the baseline driving route and the shared driving route Second multiplication request

Step 262 ‧ ‧ transmit the occupant information to the first device, the occupant information includes the com-pick point information or the collocation point information and the get-off point information included in the selected second collocation request

Step 266‧‧‧ transmitting the originating point information and/or destination point information to the second device transmitting the paired second multiplicative request

Step 270‧‧‧ Receive selected data transmitted by the first device

Step 280a‧‧‧ Pairing the first multi-share request with the selected second-share request

Step 280b‧‧‧ Pairing the first commutation request and the second multiplication request corresponding to the selected material

Step 291‧‧‧ Receive the first evaluation data corresponding to the first identification data included in the first reciprocating request

Step 293‧‧‧ adjust the first pairing parameter corresponding to the first identification data according to the first evaluation data

Step 295‧‧‧ receiving the second evaluation data corresponding to the second identification data included in the second reciprocating request

Step 297‧‧‧ adjust the second pairing parameter corresponding to the second identification data according to the second evaluation data

Figure 1 is a system architecture diagram of the carrier pairing of the present invention.

FIG. 2A is a schematic diagram of components of the request selection module according to the present invention.

FIG. 2B is a schematic diagram of another component of the request selection module proposed by the present invention.

FIG. 3A is a flow chart of a method for pairing a carrier of a common carrier according to the present invention.

Figure 3B is a flow chart of a detailed method of request selection in accordance with the present invention.

Figure 3C is a flow chart of a detailed method of request selection in accordance with the present invention.

The 3D figure is a flow chart of an additional method for judging whether the pairing parameters are consistent according to the present invention.

FIG. 3E is a flow chart of an additional method for selecting a data pairing and multiplying request according to the present invention.

Figure 3F is a flow chart of an additional method for canceling the pairing and multiplication request proposed by the present invention.

Figure 3G is a flow chart of an additional method of adjusting user evaluation proposed by the present invention.

FIG. 4A is a schematic diagram of a starting point, a destination point, a sharing point, and a getting off point of the pairing of two users that can be paired according to an embodiment of the present invention.

FIG. 4B is a schematic diagram of the pairing of two users that can be paired according to an embodiment of the present invention. Schematic diagram of the detour of the point, destination point, common point, and get off point.

FIG. 4C is a schematic diagram of the bridge of the originating point, the destination point, the sharing point, and the getting off point of the pairable multi-user sharing according to the embodiment of the present invention.

FIG. 5A is a schematic diagram of a starting point, a destination point, a sharing point, and a getting off point of the pairing multi-user sharing according to the embodiment of the present invention.

FIG. 5B is a schematic diagram of the originating point, the destination point, the sharing point, and the getting off point of the pairing multi-user sharing according to the embodiment of the present invention.

FIG. 5C is a schematic diagram of the originating point, the destination point, the sharing point, and the getting off point of the pairable multi-user sharing according to the embodiment of the present invention.

Step 202‧‧‧ receives the first reciprocating request transmitted by the first device, where the first reciprocating request includes information indicating the origin of the originating point and the destination information indicating the destination point

Step 206‧‧‧ receives the second multiplication request transmitted by the second device, and the second co-multiplication request includes the information of the common point indicating the common point and the information of the vehicle point under the drop-off point

Step 250‧‧‧Select the second multi-share request based on the information of the origination point, the information of the common point, the destination point information, and the information of each drop-off point

Step 262 ‧ ‧ transmit the occupant information to the first device, the occupant information includes the com-pick point information or the collocation point information and the get-off point information included in the selected second collocation request

Step 266‧‧‧ transmitting the originating point information and/or destination point information to the second device transmitting the paired second multiplicative request

Step 280a‧‧‧ Pairing the first multi-share request with the selected second-share request

Claims (9)

  1. A method for co-occupant pairing, the method comprising at least the steps of: receiving a first co-multiplication request transmitted by a first device, the first co-multiplication request comprising indicating a start point information and a representation of a originating point a destination information of one of the destination points; receiving a second multi-multiplication request transmitted by at least one second device, each of the second multi-multiplication requests each comprising one of a common point of sharing point information and one of the indicated points The information of the departure point; calculating the distance between the starting point and each of the sharing points according to the information of the originating point and each of the sharing point information, and calculating a reference point according to the destination point information and each of the getting off point information to the destination And selecting an angle between the reference point and each end point of each of the getting off points, and selecting at least one second sharing request according to each of the starting point distance and each of the midpoint angles; transmitting a common passenger information to the first device, the total The passenger information includes at least the sharing point information included in each selected second sharing request or the sharing point information and the getting off point information included in each selected second sharing request; and pairing the first Total Request and the plurality of second carpool is selected.
  2. The method for matching a common carrier according to claim 1, wherein the starting point distance between the starting point and each of the sharing points is calculated according to the starting point information and each of the sharing point information, according to the The target point information and each of the getting off point information are used to calculate a corner from the reference point to the target point and the reference point to each of the exit points, and select at least one second total according to each of the starting point distance and each of the midpoint angles The step of requesting the request further includes planning an expected driving route according to the information of the originating point and the information of the destination point, and determining a reference point in the expected driving route. Calculating, according to the originating point information and each of the sharing point information, a starting distance between the starting point and each of the sharing points, calculating the reference point to the destination point and the reference according to the destination point information and each of the getting off point information Pointing to each of the ending angles of each of the getting-off points, selecting at least one second multi-share request, the common-sharing point indicated by the shared-point information included in each selected second-share request, and the originating point The starting point distance meets a distance threshold value, and the reference point to the selected second destination of the selected second sharing request includes the point of departure of the vehicle point and the end point of the reference point to the destination point according to an angle threshold value .
  3. The method of claiming a matchmaking of a common passenger according to claim 1, wherein the method further comprises selecting one of the first first multiplication requests before the step of selecting at least one of the second multiplication requests And a step of identifying, by the first pairing parameter, the first pairing parameter corresponding to one of the second pairing parameters corresponding to the second identification data of each of the second sharing requests.
  4. The method of pairing a matchmaker according to claim 1, wherein the step of pairing the first share request with the selected second share request further comprises transmitting according to the first device And selecting a data, and pairing the first multi-share request with the step of at least one second co-multiplication request corresponding to the selected data.
  5. The method of claiming the pairing of the occupants according to claim 1, wherein the method further comprises receiving and the pair after the pairing the first comma request and the selected second collocation request Corresponding to one of the first identification data corresponding to the first identification data, and adjusting one of the first pairing parameters corresponding to the first identification data according to the first evaluation data, and/or receiving the second matching parameter The second identification data corresponding to the second identification data is included in the second evaluation data, and the second matching corresponding to the second identification data is adjusted according to the second evaluation data. Steps to the parameters.
  6. The method of claiming a matchmaking of the occupant according to claim 1, wherein the method further comprises, after the step of pairing the first squaring request with the selected second squaring requests, And deleting, by the first device/the second device, the deletion of the data, and canceling the step of pairing the first share request with the at least one paired second share request.
  7. A system for carrier pairing, the system comprising: a receiving module for receiving a first sharing request transmitted by a first device, and receiving one of the at least one second device a second co-multiplication request, wherein the first reciprocal request includes information indicating that one of the originating points initiates the point information and the destination point indicating one of the destination points, and each of the second reciprocating requests each includes a total of one of the sharing points Multiplying point information and indicating one of the departure point information of the vehicle point; a request selection module for calculating the distance between the starting point and each of the sharing points according to the starting point information and each of the sharing point information, And calculating, according to the target point information and each of the getting off point information, an angle between the reference point and the target point and each of the reference points to each of the getting off points, and selecting at least one of the points according to the starting point distance and the angle of each of the midpoints The second sharing request selects at least one second sharing request; a transmitting module for transmitting a common passenger information to the first device and/or a dispatching vehicle system, the shared passenger information including at least each selected one Second sharing Requesting the shared point information included; and a pairing module for pairing the first share request with the selected second share request.
  8. The system of claiming a matchmaking pairing as described in claim 7, wherein the request selection module is configured to plan an expected driving route based on the originating point information and the destination point information, and determine one in the expected driving route. a reference point, calculating a distance between the starting point and each of the sharing points according to the information of the originating point and each of the sharing point information, and calculating the reference point to the destination point according to the destination point information and each of the getting off point information And an angle between the reference point and each end point of each of the getting-off points, selecting a distance between the common point represented by the included common point information and the starting point of the starting point to meet a distance threshold, and the reference point is selected The second sharing request includes at least one second sharing request of the drop point indicated by the vehicle point information and the end point of the reference point to the destination point.
  9. The system of claim 5, wherein the request selection module selects a second number of multiplication requests equal to the number of times the one of the first multiplication requests is included.
TW101118072A 2012-05-21 2012-05-21 System for matching users and a method thereof TWI550534B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW101118072A TWI550534B (en) 2012-05-21 2012-05-21 System for matching users and a method thereof

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
TW101118072A TWI550534B (en) 2012-05-21 2012-05-21 System for matching users and a method thereof
CN201210240642.XA CN103426139B (en) 2012-05-21 2012-07-11 System and method that person matchmaker close pairing are not multiplied altogether

Publications (2)

Publication Number Publication Date
TW201349146A TW201349146A (en) 2013-12-01
TWI550534B true TWI550534B (en) 2016-09-21

Family

ID=49650836

Family Applications (1)

Application Number Title Priority Date Filing Date
TW101118072A TWI550534B (en) 2012-05-21 2012-05-21 System for matching users and a method thereof

Country Status (2)

Country Link
CN (1) CN103426139B (en)
TW (1) TWI550534B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI707291B (en) 2018-05-14 2020-10-11 淡江大學 Car-pool system and method thereof

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6423520B2 (en) 2014-04-24 2018-11-14 ベイジン ディディ インフィニティ テクノロジー アンド ディベロップメント カンパニー リミティッド System and method for managing service supply status
CN104123836B (en) * 2014-07-29 2016-04-06 北京嘀嘀无限科技发展有限公司 Based on the order supplying system of city chauffeur order time place combination
CN105070040A (en) * 2015-07-18 2015-11-18 成都生辉电子科技有限公司 Carpool method facilitating vehicle owner filtering
TWI596565B (en) * 2015-12-11 2017-08-21 建漢科技股份有限公司 Transport System and Method
GB2554211A (en) * 2016-02-24 2018-03-28 Beijing Didi Infinity Technology & Dev Co Ltd Methods and systems for carpooling
CN107169815A (en) * 2016-03-08 2017-09-15 滴滴(中国)科技有限公司 The method and apparatus of share-car between a kind of acquaintance
CN107341558A (en) * 2016-04-28 2017-11-10 李哲荣 Multiply the computational methods in path and the computing device and record media using the method altogether
TWI644282B (en) * 2017-05-02 2018-12-11 林庠序 Ridesharing-based carbon credit creation system and related ridesharing matching subsystem

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003040971A1 (en) * 2001-11-07 2003-05-15 Sitra Ltd. Request matching system and method
US20080114629A1 (en) * 2006-11-09 2008-05-15 Yahoo! Inc. System for matching users and transportation providers
TW201007203A (en) * 2008-08-13 2010-02-16 Chunghwa Telecom Co Ltd Carpool service method
CN101216913B (en) * 2008-01-11 2010-11-10 北京工业大学 Multistage screening method of carpool dynamic matching
CN102243686A (en) * 2011-04-08 2011-11-16 孙宏民 Dynamic carpooling service system for operating vehicles and method thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003040971A1 (en) * 2001-11-07 2003-05-15 Sitra Ltd. Request matching system and method
US20080114629A1 (en) * 2006-11-09 2008-05-15 Yahoo! Inc. System for matching users and transportation providers
CN101216913B (en) * 2008-01-11 2010-11-10 北京工业大学 Multistage screening method of carpool dynamic matching
TW201007203A (en) * 2008-08-13 2010-02-16 Chunghwa Telecom Co Ltd Carpool service method
CN102243686A (en) * 2011-04-08 2011-11-16 孙宏民 Dynamic carpooling service system for operating vehicles and method thereof

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI707291B (en) 2018-05-14 2020-10-11 淡江大學 Car-pool system and method thereof

Also Published As

Publication number Publication date
CN103426139B (en) 2017-10-10
TW201349146A (en) 2013-12-01
CN103426139A (en) 2013-12-04

Similar Documents

Publication Publication Date Title
US10677604B1 (en) Continuously updatable computer-generated routes with continuously configurable virtual bus stops for passenger ride-sharing of a fleet of ride-sharing vehicles and computer transportation systems and computer-implemented methods for use thereof
US10753754B2 (en) Managing autonomous vehicles
Shaheen et al. Mobility and the sharing economy: Potential to facilitate the first-and last-mile public transit connections
US10197410B2 (en) Dynamic real-time carpool matching
US9599482B2 (en) Method and central processing unit for the unmanned control of a vehicle
US20170300848A1 (en) System and Method for Transportation
US10176703B2 (en) Systems and methods for monitoring on-route transportations
JP6523177B2 (en) Vehicle management system
RU2717114C2 (en) System for control of group trips on vehicle (embodiments) and method of control of group trips on vehicle
DE102016107712A1 (en) Ridesharing-range contours
US20180108103A1 (en) Systems and methods for matching and displaying service request and available vehicles
US10147154B2 (en) System to facilitate a correct identification of a service provider
CN103364002B (en) With reference to real-time road and the route planning system and method for public transport operation information
CN105210119B (en) The location data points provided by computing device determine the number of pass cost
US10692367B2 (en) Connected and adaptive vehicle traffic management system with digital prioritization
US8688532B2 (en) Real-time ride share system
US7941267B2 (en) Methods, systems and computer program products for ride matching based on selection criteria and driver characteristic information
US9373259B2 (en) Situation-aware mobile travel advisory to public transport commuters
US20160202079A1 (en) Methods and systems for obtaining a multi-modal route
US10563996B2 (en) System for generating travel route to be serviced by primary transportation service and secondary transportation service
CN108027906A (en) Multiply the system and method for scheduling and route altogether for adjusting
US10217069B2 (en) Systems and methods for vehicle resource management
US20140012498A1 (en) Informed Traveler Program and Application
US20150371153A1 (en) Vehicle Sharing System Supporting Nested Vehicle Sharing Within A Loan Period For A Primary Vehicle Borrower
CN107430008A (en) Public and customized travel plan

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees