CN107192389A - A kind of navigator and air navigation aid - Google Patents
A kind of navigator and air navigation aid Download PDFInfo
- Publication number
- CN107192389A CN107192389A CN201610143804.6A CN201610143804A CN107192389A CN 107192389 A CN107192389 A CN 107192389A CN 201610143804 A CN201610143804 A CN 201610143804A CN 107192389 A CN107192389 A CN 107192389A
- Authority
- CN
- China
- Prior art keywords
- destination
- queue
- constraints
- guidance path
- sequencing
- 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
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
Embodiments of the invention disclose a kind of navigator and air navigation aid, are related to technical field of vehicle, when vehicle needs to reach multiple destinations, can generate the driving path for meeting user's requirement, improve Consumer's Experience.The air navigation aid includes：Multiple destinations of user's setting and the constraints of each destination are obtained, constraints includes one or more of：The sequencing of destination between any two, the arrival time of destination requires；Constraint IF condition is with the presence or absence of conflict；When it is determined that conflict is not present in constraints, the sequencing queue of exhaustive destination；The weighted value being arranged in order according to size is sequentially allocated from front to back for the destination in each sequencing queue, and selection weighted value magnitude relationship meets the first queue group of the constraints, and generates the guidance path of each sequencing queue in correspondence first queue group；Recommend the selected guidance path in the guidance path to user based on predetermined policy.Embodiments of the invention are used for automobile navigation.
Description
Technical field
Embodiments of the invention are related to technical field of vehicle, more particularly to a kind of navigator and air navigation aid.
Background technology
In the process of moving, user can be by setting multiple destinations in navigator, and navigator is automatically generated for vehicle
Path is exercised, to point out user the steering direction to vehicle.And when setting multiple destinations, it is necessary to it is thought out in advance these mesh
Ground between ordinal relation.If user is unfamiliar with to the position of destination, or has order of arrival, arrival to some destinations
Time requirement (e.g., some destination is reached at first, some destination is finally reached, some destination another object ground it
It is preceding or reach afterwards, some destination is reached etc. before some) when, user can not be suitable between clearly multiple destinations in advance
Order relation, the driving path of navigator generation does not meet user's request.
The content of the invention
Embodiments of the invention provide a kind of navigator and air navigation aid, when vehicle needs to reach multiple destinations, energy
Enough generations meet the driving path of user's requirement, improve Consumer's Experience.
First aspect there is provided a kind of navigator, including：
Setup module, for obtaining multiple destinations of user's setting and the constraints of each destination, institute
Stating constraints includes one or more of：The sequencing of destination between any two, the arrival time of destination requires；
Judge module, for judging that the constraints that the setup module is obtained whether there is conflict；
Exhaustive module, for when the judge module determine the constraints be not present conflict when, exhaustive destination
Sequencing queue；
Weight distribution module, for the destination in each sequencing queue for going out for the exhaustive module exhaustion from front to back
It is sequentially allocated the weighted value being arranged in order according to size；
Selecting module, for selecting weighted value magnitude relationship symbol in each sequencing queue that the exhaustive module exhaustion goes out
Close the first queue group of the constraints；
Navigate generation module, each sequencing queue in the first queue group for generating the correspondence selecting module selection
Guidance path；
In recommending module, the guidance path for recommending the navigation generation module generation to user based on predetermined policy
Selected guidance path.
With reference to first aspect in the first possible implementation, the constraints includes following one kind or many
Kind：The sequencing of destination between any two, destination arrival time；The destination arrival time includes following a kind of or many
Kind：Arrival at first, finally arrival, at any time arrival before, at any time arrival afterwards.
With reference to first aspect in second of possible implementation, in addition to Tip element,
If determining that the constraints has conflict for the judge module, user is pointed out to reset described in each
The constraints of destination.
With reference to first aspect in the third possible implementation, the constraints includes destination arrival time
When；
Selecting module, is additionally operable to match the second team for meeting the destination arrival time in the first queue group
Row group；
Navigate generation module, is additionally operable to each sequence in the second queue group of the generation correspondence selecting module selection
The guidance path of queue.
With reference to any one possible implementation in first aspect or first aspect, in the 4th kind of possible implementation
In, the predetermined policy includes following one or more：Most short, the selected guidance path of selected guidance path avoids congestion, choosing
Guidance path is determined not by highway.
Second aspect there is provided a kind of air navigation aid, including：
Obtain multiple destinations of user's setting and the constraints of each destination, the constraints bag
Include one or more of：The sequencing of destination between any two, the arrival time of destination requires；
Judge the constraints with the presence or absence of conflict；
When it is determined that conflict is not present in the constraints, the sequencing queue of exhaustive destination；
The weighted value being arranged in order according to size is sequentially allocated from front to back for the destination in each sequencing queue, is selected
Weighted value magnitude relationship meets the first queue group of the constraints, and generates each sequence in the correspondence first queue group
The guidance path of queue；
Recommend the selected guidance path in the guidance path to user based on predetermined policy.
With reference to second aspect in the first possible implementation, the constraints includes following one kind or many
Kind：The sequencing of destination between any two, destination arrival time；The destination arrival time includes following a kind of or many
Kind：Arrival at first, finally arrival, at any time arrival before, at any time arrival afterwards.
With reference to second aspect in second of possible implementation, methods described also includes：
If it is determined that the constraints has conflict, then user is pointed out the constraint bar for resetting each destination
Part.
With reference to second aspect in the third possible implementation, the constraints includes destination arrival time
When；
Methods described also includes：
The second queue group for meeting the destination arrival time is matched in the first queue group, and generates correspondence
The guidance path of each sequencing queue in the second queue group.
With reference to any one possible implementation in second aspect or second aspect, in the 4th kind of possible implementation
In, the predetermined policy includes following one or more：Most short, the selected guidance path of selected guidance path avoids congestion, choosing
Guidance path is determined not by highway.
Navigator and air navigation aid that embodiments of the invention are provided, navigator can obtain multiple purposes of user's setting
Ground and the constraints of each destination, the constraints include one or more of：Destination is between any two
Sequencing, arrival time of destination requires；Judge the constraints with the presence or absence of conflict；When it is determined that the constraint bar
When conflict is not present in part, the sequencing queue of exhaustive destination；It is sequentially allocated from front to back for the destination in each sequencing queue
The weighted value being arranged in order according to size, selection weighted value magnitude relationship meets the first queue group of the constraints, and raw
The guidance path of each sequencing queue into the correspondence first queue group；The navigation road is recommended to user based on predetermined policy
Selected guidance path in footpath；So as to realize when vehicle needs to reach multiple destinations, it can generate and meet user's requirement
Driving path, improves Consumer's Experience.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
A kind of structural representation for navigator that Fig. 1 provides for embodiments of the invention；
A kind of structural representation for navigator that Fig. 2 another embodiment of the present invention is provided；
A kind of schematic flow sheet for air navigation aid that Fig. 3 embodiments of the invention are provided.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.It is based on
Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made
Embodiment, belongs to the scope of protection of the invention.
Shown in reference picture 1, embodiments of the invention provide a kind of navigator, including：
Setup module 11, for obtaining multiple destinations of user's setting and the constraints of each destination,
The constraints includes one or more of：The sequencing of destination between any two, the arrival time of destination requires.
Wherein, the constraints includes following one or more：The sequencing of destination between any two, destination
Arrival time；The destination arrival time includes one or more of：At first reach, finally reach, at any time it
It is preceding to reach, reach afterwards at any time.The sequencing of destination between any two can be understood as a destination another
Reached before one destination or a destination is reached after another object ground.
Judge module 12, for judging that the constraints that the setup module 11 is obtained whether there is conflict.
Exhaustive module 13, for when the judge module 12 determine the constraints be not present conflict when, exhaustive purpose
The sequencing queue on ground.
Weight distribution module 14, for the destination in each sequencing queue for going out for the exhaustive exhaustion of module 13 in the past
The weighted value being arranged in order according to size is sequentially allocated after.
Exemplary be arranged in order according to size can be from small to large or from big to small, not limit here.
Selecting module 15, for selecting weighted value size to close in each sequencing queue that the exhaustive exhaustion of module 13 goes out
System meets the first queue group of the constraints.
Navigate generation module 16, for generating each sequence team in the first queue group that the correspondence selecting module 15 is selected
The guidance path of row.
Recommending module 16, for recommending the guidance path that the navigation generation module 16 is generated to user based on predetermined policy
In selected guidance path.
Wherein, predetermined policy includes following one or more：Most short, the selected guidance path of selected guidance path is avoided gathering around
Stifled, selected guidance path does not pass through highway.
The navigator that embodiments of the invention are provided, navigator can obtain multiple destinations of user's setting and each
The constraints of the individual destination, the constraints includes one or more of：The priority of destination between any two is suitable
Sequence, the arrival time of destination requires；Judge the constraints with the presence or absence of conflict；When it is determined that the constraints is not present
During conflict, the sequencing queue of exhaustive destination；It is sequentially allocated from front to back according to size for the destination in each sequencing queue
The weighted value being arranged in order, selection weighted value magnitude relationship meets the first queue group of the constraints, and generates correspondence institute
State the guidance path of each sequencing queue in first queue group；Recommend the choosing in the guidance path to user based on predetermined policy
Determine guidance path；So as to realize when vehicle needs to reach multiple destinations, the driving path for meeting user's requirement can be generated,
Improve Consumer's Experience.
Shown in reference picture 2, a kind of feasible embodiment is, in addition to：Tip element 17, if for the judge module
Determine that the constraints has conflict, then point out user the constraints for resetting each destination.
There is provided another feasible embodiment is, when the constraints includes destination arrival time.
Selecting module 15, is additionally operable to match in the first queue group and meets the second of the destination arrival time
Set of queues.
Navigate generation module 16, is additionally operable to each in the second queue group that the generation correspondence selecting module 15 is selected
The guidance path of sequencing queue.
Shown in reference picture 3, embodiments of the invention provide a kind of air navigation aid, comprise the following steps：
301st, multiple destinations of user's setting and the constraints of each destination are obtained.
Wherein, the constraints includes following one or more：The sequencing of destination between any two, destination
Arrival time；The destination arrival time includes one or more of：At first reach, finally reach, at any time it
It is preceding to reach, reach afterwards at any time.The sequencing of destination between any two can be understood as a destination another
Reached before one destination or a destination is reached after another object ground.
302nd, judge the constraints with the presence or absence of conflict.
303rd, when it is determined that conflict is not present in the constraints, the sequencing queue of exhaustive destination.
304th, if it is determined that the constraints has conflict, then user's constraint for resetting each destination is pointed out
Condition.
305th, the weighted value being arranged in order according to size is sequentially allocated from front to back for the destination in each sequencing queue,
Selection weighted value magnitude relationship meets the first queue group of the constraints, and generates each in the correspondence first queue group
The guidance path of sequencing queue.
Exemplary be arranged in order according to size can be from small to large or from big to small, not limit here.
Optionally, if the constraints includes destination arrival time；Methods described also includes：
306th, the second queue group for meeting the destination arrival time is matched in the first queue group, and is generated
The guidance path of each sequencing queue in the correspondence second queue group.
307th, the selected guidance path in the guidance path is recommended to user based on predetermined policy.
Wherein, predetermined policy includes following one or more：Most short, the selected guidance path of selected guidance path is avoided gathering around
Stifled, selected guidance path does not pass through highway.If it is appreciated that the constraints includes destination arrival time
When, step 307 is performed after having performed 306, if not including destination arrival time in constraints, is performed after having performed 305
Step 307.
Embodiments of the invention provide air navigation aid, navigator can obtain user setting multiple destinations and
The constraints of each destination, the constraints includes one or more of：The priority of destination between any two
Sequentially, the arrival time of destination requires；Judge the constraints with the presence or absence of conflict；When it is determined that the constraints is not deposited
In conflict, the sequencing queue of exhaustive destination；It is sequentially allocated from front to back according to big for the destination in each sequencing queue
The small weighted value being arranged in order, selection weighted value magnitude relationship meets the first queue group of the constraints, and generates correspondence
The guidance path of each sequencing queue in the first queue group；Recommended based on predetermined policy to user in the guidance path
Selected guidance path；So as to realize when vehicle needs to reach multiple destinations, the traveling road for meeting user's requirement can be generated
Footpath, improves Consumer's Experience.
Specifically, providing a kind of application with reference to the air navigation aid present invention that above-mentioned navigator and above-described embodiment are provided
Example, it is as follows：
Wherein, the plan explanation that embodiments of the invention are provided is as follows：When user sets multiple destinations in navigator,
For each destination, user can set following constraints, show the order of arrival for the destination that user needs, constraint
Condition includes following one or more：The sequencing of destination between any two, destination arrival time etc., it is exemplary,
Such as：
Zero reaches --- ----condition 1 at first
Zero last arrival --- ----condition 2
Zero destination _ _ before reach --- ----condition 3
Zero in destination, and _ _ reaches --- ----condition 4 afterwards
Zero _ _ before reach --- ----condition 5
Navigator is ranked up to multiple destinations that user is set automatically according to above-mentioned condition, and user without examining in advance
Consider the ordinal relation between each destination, last navigator generation guidance path recommends user.
It is specific as follows：
Step 1：Obtain multiple destinations for being set in navigator of user, and each destination constraints.
Wherein, the order of arrival between constraints indicative purpose ground.Here, " order of arrival " is by above-mentioned condition 1
What the setting of~condition 5 embodied.When constraints is set, each destination can be directed to, is set in above-mentioned condition list
Put.
Step 2：Judge the constraints with the presence or absence of conflict.
Predominantly judge the order of arrival of the destination set by constraints with the presence or absence of conflict wherein in step 2.
Such as require the destination reached at first or finally can only have contradiction, condition 3 can not occur between one, above-mentioned condition 3,4 can not
Contradiction can not be occurred with condition 2 by contradiction, condition 4 occur with condition 1.If it is determined that there is conflict, then user is pointed out to reset
The constraints of each destination, performs step 1；If there is no conflict, then step 3 is performed.
Here, being illustrated so that user sets six destinations as an example.Assuming that user be provided with destination A, B, C, D, E,
F, and require：
Destination A：Reach (i.e. there is provided condition 1) at first；
Destination B：User does not set any condition, no order of arrival requirement；
Destination C：(i.e. there is provided condition 3) is reached before the E of destination；
Destination D：(i.e. there is provided condition 4) is reached after the C of destination；
Destination E：(i.e. there is provided condition 5) is reached before 18 points；
Destination F：Finally reach (i.e. there is provided condition 2).
Conflict is not present between each condition of above-mentioned six destinations.
Step 3：The sequencing queue of exhaustive destination.
I.e. it is exhaustive arrange out each destination be sequentially generated some sequencing queues.Wherein, due to being included in constraints：
Destination A：(i.e. there is provided condition 1) destination F is reached at first：Finally reach (i.e. there is provided condition 2), i.e. destination A and mesh
Ground F position be relatively fixed, therefore in the step 3, specific algorithm can be：First fix what is reached and finally reach at first
The order of each destination in the middle of the head and the tail position of two destinations, then exhaustive arrangement.
By taking above-mentioned six destinations as an example, first determine that the destination A reached at first is the first for queue, the purpose finally reached
Ground F is the last position of queue；The order between exhaustive destination B, C, D, E, obtains 24 sequencing queues as shown in table 1 below afterwards：
Table 1
| Queue 1： | A | → | B | → | C | → | D | → | E | → | F |
| Queue 2： | A | → | B | → | C | → | E | → | D | → | F |
| Queue 3： | A | → | B | → | D | → | C | → | E | → | F |
| Queue 4： | A | → | B | → | D | → | E | → | C | → | F |
| Queue 5： | A | → | B | → | E | → | C | → | D | → | F |
| Queue 6： | A | → | B | → | E | → | D | → | C | → | F |
| Queue 7： | A | → | C | → | B | → | D | → | E | → | F |
| Queue 8： | A | → | C | → | B | → | E | → | D | → | F |
| Queue 9： | A | → | D | → | B | → | C | → | E | → | F |
| Queue 10： | A | → | D | → | B | → | E | → | C | → | F |
| Queue 11： | A | → | E | → | B | → | C | → | D | → | F |
| Queue 12： | A | → | E | → | B | → | D | → | C | → | F |
| Queue 13： | A | → | C | → | D | → | B | → | E | → | F |
| Queue 14： | A | → | C | → | E | → | B | → | D | → | F |
| Queue 15： | A | → | D | → | C | → | B | → | E | → | F |
| Queue 16： | A | → | D | → | E | → | B | → | C | → | F |
| Queue 17： | A | → | E | → | C | → | B | → | D | → | F |
| Queue 18： | A | → | E | → | D | → | B | → | C | → | F |
| Queue 19： | A | → | C | → | D | → | E | → | B | → | F |
| Queue 20： | A | → | C | → | E | → | D | → | B | → | F |
| Queue 21： | A | → | D | → | C | → | E | → | B | → | F |
| Queue 22： | A | → | D | → | E | → | C | → | B | → | F |
| Queue 23： | A | → | E | → | C | → | D | → | B | → | F |
| Queue 24： | A | → | E | → | D | → | C | → | B | → | F |
Step 4：The weight being arranged in order according to size is sequentially allocated from front to back for the destination in each sequencing queue
Value.
Exemplary be arranged in order according to size can be from small to large or from big to small, not limit here.Here
According to the first weighted value of queue is minimum, the last position weighted value of queue is maximum, centre position is according to being arranged in order from small to large
It is bright.
With 1,2,3,4,5,6, for the tactic weighted value with magnitude relationship, (selection of weighted value is not limited in this example
In this), then it can obtain such as table 2 below：
Table 2
Step 5：In each sequencing queue gone out from exhaustion, select weighted value magnitude relationship and meet the arrival of above-mentioned condition 3,4
The set of queues of order precedence relationship.
Because weighted value is arranged in order according to size, and the weighted value of the destination reached at first is minimum, finally reaches
Destination weighted value it is maximum, the weighted value for each destination that centre is reached is ascending to be arranged in order, therefore, purpose
The order of arrival on ground and the corresponding relation of weighted value are：The weighted value of the destination first reached is small, the power of the destination reached afterwards
Weight values are big.Thus, it is possible to which the arrival sequencing of above-mentioned condition 3, condition 4 to be converted to the magnitude relationship of weighted value.
In this example, " destination C is reached before the E of destination ", the corresponding weighted value size of order of arrivals of the C prior to E
Relation is：C weighted value ＜ E weighted value；" destination D is reached after the C of destination ", the order of arrival that D is later than C is corresponding
Weighted value magnitude relationship is：D weighted value ＞ C weighted value.So as to which the set of queues selected is as shown in table 3 below：
Table 3
| Queue 1： | A | → | B | → | C | → | D | → | E | → | F |
| The weighted value of queue 1： | 1 | 2 | 3 | 4 | 5 | 6 | |||||
| Queue 2： | A | → | B | → | C | → | E | → | D | → | F |
| The weighted value of queue 2： | 1 | 2 | 3 | 4 | 5 | 6 | |||||
| Queue 7： | A | → | C | → | B | → | D | → | E | → | F |
| The weighted value of queue 7： | 1 | 2 | 3 | 4 | 5 | 6 | |||||
| Queue 8： | A | → | C | → | B | → | E | → | D | → | F |
| The weighted value of queue 8： | 1 | 2 | 3 | 4 | 5 | 6 | |||||
| Queue 13： | A | → | C | → | D | → | B | → | E | → | F |
| The weighted value of queue 13： | 1 | 2 | 3 | 4 | 5 | 6 | |||||
| Queue 14： | A | → | C | → | E | → | B | → | D | → | F |
| The weighted value of queue 14： | 1 | 2 | 3 | 4 | 5 | 6 | |||||
| Queue 19： | A | → | C | → | D | → | E | → | B | → | F |
| The weighted value of queue 19： | 1 | 2 | 3 | 4 | 5 | 6 | |||||
| Queue 20： | A | → | C | → | E | → | D | → | B | → | F |
| The weighted value of queue 20： | 1 | 2 | 3 | 4 | 5 | 6 |
By taking queue 1 as an example, C weighted value 3 is less than E weighted value 5, shows in the destination order of arrival that queue 1 is provided,
C is reached prior to E.D weighted value 4 is more than C weighted value 3, shows in the destination order of arrival that queue 1 is provided, D is later than C and arrived
Reach, the need for meeting user.Other queues are same, repeat no more.
Step 6：If user is provided with condition 5 (requirement of destination arrival time), the set of queues selected in step 5
In, select the set of queues for meeting above-mentioned condition 5.
It can be set wherein when selecting the set of queues for meeting above-mentioned condition 5 with reference to traffic information and user
The residence time of each destination (constraints can separately be set for user in navigator).In this example, condition 5：Mesh
Ground E points requirement 18:Reached before 00, it is assumed that the set of queues for meeting the condition is such as table 4 below：
Table 4
| Queue 2： | A | → | B | → | C | → | E | → | D | → | F |
| Queue 8： | A | → | C | → | B | → | E | → | D | → | F |
| Queue 14： | A | → | C | → | E | → | B | → | D | → | F |
| Queue 19： | A | → | C | → | D | → | E | → | B | → | F |
| Queue 20： | A | → | C | → | E | → | D | → | B | → | F |
If user is not provided with after condition 5, execution of step 5, step 7 is directly performed, this step 6 is skipped.
Step 7：The set of queues obtained according to step 5 or step 6, generates guidance path.
Step 8：Recommend the selected guidance path in the guidance path to user based on predetermined policy.
Predetermined policy can include following one or more：Selected guidance path is most short, selected guidance path avoids congestion,
Selected guidance path does not pass through highway etc..
The embodiment provided using the present invention carries out guidance path selection, and user need not consider entirety between multiple destinations
Ordinal relation, only the arrival constraints of each destination need to be filled in navigator, navigator just being capable of auto-sequencing, life
Into the driving path for meeting user's needs.
, wherein it is desired to the unit, module in explanation, the present embodiment can be the processor individually set up,
It can be integrated in some processor and realize, in addition it is also possible to be stored in depositing for automatic navigator in the form of program code
In reservoir, the function of above unit is called by processor and performed.Processor described here can be a centre
Manage device (English full name：Central Processing Unit, English abbreviation：CPU), or specific integrated circuit (English is complete
Claim：Application Specific Integrated Circuit, English abbreviation：ASIC), or be arranged to implement
One or more integrated circuits of the embodiment of the present invention.
The foregoing is only a specific embodiment of the invention, but protection scope of the present invention is not limited thereto, any
Those familiar with the art the invention discloses technical scope in, change or replacement can be readily occurred in, should all be contained
Cover within protection scope of the present invention.Therefore, protection scope of the present invention should be based on the protection scope of the described claims.
Claims (10)
1. a kind of navigator, it is characterised in that including：
Setup module, for obtain user setting multiple destinations and each destination constraints, it is described about
Beam condition includes one or more of：The sequencing of destination between any two, the arrival time of destination requires；
Judge module, for judging that the constraints that the setup module is obtained whether there is conflict；
Exhaustive module, for when the judge module determine the constraints be not present conflict when, the sequence of exhaustive destination
Queue；
Weight distribution module, for the destination in each sequencing queue for going out for the exhaustive module exhaustion from front to back successively
Distribute the weighted value being arranged in order according to size；
Selecting module, for selecting weighted value magnitude relationship to meet institute in each sequencing queue that the exhaustive module exhaustion goes out
State the first queue group of constraints；
Navigate generation module, the navigation of each sequencing queue in the first queue group for generating the correspondence selecting module selection
Path；
It is selected in recommending module, the guidance path for recommending the navigation generation module generation to user based on predetermined policy
Guidance path.
2. navigator according to claim 1, it is characterised in that the constraints includes following one or more：
The sequencing of destination between any two, destination arrival time；The destination arrival time includes one or more of：
Arrival at first, finally arrival, at any time arrival before, at any time arrival afterwards.
3. navigator according to claim 1, it is characterised in that also including Tip element,
If determining that the constraints has conflict for the judge module, user is pointed out to reset each purpose
The constraints on ground.
4. navigator according to claim 1, it is characterised in that the constraints includes destination arrival time
When；
Selecting module, is additionally operable to match the second queue for meeting the destination arrival time in the first queue group
Group；
Navigate generation module, is additionally operable to each sequencing queue in the second queue group of the generation correspondence selecting module selection
Guidance path.
5. the navigator according to claim any one of 1-4, it is characterised in that the predetermined policy includes following one
Or it is multinomial：Most short, the selected guidance path of selected guidance path avoids congestion, selected guidance path not by highway.
6. a kind of air navigation aid, it is characterised in that including：
Obtain user set multiple destinations and each destination constraints, the constraints include with
Lower one or more：The sequencing of destination between any two, the arrival time of destination requires；
Judge the constraints with the presence or absence of conflict；
When it is determined that conflict is not present in the constraints, the sequencing queue of exhaustive destination；
The weighted value being arranged in order according to size is sequentially allocated from front to back for the destination in each sequencing queue, selects weight
Value magnitude relationship meets the first queue group of the constraints, and generates each sequencing queue in the correspondence first queue group
Guidance path；
Recommend the selected guidance path in the guidance path to user based on predetermined policy.
7. method according to claim 6, it is characterised in that the constraints includes following one or more：Mesh
Ground sequencing between any two, destination arrival time；The destination arrival time includes one or more of：Most
First arrival, finally arrival, at any time arrival before, at any time arrival afterwards.
8. method according to claim 6, it is characterised in that methods described also includes：
If it is determined that the constraints has conflict, then user is pointed out the constraints for resetting each destination.
9. method according to claim 6, it is characterised in that when the constraints includes destination arrival time；
Methods described also includes：
The second queue group for meeting the destination arrival time is matched in the first queue group, and it is described to generate correspondence
The guidance path of each sequencing queue in second queue group.
10. the method according to claim any one of 6-9, it is characterised in that the predetermined policy includes following one
Or it is multinomial：Most short, the selected guidance path of selected guidance path avoids congestion, selected guidance path not by highway.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610143804.6A CN107192389A (en) | 2016-03-14 | 2016-03-14 | A kind of navigator and air navigation aid |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610143804.6A CN107192389A (en) | 2016-03-14 | 2016-03-14 | A kind of navigator and air navigation aid |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107192389A true CN107192389A (en) | 2017-09-22 |
Family
ID=59871184
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610143804.6A Pending CN107192389A (en) | 2016-03-14 | 2016-03-14 | A kind of navigator and air navigation aid |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107192389A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110686688A (en) * | 2018-07-04 | 2020-01-14 | 阿尔派株式会社 | Navigation device and navigation method |
| CN113188560A (en) * | 2021-06-07 | 2021-07-30 | 芜湖雄狮汽车科技有限公司 | Vehicle multi-destination navigation method and device, vehicle machine and vehicle |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090005963A1 (en) * | 2007-06-27 | 2009-01-01 | Nokia Corporation | Method, Apparatus and Computer Program Product for Providing Route Planning Based on Personal Activity Plans of Multiple Individuals |
| CN101639359A (en) * | 2008-08-01 | 2010-02-03 | 中国移动通信集团公司 | Method for navigation through mobile terminal and mobile terminal |
| CN102168985A (en) * | 2010-12-08 | 2011-08-31 | 厦门雅迅网络股份有限公司 | Method and system for multipoint reserving navigation based on GPS (global position system) |
| CN103164953A (en) * | 2011-12-19 | 2013-06-19 | 联想(北京)有限公司 | Method and terminal for displaying routes |
| CN103308063A (en) * | 2013-07-01 | 2013-09-18 | 深圳市凯立德欣软件技术有限公司 | Navigation method and navigation equipment for multiple destinations |
| CN103994769A (en) * | 2013-02-19 | 2014-08-20 | 腾讯科技（深圳）有限公司 | Map navigation route acquiring method and terminal |
| CN104541131A (en) * | 2012-08-10 | 2015-04-22 | 歌乐株式会社 | Route calculation system, navigation device, and route calculation method |
| CN104864864A (en) * | 2015-05-28 | 2015-08-26 | 成都亿邻通科技有限公司 | Navigation method |
| CN105043400A (en) * | 2015-06-30 | 2015-11-11 | 百度在线网络技术（北京）有限公司 | Route planning method and device |
| US20150330800A1 (en) * | 2014-05-19 | 2015-11-19 | Google Inc. | Systems and Methods for Personalized Multi-Destination Trip Planning |
| CN105318885A (en) * | 2014-07-17 | 2016-02-10 | 福特全球技术公司 | Multiple destination vehicle interface |
-
2016
- 2016-03-14 CN CN201610143804.6A patent/CN107192389A/en active Pending
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090005963A1 (en) * | 2007-06-27 | 2009-01-01 | Nokia Corporation | Method, Apparatus and Computer Program Product for Providing Route Planning Based on Personal Activity Plans of Multiple Individuals |
| CN101639359A (en) * | 2008-08-01 | 2010-02-03 | 中国移动通信集团公司 | Method for navigation through mobile terminal and mobile terminal |
| CN102168985A (en) * | 2010-12-08 | 2011-08-31 | 厦门雅迅网络股份有限公司 | Method and system for multipoint reserving navigation based on GPS (global position system) |
| CN103164953A (en) * | 2011-12-19 | 2013-06-19 | 联想(北京)有限公司 | Method and terminal for displaying routes |
| CN104541131A (en) * | 2012-08-10 | 2015-04-22 | 歌乐株式会社 | Route calculation system, navigation device, and route calculation method |
| CN103994769A (en) * | 2013-02-19 | 2014-08-20 | 腾讯科技（深圳）有限公司 | Map navigation route acquiring method and terminal |
| CN103308063A (en) * | 2013-07-01 | 2013-09-18 | 深圳市凯立德欣软件技术有限公司 | Navigation method and navigation equipment for multiple destinations |
| US20150330800A1 (en) * | 2014-05-19 | 2015-11-19 | Google Inc. | Systems and Methods for Personalized Multi-Destination Trip Planning |
| CN105318885A (en) * | 2014-07-17 | 2016-02-10 | 福特全球技术公司 | Multiple destination vehicle interface |
| CN104864864A (en) * | 2015-05-28 | 2015-08-26 | 成都亿邻通科技有限公司 | Navigation method |
| CN105043400A (en) * | 2015-06-30 | 2015-11-11 | 百度在线网络技术（北京）有限公司 | Route planning method and device |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110686688A (en) * | 2018-07-04 | 2020-01-14 | 阿尔派株式会社 | Navigation device and navigation method |
| CN110686688B (en) * | 2018-07-04 | 2024-03-08 | 阿尔派株式会社 | Navigation device and navigation method |
| CN113188560A (en) * | 2021-06-07 | 2021-07-30 | 芜湖雄狮汽车科技有限公司 | Vehicle multi-destination navigation method and device, vehicle machine and vehicle |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lee et al. | Benders-and-Price approach for electric vehicle charging station location problem under probabilistic travel range | |
| CN105070044B (en) | Dynamic scheduling method for customized buses and car pooling based on passenger appointments | |
| CN104931063B (en) | Path planning method | |
| DE112014004812B4 (en) | Driving assistance device, driving assistance method and driving assistance system | |
| Herbawi et al. | A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows | |
| CN105180956B (en) | Air navigation aid, device, navigation equipment and the vehicles of energy website | |
| JP7226439B2 (en) | Vehicle allocation device, vehicle allocation method, computer program, and computer-readable recording medium | |
| CN107203824B (en) | Car pooling order distribution method and device | |
| CN107167152B (en) | Paths planning method and device | |
| CN107238393A (en) | It is a kind of to be gone on a journey Intelligent planning method based on shared economic personnel | |
| CN107563534A (en) | A kind of charging pile recommends method and apparatus | |
| CN107767322B (en) | Carpooling method and device | |
| CN107292692A (en) | Share-car method and system | |
| CN110309241B (en) | Mining method, device, server, computer equipment and readable storage medium | |
| CN109375616A (en) | For generating the method and system for the visual field used in Senior Officer's auxiliary system (ADAS) | |
| CN105678054A (en) | Optimal multi-convergence meeting point path search method and apparatus based on A star strategy | |
| CN108106622A (en) | A kind of riding route method and system for planning | |
| CN108253957A (en) | Route guidance method, unmanned plane, server and system based on unmanned plane | |
| CN107045696A (en) | A kind of order processing method and device | |
| CN107634977A (en) | Chauffeur processing method, device, equipment and system | |
| CN109635980A (en) | About vehicle order allocation method and system | |
| DE112014004670T5 (en) | Driving assistance device, driving assistance method and drive assisting system | |
| CN106803197A (en) | Spell single method and apparatus | |
| CN108074000A (en) | Order processing method and apparatus | |
| CN105318882B (en) | The method and device of point of interest binding road |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for 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: 20170922 |