CN104236569A - Method and device for determining optimal meeting point - Google Patents
Method and device for determining optimal meeting point Download PDFInfo
- Publication number
- CN104236569A CN104236569A CN201310250016.3A CN201310250016A CN104236569A CN 104236569 A CN104236569 A CN 104236569A CN 201310250016 A CN201310250016 A CN 201310250016A CN 104236569 A CN104236569 A CN 104236569A
- Authority
- CN
- China
- Prior art keywords
- point
- destination
- meeting point
- route
- starting point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3605—Destination input or retrieval
- G01C21/3614—Destination input or retrieval through interaction with a road map, e.g. selecting a POI icon on a road map
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
The invention provides a method for determining an optimal meeting point for a plurality of movable bodies which are appointed to meet in advance in order to go to the same destination from different starting points. The method comprises the following steps: an obtaining step: obtaining respective starting points and destinations of the plurality of movable bodies; and a determination step: carrying out route search according to respective starting points and destinations of the plurality of movable bodies by using map data, and determining the meeting point to be the optimal meeting point in a manner that the sum of costs caused by the fact that each movable body passes through the meeting point to reach the destination in each route is approximately minimum.
Description
Technical field
The present invention relates to a kind of for going to identical destination from different starting point and arranging the method and apparatus that multiple moving bodys of joining in advance determine optimum meeting point, destination can not only can be gone to make the plurality of moving body easily after joining in this meeting point by selecting for the plurality of moving body meeting point, and can by multiple moving body from different starting point via total cost minimization of this arrival destination, meeting point or approximately to minimize.
Background technology
As a kind of social animal, the behavior that the mankind go in group is long-standing.In other words, go in group and can be understood as common trip, namely the several personnel in identical or different place meet in advance, then jointly go to certain same endpoint.
At present, when calculating the route of engagement point and corresponding each personnel in advance, people generally select engagement point in advance according to the experience of self, and the route planning system re-used on internet calculates.First respectively route planning is carried out to the starting point of each personnel and the engagement point in advance of selection, and then the route of planning from engagement point to terminal.But, when being unfamiliar with the traffic trip situation of involved geographic area, people are just difficult to select this engagement point in advance according to experience, drawn result and best situation may be caused like this to differ greatly, and cause the loss of time, money aspect.
In known technology, the patent documentations such as such as US5802492, EP1357357, EP2533013, EP1593938 all propose the method for carrying out route planning, at every turn to single personnel, carry out route planning from single starting point to single terminal.That is, in known technology, user inputs the starting point of a route and the terminal of a route at corresponding interface, after system obtains the searching requirement of user, calculate corresponding route planning from starting point to terminal by diverse ways, driving route planning, bus routes planning, Walking Route planning or multimode traffic route planning etc. can be comprised.
In addition, existing known technology also proposes the route planning from a starting point to multiple destination, and namely, a starting point is through the route planning of one or more transit point to a destination.For the patent documentation EP1193626 as known technology, this known technology proposes a kind of route planning system, and this system can calculate from certain a starting point, through the route planning of multiple transit point.User can input starting point, transit point or terminal in the user interface of this system, and system calculates corresponding route by corresponding method, and is presented on the map of user interface by route.
Summary of the invention
In sum, existing known technology only provides personnel from single starting point to the route planning of a terminal or multiple terminal.The shortcoming of known technology is, when several personnel are from multiple different starting point to same terminal, known technology cannot provide corresponding route planning.Particularly in, when user require for from multiple personnel from different starting points through the route planning of a unspecified in advance engagement point to unified terminal, known technology cannot provide corresponding route planning.
Especially, personnel for different location make an appointment and go to the situation of certain same endpoint, participate in the personnel of common trip, or select to reach home respectively, or certain place (hereinafter referred to as shifting to an earlier date engagement point or meeting point) goes to terminal after meeting together again before reaching home.Here, the former can simply use the route of the route planning system on existing internet to many people to plan respectively, namely carries out route planning to everyone starting point and terminal respectively.
By contrast, existing known technology cannot carry out route planning for the latter.The mode of terminal is gone to together again after several personnel in different location meet in certain place before reaching home, first can reduce total transport cost of personnel, reduce CO2 emission, such as, personnel can drive to go to certain engagement point in advance respectively, then take same car and go to terminal.Secondly, personnel, by going together with the other staff being familiar with route (as a car leads an other car), can reduce the time that traffic spends, destination of reaching home more easily.
In order to the above-mentioned defect overcoming prior art proposes the present invention.The object of the invention is to propose a kind of for going to identical destination from different starting point and arranging the method and apparatus that multiple moving bodys of joining in advance determine optimum meeting point, destination can not only can be gone to make the plurality of moving body easily after joining in this meeting point by selecting for the plurality of moving body meeting point, and can by multiple moving body from different starting point via total cost minimization of this arrival destination, meeting point or approximately to minimize.
To achieve these goals, propose a kind of for going to identical destination from different starting point and arranging the method that multiple moving bodys of joining in advance determine optimum meeting point, comprise: obtaining step, obtain the respective starting point of described multiple moving body and destination; And determining step, utilize map datum, carry out route search according to the respective starting point of described multiple moving body and destination, the cost summation arriving each route of described destination according to each moving body through meeting point is similar to minimum mode, this meeting point is defined as optimum meeting point.
Preferably, described cost is distance.
Preferably, described determining step comprises: utilize map datum, with the respective starting point of described multiple moving body and described destination for starting point carries out route retrieval respectively, when detecting that the retrieval of all these routes has a common accessing points, described common accessing points is defined as the meeting point of described optimum.
Preferably, when carrying out route retrieval with described destination for starting point, in the process of carrying out route retrieval, giving up the section that backhaul is impassable, and section unidirectional for backhaul is set to two-way section of passing through.
Preferably, described route retrieval adopts the thorough formula searching algorithm of enlightening Coase progressively to retrieve.
Preferably, described meeting point is the point together leaving for described destination after arriving this meeting point for described multiple moving body again.
Preferably, described meeting point is the point that the moving body merging into smaller amounts after arriving this meeting point for described multiple moving body together leaves for destination again.
In addition, according to the present invention, propose and a kind ofly to comprise: acquiring unit for going to identical destination from different starting point and arranging the device that multiple moving bodys of joining in advance determine optimum meeting point, obtain the respective starting point of described multiple moving body and destination; And determining unit, utilize map datum, carry out route search according to the respective starting point of described multiple moving body and destination, the cost summation arriving each route of described destination according to each moving body through meeting point is similar to minimum mode, this meeting point is defined as optimum meeting point.
As mentioned above, the present invention relates to one is carried out route planning system for several personnel's trip, system involved in the present invention, for the several personnel in different starting point of common trip, provides corresponding route planning.Invention especially provides a kind of route planning mode, the route planned can guide several personnel, after meeting in certain place in the road going to terminal, jointly reach home again, and by determining optimum engagement point (meeting point), can by multiple moving body from different starting point via total cost minimization of this arrival destination, meeting point or approximately to minimize.
Accompanying drawing explanation
By reference to below in conjunction with accompanying drawing to adopted detailed description of the preferred embodiment, above-mentioned purpose of the present invention, advantage and feature will become more apparent, wherein:
Fig. 1 is the schematic diagram according to system architecture of the present invention.
Fig. 2 is according to functional block diagram of the present invention.
Fig. 3 is the figure for describing user interface of the present invention in detail.
Fig. 4 is the process flow diagram how obtaining the process of the relevant search information of user's input for describing system of the present invention in detail.
Fig. 5 is that system makes the process flow diagram of the process of correlation computations for describing for whether presetting engagement point in advance.
Fig. 6 be for describe in detail for do not preset in advance engagement point time, the process flow diagram of the process of the corresponding engagement point in advance of system-computed and relevant routes planning.
Fig. 7 is the schematic diagram of the computing method explaining Fig. 6 by way of example.
Fig. 8 is the figure that citing describes the using method of the present invention in logistics distribution.
Fig. 9 is the figure that citing describes the prior art " the thorough search of enlightening Coase " that the present invention uses.
Embodiment
Describe the preferred embodiments of the present invention in detail below with reference to the accompanying drawings.
< embodiment 1>
Fig. 1 illustrates the system architecture of exemplary of the present invention.Wherein, 110 is Internet; 104 for using the equipment of user interface as traffic navigation instrument or mobile phone etc. containing the computing machine of user interface or other, and the user carrying out route search carrys out typing search information by the user interface of 104 equipment, and feeds back display of search results; The equipment of the other staff that 106 representatives are this time gone on a journey jointly, can comprise mobile phone, computing machine, traffic navigation instrument etc.; 102 for carrying out the server of route planning.User passes through the user interface typing information of 104 and the information of other staff, to carry out the search of engagement point selection in advance and route planning.After the user interface of 104 gathers these information, be sent to server 102 by internet 110.Server 102 processes the information gathered, and generates corresponding route planning.Afterwards, open space planning eventually through internet 110, sends and is shown on the personnel equipment 104 and 106 of the common trip of participation by server 102.
Change an angle to say, referring to the functional block diagram of Fig. 2, native system comprises calculation element 220 and an output module 230 of a user's request input media 210, engagement point and route planning in advance.At user's request input media 210, user is in the typing of the user interface of relevant device enterprising line search demand.220 calculate route planning according to the search need of user, and are presented at by output module 230 on the equipment of the personnel of user and the common trip of other participation.
Fig. 3 represents the user interface used when information is searched in typing on 104 of Fig. 1 by some users, namely 210 in Fig. 2.Wherein, user in 301, specify search pattern to plan for the concrete time, namely last user arrives the time of destination (terminal), comprises date and time; This user directly inserts the route terminal of specifying in 302; 303, user can input oneself starting point (reference position); In 305, other each participations of typing go out the starting point of administrative staff jointly, and add the starting point address of each personnel by the "+" button (310), the person number added and address will be displayed in 306.When user does not know the position of starting point of oneself setting out, electronic calendar can be selected in 304 (such as from OUTLOOK CALENDAR, select among GOOGLE CALENDAR etc.), system can determine its geographic position in certain time period, as its starting point according to the electronic calendar of user; When this user does not know that other participate in the position of the time point of personnel in 301 of common trip, "+" (307) button can be pressed, to dialog box be ejected, and require user to input or from existing contact person, select other people calendar information, positional information, contact details, trip travel pattern preference information etc. by participating in this time common trip; Wherein, after adding the people of the common trip of certain participation when 307, the name icon of this person will be presented in 309; Afterwards, user can pull 310 with mouse from 309 the same in advance lineup that engagement point is met by preparing, press 312 buttons to generate one group of grouping of meeting in advance, the difference group generated others will be presented in 314 with different colours or code name, system calculates corresponding engagement point in advance by according to starting point and terminal that often to organize people; Finally, user can use 308 (confirming buttons), and when user presses this button, the information of above input typing will be transmitted to the search need of server 102 as this common trip.
User is after user interface have input search need, and first the system of the generation route planning in server 102 analyzes the demand of user, as shown in Figure 4.First, the starting point of personnel in the terminal (step 410) of system determination route planning and each group; When the starting point of personnel is not specified (step 420 be), system obtains the starting point (step 430) of these personnel of corresponding time period from the electronic calendar of these personnel.When specifying the starting point of personnel (step 420 no), the grouping (step 425) that the participation that system obtains personnel from the typing of user is met in advance.Finally, the people that the whether all participations of systems inspection are met in advance has carried out dividing into groups (step 440).
Whether Fig. 5 shows to specify according to current persons's group and meets in advance a little accordingly, and system carries out corresponding route planning calculating.Particularly, in step 500, determine whether whether to specify current persons's group to meet in advance a little accordingly.When not specifying the corresponding point of meeting in advance (step 500 no), system-computed is met place in advance and is carried out route planning (step 600).When specifying the corresponding point of meeting in advance (step 500 be), system carries out route planning (step 520) for the place of meeting in advance set.
Fig. 6 explains the computation process of the step 600 of Fig. 5.Before this computation process of explanation, introduce the prior art that the present invention will use here, the thorough formula search of enlightening Coase.The common thorough search of enlightening Coase is the minimal path of each vertex v on calculating starting point s to map.Vertex representation physical location on map, the route between summit and summit represents the route of physics.
The common thorough search of enlightening Coase comprises the following steps: when (1) is initial, S only comprises starting point, i.e. S={v} and the distance of v to v is 0.U comprises the summit on other maps except v, in U summit u distance on limit weighted value (if v and u has limit) (if u be not v go out limit abutment points).(2) from U, choose the summit k that a distance v is minimum, k, add (this selected distance is exactly the shortest path length of v to k) in S.(3) take k as the new intermediate point considered, the distance weighting value on each summit in amendment U; If the distance (through summit k) of (u is a summit U set) is shorter than original distance (without summit k) from starting point v to summit u, then the path of amendment starting point v to summit u is through the path of summit k and revises corresponding distance weighting value.(4) step (2) and (3) is repeated until all summits are included in S.840 of Fig. 9 lists the figure of the thorough searching algorithm of enlightening Coase, wherein, asks A to arrive the shortest path on other each summits (B, C, D, E).On line be labeled as distance between adjacent segments, i.e. weighted value.Explain the process of the shortest path finding all summits in A to the figure of summit in 840 in table 1 below step by step.Wherein, each step in following table 1 is called as in the present invention " the thorough formula search of a step enlightening Coase ".
Embodiment of the present invention uses the method for a search from multiple spot to search for engagement point, thus calculated route planning.First, in step 610, the method from the terminal of the starting point of each personnel and route planning all route retrieval, namely terminal is temporarily also set to a starting point, the same with the starting point of all personnel.First, in step 611, perform once from the route retrieval of wherein any one starting point.In step 612, check whether the retrieval of this route originates in the terminal of this route retrieval.This is for the consideration to one-way road road, taboo left-hand rotation road, taboo right-hand rotation road etc. in route planning.If the starting point of current route retrieval is the terminal (step 612 no) of this route planning, the impassable section (step 616) of backhaul is given up in route retrieval, and section unidirectional for backhaul is set to two-way section (step 617) of passing through, then run " the thorough formula search of a step enlightening Coase " (step 614).This is because when calculating final route afterwards, need the route reversion route from terminal being retrieved engagement point in advance, so do like this be prevent the route from terminal retrieve this route that will reverse is put in section obstructed for backhaul, also prevent the route from terminal retrieve section unidirectional for backhaul cannot be put into this route that will reverse.If the starting point of current route retrieval is the starting point (step 612 be) of this route planning, then run " the thorough formula search of a step enlightening Coase " (step 614).
In step 614, after each search is carried out " the thorough formula search of a step enlightening Coase ", whether step 620 detects has a point by all route retrieval access.If no, run next route retrieval (step 630).Until 620 steps have checked a point by all routes retrieval access, this point has been exactly the point of meeting in advance (that is, the meeting point of the optimum drawn according to the present invention) calculated through the present embodiment.Under these conditions, search stops, and calculates every bar from each personnel's starting point through shifting to an earlier date engagement point, the route of finally reaching home in step 640.
According to said method, the present invention can utilize map datum, route search is carried out according to the respective starting point of each personnel and destination, arrive the minimum or approximate minimum mode of the distance summation of each route of described destination according to everyone through meeting point, this meeting point is defined as optimum meeting point.In other words, when selecting that arbitrarily other point is as meeting point, everyone arrives each route of described destination distance summation through these other meeting point is greater than everyone arrives each route of described destination distance summation through the meeting point of this optimum.Certainly, more than providing minimum everyone through the computing method of the distance summation of each route of optimum arrival destination, meeting point, is calculating target of the present invention.Consider in real system, the server (102 of Fig. 1) of computing system likely receives multiple computation requests simultaneously, in order to reduce computing time, the meeting point that these computing method calculate is likely the result (namely close to optimum result) of suboptimum, and correspondingly everyone passes through the distance summation of each route of this arrival destination, meeting point is approximate minimum.By contrast, embodiment 2 and similar exhaustive search method thereof can calculate the absolute minor increment of everyone through each route of arrival destination, meeting point, but, the computing method elapsed time of this type is too large, be limited to computing and the storage speed of current computing machine, cannot be applied in actual route planning system.Although embodiment 1 sometimes provides approximate minimum distance summation, because its speed is very fast, be enough to meet the current demand of user.
Fig. 7 explains the computing method of step 600 by way of example.In figure, the terminal that the starting point that A point and B point are personnel, D point are this route planning.When carrying out route planning, D point is set to interim starting point, and in step 710 stage, starts route retrieval with A point, B point, D point.In step 720 stage, M point by the point of these three route retrieval access as first, is chosen as and meets a little in advance.Herein, A point is A-> C-> M to the minimal path (route 1) of M point, B point is B-> E-> M to the minimal path (route 2) of M point, and D point is D-> F-> M to the minimal path of M point.After calculating the point of meeting in advance, step 730 stage by D point to M point minimal path reversion obtain M-> F-> D (route 3), merge route 1 and route 3 to obtain by A point through M point to the minimal path of D point being A-> C-> M-> F-> D, merge route 2 and route 3 to obtain by B point through M point to the minimal path of D point being B-> E-> M-> F-> D.
After route planning terminates, route information mails on the equipment (104 of Fig. 1 and 106) of the personnel that all participations are gone on a journey jointly by server.Route information is presented on equipment with the form of word, picture or map vector.
The variation 1> of < embodiment 1
Above, embodiment of the present invention 1 has been described in detail, but this embodiment also can change as follows.
Specifically, in this variation, user can be each group setting engagement point in advance that meets in advance in user interface (Fig. 3).Such as, after user clicks the grouping in 314, user interface can eject dialog box, and then this user can input the engagement point in advance (if do not inputted any engagement point in advance, namely not specifying certain engagement point in advance) of each group.System is according in this group, and starting point A, the terminal D of each user and the place M that meets in advance that specifies are to calculate corresponding route planning.First system calculates the minimal path of A to M, then calculates the minimal path of M to D, result is gathered afterwards and draws the minimal path of A to D through M.
According to this variation, though when user specify meet place in advance, native system still can provide corresponding route planning for related personnel.
The variation 2> of < embodiment 1
This variation is the another kind of modification to embodiment 1.In this variation, each personnel participating in common trip, in user interface (Fig. 3), are respectively divided into a group by user.Like this, this route planning does not just comprise for engagement point selection in advance or route formulation.In this case, system will make the route planning of the personnel that each participation is gone on a journey jointly respectively.According to user specify in terminal Encounter Time, calculate before Encounter Time, the route from the starting point of each personnel to terminal.
Therefore, according to this variation, even if user specifies all personnel to go to terminal respectively, native system still can provide corresponding route planning for related personnel.
< embodiment 2>
The result of calculation of embodiment 1 is approximate minimal path (namely approximate the shortest route planning), by contrast, present embodiments provide for one and calculates real minimal path.Be similar to embodiment 1, system, calculating first in advance after engagement point, proceeds to calculate, until all points on map are all had access to (that is on map, each point becomes engagement point in advance) by all route retrievals.In this process, whenever a point become in advance engagement point time, route that all routes retrieve this point just goes on record, and generates corresponding route planning.When point each on map become in advance engagement point time, search stops.The route that cost in the route planning calculated before system finds (herein cost span from, also can use oil consumption or other weight mode to weigh cost) is minimum, and corresponding engagement point in advance.This shifts to an earlier date engagement point is exactly best engagement point in advance, and its route planning is exactly real minimal path, namely best route planning of meeting.
< embodiment 3>
The Distribution path that the present invention is also applicable in road transport and logistic industry is planned, is especially applicable to apply in Common Distribution:.As shown in Figure 8, when vehicle A (805) goes to destination 830 with vehicle B (810) in the identical period, suppose vehicle A (805) and vehicle B (810) all underloads (goods total amount is less than or equal to the cargo dead-weight of a car), namely both can select before going to destination respectively, at certain (Tu8Zhong Peihuo center 815, Pei Huo center, 820, 825 one of them) carry out ressembling of goods, being merged by two car goods is contained on a lorry, make goods can transport destination 830. to by a vehicle just to need to find a Ge Peihuo center like this, make lorry A and lorry B the shortest to the distance sum of destination 830 to the Distance geometry Pei Huo center of home-delivery center, to reduce oil consumption and to reduce CO2 emission as far as possible.Here can use the computing method proposed in Fig. 6, the starting point of vehicle is equivalent to personnel's origin wherein, and the position at Pei Huo center, as the candidate point on map, is searched for.Such as, example in search graph 8, due to a car will be had to transport from Pei Huo center to destination, so when computing method are searched for from destination, need the weighted value this direction being searched for every section of section divided by 2 (owing to replacing two cars with a car).So just can find the route of the shortest total distance and corresponding Pei Huo center.
Although below show the present invention in conjunction with the preferred embodiments of the present invention, one skilled in the art will appreciate that without departing from the spirit and scope of the present invention, various amendment, replacement and change can be carried out to the present invention.Therefore, the present invention should not limited by above-described embodiment, and should be limited by claims and equivalent thereof.
Claims (8)
1., for going to identical destination from different starting point and arranging the method that multiple moving bodys of joining in advance determine optimum meeting point, comprising:
Obtaining step, obtains the respective starting point of described multiple moving body and destination; And
Determining step, utilize map datum, carry out route search according to the respective starting point of described multiple moving body and destination, the cost summation arriving each route of described destination according to each moving body through meeting point is similar to minimum mode, this meeting point is defined as optimum meeting point.
2. method according to claim 1, wherein,
Described cost is distance.
3. method according to claim 1, wherein,
Described determining step comprises:
Utilize map datum, with the respective starting point of described multiple moving body and described destination for starting point carries out route retrieval respectively, when detecting that the retrieval of all these routes has a common accessing points, described common accessing points is defined as the meeting point of described optimum.
4. method according to claim 1, wherein,
When carrying out route retrieval with described destination for starting point, in the process of carrying out route retrieval, giving up the section that backhaul is impassable, and section unidirectional for backhaul is set to two-way section of passing through.
5. method according to claim 1, wherein,
Described route retrieval adopts the thorough formula searching algorithm of enlightening Coase progressively to retrieve.
6. method according to claim 1, wherein,
Described meeting point is the point together leaving for described destination after arriving this meeting point for described multiple moving body again.
7. method according to claim 1, wherein,
Described meeting point is the point that the moving body merging into smaller amounts after arriving this meeting point for described multiple moving body together leaves for destination again.
8., for going to identical destination from different starting point and arranging the device that multiple moving bodys of joining in advance determine optimum meeting point, comprising:
Acquiring unit, obtains the respective starting point of described multiple moving body and destination; And
Determining unit, utilize map datum, carry out route search according to the respective starting point of described multiple moving body and destination, the cost summation arriving each route of described destination according to each moving body through meeting point is similar to minimum mode, this meeting point is defined as optimum meeting point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310250016.3A CN104236569A (en) | 2013-06-21 | 2013-06-21 | Method and device for determining optimal meeting point |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310250016.3A CN104236569A (en) | 2013-06-21 | 2013-06-21 | Method and device for determining optimal meeting point |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104236569A true CN104236569A (en) | 2014-12-24 |
Family
ID=52225113
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310250016.3A Pending CN104236569A (en) | 2013-06-21 | 2013-06-21 | Method and device for determining optimal meeting point |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104236569A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104732471A (en) * | 2015-04-03 | 2015-06-24 | 北京嘀嘀无限科技发展有限公司 | Converging position selecting method and system |
| CN104848849A (en) * | 2015-05-12 | 2015-08-19 | 百度在线网络技术（北京）有限公司 | Target aggregation site planning method and target aggregation site planning device based on positioning technology |
| CN105956167A (en) * | 2016-05-19 | 2016-09-21 | 北京理工大学 | Dinner party place intelligent recommendation method and system |
| CN106017471A (en) * | 2016-05-17 | 2016-10-12 | Tcl移动通信科技（宁波）有限公司 | Method and system for implementing optimal navigation for converge of multiple devices |
| CN106895845A (en) * | 2016-08-26 | 2017-06-27 | 阿里巴巴集团控股有限公司 | A kind of determination method and device of assembly area |
| CN106895843A (en) * | 2015-12-18 | 2017-06-27 | 北京奇虎科技有限公司 | A kind of method of vehicle routing plan, car-mounted terminal and intelligent automobile |
| CN107194511A (en) * | 2017-05-23 | 2017-09-22 | 合肥昊思云科科技有限公司 | A kind of complex region route planning system based on Cloud Server |
| CN107464005A (en) * | 2017-08-21 | 2017-12-12 | 中国人民解放军国防科技大学 | Expanded path planning method for vehicle reservation |
| CN108489504A (en) * | 2018-03-30 | 2018-09-04 | 斑马网络技术有限公司 | Meet place commending system and its method |
| CN109752015A (en) * | 2018-12-29 | 2019-05-14 | 青岛海洋科学与技术国家实验室发展中心 | Route planning method, computer-readable medium and control device |
| CN110826761A (en) * | 2019-09-19 | 2020-02-21 | 中山大学 | Optimal group order path query method based on meeting points |
| US10769742B2 (en) | 2015-01-20 | 2020-09-08 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for providing information for an on-demand service |
| CN111723999A (en) * | 2020-06-28 | 2020-09-29 | 北京京东乾石科技有限公司 | Distribution route determining method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005061988A (en) * | 2003-08-12 | 2005-03-10 | Xanavi Informatics Corp | Route search method of navigation device |
| CN101487721A (en) * | 2009-01-21 | 2009-07-22 | 东北大学 | Method for solving group touring problems by intelligent tour guide system |
| EP2273231A1 (en) * | 2008-04-28 | 2011-01-12 | Navitime Japan Co., Ltd. | Route guidance system, route search server, route guidance method, and terminal |
| CN101944095A (en) * | 2009-07-08 | 2011-01-12 | 广东融讯信息科技有限公司 | Path planning method and system |
| CN102692235A (en) * | 2011-03-20 | 2012-09-26 | 微软公司 | Navigation to dynamic endpoint |
-
2013
- 2013-06-21 CN CN201310250016.3A patent/CN104236569A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005061988A (en) * | 2003-08-12 | 2005-03-10 | Xanavi Informatics Corp | Route search method of navigation device |
| EP2273231A1 (en) * | 2008-04-28 | 2011-01-12 | Navitime Japan Co., Ltd. | Route guidance system, route search server, route guidance method, and terminal |
| CN101487721A (en) * | 2009-01-21 | 2009-07-22 | 东北大学 | Method for solving group touring problems by intelligent tour guide system |
| CN101944095A (en) * | 2009-07-08 | 2011-01-12 | 广东融讯信息科技有限公司 | Path planning method and system |
| CN102692235A (en) * | 2011-03-20 | 2012-09-26 | 微软公司 | Navigation to dynamic endpoint |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10769742B2 (en) | 2015-01-20 | 2020-09-08 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for providing information for an on-demand service |
| CN104732471A (en) * | 2015-04-03 | 2015-06-24 | 北京嘀嘀无限科技发展有限公司 | Converging position selecting method and system |
| CN104848849A (en) * | 2015-05-12 | 2015-08-19 | 百度在线网络技术（北京）有限公司 | Target aggregation site planning method and target aggregation site planning device based on positioning technology |
| CN106895843A (en) * | 2015-12-18 | 2017-06-27 | 北京奇虎科技有限公司 | A kind of method of vehicle routing plan, car-mounted terminal and intelligent automobile |
| CN106895843B (en) * | 2015-12-18 | 2021-04-16 | 北京奇虎科技有限公司 | Vehicle route planning method, vehicle-mounted terminal and intelligent automobile |
| CN106017471A (en) * | 2016-05-17 | 2016-10-12 | Tcl移动通信科技（宁波）有限公司 | Method and system for implementing optimal navigation for converge of multiple devices |
| CN105956167A (en) * | 2016-05-19 | 2016-09-21 | 北京理工大学 | Dinner party place intelligent recommendation method and system |
| CN106895845A (en) * | 2016-08-26 | 2017-06-27 | 阿里巴巴集团控股有限公司 | A kind of determination method and device of assembly area |
| CN107194511A (en) * | 2017-05-23 | 2017-09-22 | 合肥昊思云科科技有限公司 | A kind of complex region route planning system based on Cloud Server |
| CN107464005B (en) * | 2017-08-21 | 2020-06-19 | 中国人民解放军国防科技大学 | Expanded path planning method for vehicle reservation |
| CN107464005A (en) * | 2017-08-21 | 2017-12-12 | 中国人民解放军国防科技大学 | Expanded path planning method for vehicle reservation |
| CN108489504A (en) * | 2018-03-30 | 2018-09-04 | 斑马网络技术有限公司 | Meet place commending system and its method |
| CN109752015A (en) * | 2018-12-29 | 2019-05-14 | 青岛海洋科学与技术国家实验室发展中心 | Route planning method, computer-readable medium and control device |
| CN110826761A (en) * | 2019-09-19 | 2020-02-21 | 中山大学 | Optimal group order path query method based on meeting points |
| CN110826761B (en) * | 2019-09-19 | 2023-04-07 | 中山大学 | Optimal group order path query method based on meeting points |
| CN111723999A (en) * | 2020-06-28 | 2020-09-29 | 北京京东乾石科技有限公司 | Distribution route determining method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104236569A (en) | Method and device for determining optimal meeting point | |
| CN100360900C (en) | Navigation apparatus | |
| RU2690762C1 (en) | Information processing device, information processing system, information processing method and data medium | |
| Hashemi et al. | A weight-based map-matching algorithm for vehicle navigation in complex urban networks | |
| US8725612B2 (en) | Personalized real-time location-based travel management | |
| US20190113356A1 (en) | Automatic discovery of optimal routes for flying cars and drones | |
| EP2947608A1 (en) | Systems and methods for personalized multi-destination trip planning | |
| JP2000258184A (en) | Method and device for searching traffic network route | |
| US20130304378A1 (en) | Public Transportation Journey Planning | |
| Creemers et al. | Tri-vizor uses an efficient algorithm to identify collaborative shipping opportunities | |
| US20200011690A1 (en) | Method, apparatus, and computer program product for generation of a route including multiple waypoints | |
| US20150168148A1 (en) | Systems and Methods for Generating Guidebook Routes | |
| Zhu | Multi-objective route planning problem for cycle-tourists | |
| Jaballah et al. | The time-dependent shortest path and vehicle routing problem | |
| JP4508217B2 (en) | Navigation system, route search server, route search method, and terminal device | |
| Noh et al. | Hyperpaths in network based on transit schedules | |
| CN111415024A (en) | Arrival time estimation method and estimation device | |
| JP5007152B2 (en) | Navigation system, route search server, route search method, and terminal device | |
| JP2021009448A (en) | Information processing system and information processing method | |
| JP3656964B2 (en) | Navigation device | |
| JP2008191115A (en) | Navigation system, route search server and method, and terminal device | |
| JP4757847B2 (en) | Navigation system, route search server, route search method, and terminal device | |
| Borodinov et al. | Analysis of the preferences of public transport passengers in the task of building a personalized recommender system | |
| KR20150116385A (en) | Media input reservation system | |
| Borodinov et al. | Method of determining user preferences for the personalized recommender systems for public transport passengers |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20141224 |