CN109781132A - A kind of experience route replacement method, device, electronic equipment and storage medium - Google Patents
A kind of experience route replacement method, device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN109781132A CN109781132A CN201910194594.7A CN201910194594A CN109781132A CN 109781132 A CN109781132 A CN 109781132A CN 201910194594 A CN201910194594 A CN 201910194594A CN 109781132 A CN109781132 A CN 109781132A
- Authority
- CN
- China
- Prior art keywords
- section
- replacement
- replaced
- road
- 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.)
- Granted
Links
Landscapes
- Navigation (AREA)
Abstract
The invention discloses a kind of experience route replacement method, device, electronic equipment and storage mediums.The described method includes: obtaining programme path, the corresponding replacement section in the section to be replaced in the programme path and the section to be replaced；Replacement section is determined based on the programme path, the starting point in the section to be replaced, terminal and the starting point in the replacement section, terminal；The section that section is replaced described in the programme path is replaced with into the replacement section；Wherein, the starting point in the section to be replaced is different from the replacement starting point in section, and/or, the terminal in the section to be replaced is different from the replacement terminal in section.Through the above technical solutions, realizing the excavation to more public experience routes, and replace and be strictly overlapped between route and route to be replaced without head and the tail, improves the effect and line efficiency out of navigation route planning.
Description
Technical field
The present embodiments relate to navigation path planning technology more particularly to a kind of experience route replacement methods, device, electricity
Sub- equipment and storage medium.
Background technique
Currently, navigation terminal mostly uses shortest route-planning algorithm to realize the planning of navigation routine, i.e., will apart from or
Weight of the time as oriented weighted graph, using shortest path first, such as Dijkstra's algorithm (Dijkstra's
Algorithm) or Contraction hierarchies, the solution of minimal path is carried out, one or former power is searched out
It is worth the smallest route, to cook up one or several reasonable route for user.
Greatest problem existing for existing route planning method is, is isolated between road and road, such as walks from the road A
To the selection that the road B or the road C are entirely by best initial weights, the concept of experience route can not be introduced, i.e. experience route can not lead to
Weight system is crossed to express.However, having the route planning demand for much artificial experience being needed to intervene, such as false in actual life
Phase goes on a journey peak period, and local experienced driver or traffic police tend to be known in advance bottleneck which road can become traffic,
Simultaneously it is also known that optimal bypass route is, if the experience of this people can be expressed as route rule by Route Planning Algorithm
Draw as a result, so this has great help to the promotion of line efficiency out.In view of the above-mentioned problems, proposing a kind of traditional warp
Test route replacement algorithm, excavate or artificially specify by way of, the route replaced will be needed to extract and be as follows
The mode of Route Set:
Start->A->B->->J->K->L->M->N->O->End
Start->C->D->E->F->G->H->End
By by the starting point (Start) of route to be replaced, terminal (End) respectively with replacement route starting point (Start), eventually
Point (End) carries out stringent matching, achievees the purpose that replacement, ultimately generates programme path.
As it can be seen that the alternative of above-mentioned traditional experience route replacement algorithm is excessively stringent, starting point, the terminal of route are replaced
Need respectively with the starting point of route to be replaced, terminal is completely the same can just be replaced, so lead to not excavate and more may be used
Replace the public experience route of the route to be replaced.
Summary of the invention
The present invention provides a kind of experience route replacement method, device, electronic equipment and storage medium, realizes to more much
The excavation of many experience routes, and replace and be strictly overlapped between route and route to be replaced without head and the tail, improve navigation routine rule
The effect and line efficiency out drawn.
In a first aspect, the embodiment of the invention provides a kind of experience route replacement methods, this method comprises:
Obtain programme path, the corresponding replacement road in the section to be replaced in the programme path and the section to be replaced
Section；
Starting point, end based on the programme path, the starting point in the section to be replaced, terminal and the replacement section
Point determines replacement section；
The section that section is replaced described in the programme path is replaced with into the replacement section；
Wherein, the starting point in the section to be replaced is different from the replacement starting point in section, and/or, the road to be replaced
The terminal of section is different from the replacement terminal in section.
Second aspect, the embodiment of the invention also provides a kind of experience route alternative, which includes:
Module is obtained, for obtaining programme path, section to be replaced and the section to be replaced in the programme path
Corresponding replacement section；
Determining module, for based on the programme path, the starting point in the section to be replaced, terminal and the replacement
The starting point in section, terminal determine replacement section；
Replacement module, for the section for replacing section described in the programme path to be replaced with the replacement section；
Wherein, the starting point in the section to be replaced is different from the replacement starting point in section, and/or, the road to be replaced
The terminal of section is different from the replacement terminal in section.
The third aspect, the embodiment of the invention also provides a kind of electronic equipment, the electronic equipment includes:
One or more processors；
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processing
Device realizes the experience route replacement method as described in any in claim 1-7.
Fourth aspect, the embodiment of the invention also provides a kind of computer readable storage mediums, are stored thereon with computer
Program realizes the experience route replacement method as described in any in claim 1-7 when the program is executed by processor.
The present invention is corresponding by obtaining programme path, the section to be replaced in the programme path and the section to be replaced
Replacement section, based on the programme path, the starting point in the section to be replaced, terminal and it is described replacement section starting point,
Terminal determines replacement section, and the section that section is replaced described in the programme path is replaced with the replacement section；Wherein, institute
The starting point for stating section to be replaced is different from the replacement starting point in section, and/or, the terminal in the section to be replaced is replaced with described
The different technological means of the terminal in section is changed, so that being strictly overlapped between replacement route and route to be replaced without head and the tail, is realized
Excavation to more public experience routes, improves the replacement efficiency to route to be replaced, improves navigation route planning
Effect and out line efficiency.
Detailed description of the invention
Fig. 1 is the flow diagram of one of embodiment of the present invention one experience route replacement method；
Fig. 2 is one of embodiment of the present invention one experience route replacement schematic diagram；
Fig. 3 is the flow diagram of one of embodiment of the present invention two experience route replacement method；
Fig. 4 is that one of embodiment of the present invention two enters road set and deviates from the schematic diagram of road set；
Fig. 5 is one of the embodiment of the present invention two route replacement schematic diagram；
Fig. 6 is the flow diagram of one of embodiment of the present invention three experience route replacement method；
Fig. 7 is one of embodiment of the present invention three experience route replacement schematic diagram；
Fig. 8 is the flow diagram of one of embodiment of the present invention four experience route replacement method；
Fig. 9 is one of embodiment of the present invention four experience route replacement schematic diagram；
Figure 10 is the structural schematic diagram of one of embodiment of the present invention five experience route alternative；
Figure 11 is the structural schematic diagram of one of the embodiment of the present invention six electronic equipment.
Specific embodiment
The present invention is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining the present invention rather than limiting the invention.It also should be noted that in order to just
Only the parts related to the present invention are shown in description, attached drawing rather than entire infrastructure.
Embodiment one
Fig. 1 is a kind of flow diagram for experience route replacement method that the embodiment of the present invention one provides, and the present embodiment can
The case where section that cannot smoothly pass through suitable for programme path is replaced, this method can be replaced by experience route and be filled
It sets to execute, wherein the device can be implemented by software and/or hardware, and generally can integrate and leads corresponding with navigation client
In boat server.Referring specifically to shown in Fig. 1, the experience route replacement method includes the following steps:
Step 110, acquisition programme path, the section to be replaced in the programme path and the section to be replaced are corresponding
Replace section.
Wherein, the programme path refers specifically to the navigation road that navigation system is recommended according to the plan of travel of user for user
Diameter.Section to be replaced in the programme path, which refers to, can not be successfully current section, the section including traffic jam frequent occurrence,
It can also include the section due to road construction temporary enclosed, or since political activity is by the section etc. of traffic control.
Illustratively, the acquisition programme path, comprising:
According to the start and end dot position information of user's input and setting path planning algorithm, programme path is generated；
Wherein, the start position information of user can be obtained directly by GPS positioning, can also be grasped by the input of user
It obtains；The end point location information of user can be operated by the input of user and be obtained.Here, the input of user either with
Family is manually entered, and is also possible to the history input of user, i.e., if start position information and/or terminal that user needs to input
Used location information before location information is user, then user can click directly on corresponding start position in interactive interface
And/or final position is to complete the input of start and end dot position information.When the start position that user navigates is user's
When current location, it is preferred that starting point of the current location information of user as algorithmic rule route can be obtained by GPS positioning
Location information improves the accuracy of generated programme path, promotion user experience with operating procedure needed for reducing user.Institute
The programme path can be generated using shortest path first (such as Dijkstra's algorithm) by stating setting path planning algorithm,
In, Di Jiesitela (Dijkstra) algorithm is also known as signal source shortest path algorithm, is from a vertex to remaining each vertex
Shortest path first, solution is shortest route problem in digraph, is mainly characterized by centered on starting point outward layer by layer
Extension, until expanding to terminal.
Illustratively, the corresponding replacement road in section to be replaced and the section to be replaced in the programme path is obtained
Section, comprising:
Obtain the replaceable section pair of pre-set at least one set of experience；
For each replaceable section pair of experience, if the section that the current replaceable section centering of experience includes is in institute
It states on programme path, then the section is determined as section to be replaced, another section of the replaceable section centering of current experience is made
To replace section.
Wherein, every group of replaceable section of experience is to the section for including the traffic jam frequent occurrence obtained based on summary of experience
And the replaceable section, and the section of traffic jam infrequently occurs.Since existing navigation path planning algorithm is usually adopted
The programme path is generated with shortest path first (such as Dijkstra's algorithm), therefore is often existed in the programme path
The section of traffic jam frequent occurrence, by by each section of each replaceable section centering of experience and the programme path
In section matched, if the section that the current replaceable section centering of experience includes on the programme path, will
The section is determined as the section to be replaced, using another section of the replaceable section centering of current experience as the replacement road
Section.Preferably, in order to reduce the corresponding replacement road in section to be replaced and the section to be replaced obtained in the programme path
The operand of section, the traffic jam frequent occurrence that the replaceable section centering of pre-set experience can be obtained based on summary of experience
Section be defined as the first section, replaceable first section, and the section that traffic jam infrequently occurs is defined as the second tunnel
Section, when obtaining section to be replaced in the programme path and the corresponding replacement section in the section to be replaced, by each group
First section of the replaceable section centering of experience is matched with the section in the programme path.
It should be noted that the replaceable section of pre-set experience is dug to that can pass through artificially specified or big data
The mode of pick obtains, and the present embodiment is not limited thereof.
Step 120, based on the programme path, the starting point in the section to be replaced, terminal and the replacement section
Starting point, terminal determine replacement section.
Wherein, in order to realize the excavation to more public experience routes, more public experience routes is made to be applied to navigation
In path planning, go out line efficiency to promote effect and the user of navigation route planning, the embodiment of the present invention do not limit it is described to
Replace the end of the terminal and the replacement section in the starting point in section and the starting point in the replacement section and the section to be replaced
Point strict conformance；The starting point in the i.e. described section to be replaced is different from the replacement starting point in section, and/or, the road to be replaced
The terminal of section is different from the replacement terminal in section, altogether includes three kinds of possible situations, is respectively as follows: the section to be replaced
Starting point is different from the replacement starting point in section, and the terminal in the section to be replaced and the terminal in the replacement section are not
Together；Alternatively, the starting point in the section to be replaced is different from the replacement starting point in section, and the terminal in the section to be replaced
It is identical as the replacement terminal in section；Alternatively, the starting point in the section to be replaced is identical as the replacement starting point in section, and
And the terminal in the section to be replaced is different from the replacement terminal in section.
Illustratively, reference can be made to a kind of experience route shown in Fig. 2 replaces schematic diagram, from Figure 2 it can be seen that if not limiting described
The terminal of the starting point and the section to be replaced in the starting point in section to be replaced and the replacement section and the replacement section
Terminal strict conformance has a plurality of replacement section (c- > d- > e- > f- > F- > G- > H- > X or C- > D- > E- > F- > G- > H- > X) can
For replacing section 1 (Start- > A- > B- > J- > K- > L- > M- > N- > O- > End) to be replaced, actual traffic road net is also abided by
Follow above-mentioned rule.Further, an optimal section can be selected as section 1 to be replaced from a plurality of replacement section
Replace section, if such as based on summary of experience obtain replacement section 2 it is flat when road conditions it is best, the used time is most short, therefore can will replace road
2 replacement section as section 1 to be replaced of section, the then replaceable section pair of experience corresponding with Fig. 2 are as follows:
Section 1=Start- > A- > B- > J- > K- > L- > M- > N- > O- > End to be replaced
Replace section 2=C- > D- > E- > F- > G- > H- > X
Assuming that programme path are as follows:
I- > Z- > Y- > Start- > A- > B- > J- > K- > L- > M- > N- > O- > End- > P- > X- > Q, refering to what is shown in Fig. 2, being based on
The programme path, the starting point in section to be replaced 1, terminal, and the starting point in replacement section 2, terminal determine corresponding replacement area
Between be [Y, X].
The section that section is replaced described in the programme path is replaced with the replacement section by step 130.
Continue by taking Fig. 2 as an example, it is assumed that the programme path are as follows:
I->Z->Y->Start->A->B->J->K->L->M->N->O->End->P->X->Q
Section 1=Start- > A- > B- > J- > K- > L- > M- > N- > O- > End to be replaced
Replace section 2=C- > D- > E- > F- > G- > H- > X
Corresponding replacement section is [Y, X], then replaced programme path are as follows:
I->Z->C->D->E->F->G->H->X->Q
The technical solution of the present embodiment, by the way that the experience route of people is set in advance as the replaceable section pair of experience, into
When row navigation path planning, based on the replaceable section of the experience to the section to be replaced that obtains in the programme path and described
The corresponding replacement section in section to be replaced, and replace and be strictly overlapped between route and route to be replaced without head and the tail, realizes pair
The excavation of more masses' experience routes, improves the replacement efficiency to route to be replaced, improves the effect of navigation route planning
And line efficiency out.
Embodiment two
Fig. 3 is a kind of flow diagram of experience route replacement method provided by Embodiment 2 of the present invention.In above-mentioned implementation
Example on the basis of, the present embodiment to step 120 " based on the programme path, the starting point in the section to be replaced, terminal, and
The replacement starting point in section, terminal determine replacement section " be optimized, if give the starting point in the section to be replaced with
When the starting point difference and the terminal in the section to be replaced in the replacement section and the terminal difference for replacing section, institute
The specific method of determination in replacement section is stated, referring specifically to shown in Fig. 3, the experience route replacement method includes the following steps:
Step 310, acquisition programme path, the section to be replaced in the programme path and the section to be replaced are corresponding
Replace section.
Step 320, determine the replacement section starting point into road set and the terminal in the replacement section
Deviate from road set.
Wherein, it is described replacement section starting point into road set refer to towards it is described replacement section starting point all roads
Road, the abjection road set of the terminal in the replacement section refer to all roads that the terminal in the replacement section is led to.Specifically
It can be found in a kind of schematic diagram into road set and abjection road set shown in Fig. 4, it is assumed that replacement section
Starting point be A, terminal B, then starting point A enter road set, i.e., towards starting point A all roads be { a, b, c }, terminal B
Abjection road set, i.e. all roads that terminal B is led to are { d, e, f }.
Step 330, on the programme path along the section to be replaced starting point approach axis carry out search conversely,
Search belong to the road into road set when, which is determined as to replace starting point road.
Wherein, the reality of search conversely is carried out along the approach axis of the starting point in the section to be replaced on the programme path
Matter is that the road of the section starting point to be replaced is led in search on the programme path, is belonged to if existing in the road searched
In the road into road set, then this is belonged into the road into road set and be determined as replacing starting point road.
By taking a kind of experience route replacement schematic diagram shown in Fig. 2 as an example, illustrate the determination process of above-mentioned replacement starting point road: assuming that Fig. 2
In section 1=Start- > A- > B- > J- > K- > L- > M- > N- > O- > End to be replaced, replace section 2=C- > D- > E- > F- > G-
> H- > X, programme path are as follows: I- > Z- > Y- > Start- > A- > B- > J- > K- > L- > M- > N- > O- > End- > P- > X- > Q is then replaced
The starting point C in section 2 into road set and the abjection road set of terminal X be respectively { Z } and { Q }, on the planning road
Approach axis on line along the starting point Start in section 2 to be replaced carries out search conversely, and the search result obtained first is road Y,
If continuing to search for, obtained search result is road Z, if being further continued for scanning for, obtained search result is road
I；Search belong to the road into road set when, which is determined as to replace starting point road, search conversely knot
Beam when searching road Z, is judged that road Z belongs to the road for entering road set ({ Z }) in the present embodiment, therefore
Road Z is determined as to replace starting point road, search conversely terminates.
Step 340, on the programme path along the section to be replaced terminal abjection direction carry out sequential search,
When searching the road for belonging to the abjection road set, which is determined as to replace terminal road.
Wherein, the reality of sequential search is carried out along the abjection direction of the terminal in the section to be replaced on the programme path
Matter is that all roads that the terminal in the section to be replaced is led to successively are searched on the programme path, is continued with above-mentioned
For citing in step 330, the programme path (I- > Z- > Y- > Start- > A- > B- > J- > K- > L- > M- > N- > O- >
End- > P- > X- > Q) on along the section 1 to be replaced terminal End abjection direction carry out sequential search, obtained search knot
Fruit is followed successively by road P, road X and road Q, wherein when searching road Q, is judged that road Q belongs to the abjection road collection
The road of ({ Q }) is closed, therefore road Q is determined as to replace terminal road, sequential search terminates.
The replacement starting point road and the replacement terminal road are identified as the replacement section by step 350
Origin And Destination.
Continue by taking the citing in above-mentioned steps 340 as an example, the Origin And Destination in the replacement section is respectively road Z and road
Road Q.
Step 360 will replace the section between starting point road and the replacement terminal road described in the programme path
Replace with the replacement section.
Illustratively, a kind of route shown in Figure 5 replaces schematic diagram, wherein section 1 is section to be replaced, section 2
To replace section, the road set that enters for replacing the starting point A in section is { a, b, c }, replaces the abjection road collection of the terminal B in section
It is combined into { d, e, f }.The approach axis of starting point on programme path along section to be replaced carries out search conversely, and what is searched belongs to
The road into road set is road { a }, therefore road a is replacement starting point road.Along to be replaced on programme path
The abjection direction of the terminal in section carries out sequential search, and it is road e that is searched, which belongs to the road of the abjection road set, because
This road e is replacement terminal road, therefore the section in the programme path between road a and road e is replaced with replacement section
2, generate final route.
The technical solution of the present embodiment, if the starting point in the section to be replaced is different from the replacement starting point in section, simultaneously
And the terminal in the section to be replaced is different from the replacement terminal in section, then determines the starting point in the replacement section first
Into road set and the abjection road set of the terminal in the replacement section；Then on the programme path along it is described to
The approach axis for replacing the starting point in section carries out search conversely, search belong to the road into road set when, will
The road is determined as replacing starting point road；The abjection direction of terminal on the programme path along the section to be replaced carries out
The road is determined as replacing terminal road, and most by sequential search when searching the road for belonging to the abjection road set
The section between replacement starting point road described in the programme path and the replacement terminal road replaces with the replacement at last
Section realizes the excavation to more public experience routes, improves the effect and line efficiency out of navigation route planning.
Embodiment three
Fig. 6 is a kind of flow diagram for experience route replacement method that the embodiment of the present invention three provides.In above-mentioned implementation
Example on the basis of, the present embodiment to step 120 " based on the programme path, the starting point in the section to be replaced, terminal, and
The starting point in the replacement section, terminal determine replacement section " continue optimization, if giving rising for the section to be replaced
Point replaces that the starting point in section is different and the terminal in the section to be replaced is identical as the replacement terminal in section with described
When, the specific method of determination in the replacement section is shown referring specifically to fig. 6, and the experience route replacement method includes following step
It is rapid:
Step 610, acquisition programme path, the section to be replaced in the programme path and the section to be replaced are corresponding
Replace section.
Step 620, the entrance road set for determining the starting point for replacing section.
Step 630, on the programme path along the section to be replaced starting point approach axis carry out search conversely,
Search belong to the road into road set when, which is determined as to replace starting point road.
Step 640 replaces next road of the starting point road on the programme path and the section to be replaced for described
Terminal be identified as it is described replacement section Origin And Destination.
Wherein, next road of the replacement starting point road on the programme path refers to that the replacement starting point road leads to
, it is on the programme path and with it is described replacement starting point road arest neighbors road.Specifically, shown in Figure 7 one
Kind experience route replaces schematic diagram, wherein section to be replaced are as follows:
Start->A->B->J->K->L->M->N->O->End
Replace section are as follows: C- > D- > E- > F- > G- > H- > End,
Programme path are as follows: Z- > Y- > Start- > A- > B- > J- > K- > L- > M- > N- > O- > End- > P- > X- > Q
The road set that enters for then replacing the starting point C in section (C- > D- > E- > F- > G- > H- > End) is { Z }, in the rule
It draws on route (Z- > Y- > Start- > A- > B- > J- > K- > L- > M- > N- > O- > End- > P- > X- > Q) along the section to be replaced
The approach axis of the starting point Start of (Start- > A- > B- > J- > K- > L- > M- > N- > O- > End) carries out search conversely, obtains
Search result is { Z, Y }, and wherein road Z belongs to the road into road set, therefore road Z is determined as to replace starting point
Road, replacing next road of the starting point road Z on the programme path is road Y, therefore, by road Y with it is described to be replaced
The terminal End in section is identified as the Origin And Destination in the replacement section, i.e., corresponding replacement section is [Y, End].
Step 650, by next road in the programme path from the replacement starting point road to the section to be replaced
The section of terminal replace with the replacement section.
Continue to use the citing in above-mentioned steps 640, replaced programme path are as follows:
Z->C->D->E->F->G->H->End->P->X->Q
The technical solution of the present embodiment, if the starting point in the section to be replaced is different from the replacement starting point in section, simultaneously
And the terminal in the section to be replaced is identical as the replacement terminal in section, then only determine it is described replacement section starting point into
Enter road set；Then the approach axis of the starting point on the programme path along the section to be replaced carries out search conversely,
Search belong to the road into road set when, which is determined as to replace starting point road, and finally will be described
The section of terminal of next road to the section to be replaced in programme path from the replacement starting point road replaces with described
Section is replaced, the excavation to more public experience routes is realized, improves the effect and line efficiency out of navigation route planning.
Example IV
Fig. 8 is a kind of flow diagram for experience route replacement method that the embodiment of the present invention four provides.In above-mentioned implementation
Example on the basis of, the present embodiment to step 120 " based on the programme path, the starting point in the section to be replaced, terminal, and
The starting point in the replacement section, terminal determine replacement section " continue optimization, if giving rising for the section to be replaced
The terminal in the point section to be replaced identical and described from the starting point in the replacement section is different with the replacement terminal in section
When, the specific method of determination in the replacement section, referring specifically to shown in Fig. 8, the experience route replacement method includes following step
It is rapid:
Step 810, acquisition programme path, the section to be replaced in the programme path and the section to be replaced are corresponding
Replace section.
Step 820, the abjection road set for determining the terminal for replacing section.
Step 830, on the programme path along the section to be replaced terminal abjection direction carry out sequential search,
When searching the road for belonging to the abjection road set, which is determined as to replace terminal road.
Step 840, by the starting point in the section to be replaced, upper on the programme path with the replacement terminal road
One road is identified as the Origin And Destination in the replacement section.
Wherein, a upper road of the replacement terminal road on the programme path refers to towards the replacement terminal road
, it is on the programme path and with it is described replacement terminal road arest neighbors road.Specifically, shown in Figure 9 one
Kind experience route replaces schematic diagram, wherein section to be replaced are as follows:
Start->A->B->J->K->L->M->N->O->End
Replace section are as follows: Start- > C- > D- > E- > F- > G- > H- > X,
Programme path are as follows: Z- > Y- > Start- > A- > B- > J- > K- > L- > M- > N- > O- > End- > P- > X- > Q
The abjection road collection for then replacing the terminal X in section (Start- > C- > D- > E- > F- > G- > H- > X) is combined into { Q }, in institute
It states on programme path (Z- > Y- > Start- > A- > B- > J- > K- > L- > M- > N- > O- > End- > P- > X- > Q) along the road to be replaced
The abjection direction of the terminal End of section (Start- > A- > B- > J- > K- > L- > M- > N- > O- > End) carries out sequential search, obtains
Search result is { P, X, Q }, and wherein road Q belongs to the road of the abjection road set, therefore road Q is determined as replacement eventually
Point road, replacing a upper road of the terminal road Q on the programme path is road X, therefore, by the starting point in section to be replaced
Start, rising for the replacement section is identified as with upper road X of the replacement terminal road on the programme path
Point and terminal, i.e., corresponding replacement section are [Start, X].
Step 850 will replace the upper of terminal road to described from the starting point in the section to be replaced in the programme path
The section of one road replaces with the replacement section.
Continue to use the citing in above-mentioned steps 840, replaced programme path are as follows:
Z->Y->Start->C->D->E->F->G->H->X->Q
The technical solution of the present embodiment, if the starting point in the section to be replaced is identical as the replacement starting point in section, simultaneously
And the terminal in the section to be replaced is different from the replacement terminal in section, then only determines the de- of the terminal in the replacement section
Road set out, then the abjection direction of the terminal on the programme path along the section to be replaced carries out sequential search,
When searching the road for belonging to the abjection road set, which is determined as to replace terminal road, and finally will be described
The section of a upper road in programme path from the starting point in the section to be replaced to the replacement terminal road replaces with described
Section is replaced, the excavation to more public experience routes is realized, improves the effect and line efficiency out of navigation route planning.
On the basis of the above embodiments, the experience route replacement method further include: if do not search belong to it is described into
Enter the road of road set, and/or, the road for belonging to the abjection road set is not searched, then road can not be carried out by issuing
The prompt information of replacement, to promote user experience.
Embodiment five
Figure 10 is a kind of structural schematic diagram for experience route alternative that the embodiment of the present invention five provides, referring to Figure 10 institute
Show, described device includes: to obtain module 1010, determining module 1020 and replacement module 1030；
Wherein, obtain module 1010, for obtaining programme path, the section to be replaced in the programme path and it is described to
Replace the corresponding replacement section in section；Determining module 1020, for based on the programme path, the section to be replaced
Point, the starting point of terminal and the replacement section, terminal determine replacement section；Replacement module 1030 is used for the planning road
The section that section is replaced described in line replaces with the replacement section；Wherein, the starting point in the section to be replaced and the replacement
The starting point in section is different, and/or, the terminal in the section to be replaced is different from the replacement terminal in section.
Further, if the starting point in the section to be replaced and the replacement starting point in section are different and described wait replace
The terminal for changing section is different from the replacement terminal in section, and determining module 1020 is specifically used for: determining the replacement section
Starting point into road set and it is described replacement section terminal abjection road set；Along described on the programme path
The approach axis of the starting point in section to be replaced carries out search conversely, search belong to the road into road set when,
The road is determined as to replace starting point road；On the programme path along the section to be replaced terminal abjection direction into
The road is determined as replacing terminal road by row sequential search when searching the road for belonging to the abjection road set；It will
The replacement starting point road and the replacement terminal road are identified as the Origin And Destination in the replacement section；It is corresponding,
Replacement module 1030 is used for: by the section between replacement starting point road described in the programme path and the replacement terminal road
Replace with the replacement section.
Further, if the starting point in the section to be replaced and the replacement starting point in section are different and described wait replace
The terminal for changing section is identical as the replacement terminal in section, and determining module 1020 is specifically used for: determining the replacement section
Starting point enters road set；Approach axis on the programme path along the starting point in the section to be replaced carries out backward and searches
Rope, search belong to the road into road set when, which is determined as to replace starting point road；By the replacement
Next road of the starting point road on the programme path and the terminal in the section to be replaced are identified as the replacement area
Between Origin And Destination；Corresponding, replacement module 1030 is used for:
By the terminal in the programme path from next road of the replacement starting point road to the section to be replaced
Section replaces with the replacement section.
Further, if the starting point in the section to be replaced and the replacement starting point in section are identical and described wait replace
The terminal for changing section is different from the replacement terminal in section, and the determining module 1020 is specifically used for: determining the replacement road
The abjection road set of the terminal of section；The abjection direction progress of terminal on the programme path along the section to be replaced is suitable
The road is determined as replacing terminal road by sequence search when searching the road for belonging to the abjection road set；It will be described
The starting point in section to be replaced is identified as described replace with a upper road of the replacement terminal road on the programme path
Change the Origin And Destination in section；Corresponding, replacement module 1030 is specifically used for: by the programme path from the road to be replaced
The section of the starting point of section to the upper road for replacing terminal road replaces with the replacement section.
Further, obtaining module 1010 includes: acquiring unit and determination unit,
Wherein, acquiring unit is for obtaining the replaceable section pair of pre-set at least one set of experience；
Determination unit is used for for each replaceable section pair of experience, if the current replaceable section centering of experience includes
A section on the programme path, then the section is determined as section to be replaced, by the replaceable section pair of current experience
In another section as replacement section.
Further, described device further includes reminding module, if for do not search belong to it is described into road set
Road, and/or, the road for belonging to the abjection road set is not searched, issues the prompt information that can not carry out road replacement.
Further, module 1010 is obtained further include: Route Generation unit, the terminus position for inputting according to user
Information and setting path planning algorithm, generate programme path.
The technical solution of the present embodiment, by the way that the experience route of people is set in advance as the replaceable section pair of experience, into
When row navigation path planning, based on the replaceable section of the experience to the section to be replaced that obtains in the programme path and described
The corresponding replacement section in section to be replaced, and replace and be strictly overlapped between route and route to be replaced without head and the tail, realizes pair
The excavation of more masses' experience routes, improves the replacement efficiency to route to be replaced, improves the effect of navigation route planning
And line efficiency out.
Warp provided by any embodiment of the invention can be performed in experience route alternative provided by the embodiment of the present invention
Route replacement method is tested, has the corresponding functional module of execution method and beneficial effect.
Embodiment six
Figure 11 is the structural schematic diagram for a kind of electronic equipment that the embodiment of the present invention six provides.Figure 11, which is shown, to be suitable for being used to
Realize the block diagram of the example devices 12 of embodiment of the present invention.The equipment 12 that Figure 11 is shown is only an example, should not be right
The function and use scope of the embodiment of the present invention bring any restrictions.
As shown in figure 11, equipment 12 is showed in the form of universal computing device.The component of equipment 12 may include but unlimited
In one or more processor or processing unit 16, system storage 28, connecting different system components, (including system is deposited
Reservoir 28 and processing unit 16) bus 18.
Bus 18 indicates one of a few class bus structures or a variety of, including memory bus or Memory Controller,
Peripheral bus, graphics acceleration port, processor or the local bus using any bus structures in a variety of bus structures.It lifts
For example, these architectures include but is not limited to industry standard architecture (ISA) bus, microchannel architecture (MAC)
Bus, enhanced isa bus, Video Electronics Standards Association (VESA) local bus and peripheral component interconnection (PCI) bus.
Equipment 12 typically comprises a variety of computer system readable media.These media can be it is any can be by equipment 12
The usable medium of access, including volatile and non-volatile media, moveable and immovable medium.
System storage 28 may include the computer system readable media of form of volatile memory, such as arbitrary access
Memory (RAM) 30 and/or cache memory 32.Equipment 12 may further include it is other it is removable/nonremovable,
Volatile/non-volatile computer system storage medium.Only as an example, storage system 34 can be used for reading and writing irremovable
, non-volatile magnetic media (Figure 11 do not show, commonly referred to as " hard disk drive ").Although being not shown in Figure 11, can provide
Disc driver for being read and write to removable non-volatile magnetic disk (such as " floppy disk "), and to removable anonvolatile optical disk
The CD drive of (such as CD-ROM, DVD-ROM or other optical mediums) read-write.In these cases, each driver can
To be connected by one or more data media interfaces with bus 18.Memory 28 may include at least one program product,
The program product has one group of (such as acquisition module 1010, determining module 1020 and replacement module of experience route alternative
1030) program module, these program modules are configured to perform the function of various embodiments of the present invention.
With one group of (acquisition module 1010, determining module 1020 and the replacement module 1030 of experience route alternative) journey
Program/utility 40 of sequence module 42, can store in such as memory 28, and such program module 42 includes but unlimited
In operating system, one or more application program, other program modules and program data, each of these examples or
It may include the realization of network environment in certain combination.Program module 42 usually executes the function in embodiment described in the invention
Energy and/or method.
Equipment 12 can also be communicated with one or more external equipments 14 (such as keyboard, sensing equipment, display 24 etc.),
Can also be enabled a user to one or more equipment interacted with the equipment 12 communication, and/or with enable the equipment 12 with
One or more of the other any equipment (such as network interface card, modem etc.) communication for calculating equipment and being communicated.It is this logical
Letter can be carried out by input/output (I/O) interface 22.Also, equipment 12 can also by network adapter 20 and one or
The multiple networks of person (such as local area network (LAN), wide area network (WAN) and/or public network, such as internet) communication.As shown,
Network adapter 20 is communicated by bus 18 with other modules of equipment 12.It should be understood that although not shown in the drawings, can combine
Equipment 12 use other hardware and/or software module, including but not limited to: microcode, device driver, redundant processing unit,
External disk drive array, RAID system, tape drive and data backup storage system etc..
Processing unit 16 by the program that is stored in system storage 28 of operation, thereby executing various function application and
Data processing, such as realize experience route replacement method provided by the embodiment of the present invention.
Embodiment seven
The embodiment of the present invention seven additionally provides a kind of computer readable storage medium, is stored thereon with computer program, should
Experience route replacement method described in any embodiment of the present invention is realized when program is executed by processor.The experience route replacement
Method, comprising:
Obtain programme path, the corresponding replacement road in the section to be replaced in the programme path and the section to be replaced
Section；
Starting point, end based on the programme path, the starting point in the section to be replaced, terminal and the replacement section
Point determines replacement section；
The section that section is replaced described in the programme path is replaced with into the replacement section；
Wherein, the starting point in the section to be replaced is different from the replacement starting point in section, and/or, the road to be replaced
The terminal of section is different from the replacement terminal in section.
The computer storage medium of the embodiment of the present invention, can be using any of one or more computer-readable media
Combination.Computer-readable medium can be computer-readable signal media or computer readable storage medium.It is computer-readable
Storage medium for example may be-but not limited to-the system of electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor, device or
Device, or any above combination.The more specific example (non exhaustive list) of computer readable storage medium includes: tool
There are electrical connection, the portable computer diskette, hard disk, random access memory (RAM), read-only memory of one or more conducting wires
(ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-
ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.In this document, computer-readable storage
Medium can be any tangible medium for including or store program, which can be commanded execution system, device or device
Using or it is in connection.
Computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal,
Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited
In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can
Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for
By the use of instruction execution system, device or device or program in connection.
The program code for including on computer-readable medium can transmit with any suitable medium, including --- but it is unlimited
In wireless, electric wire, optical cable, RF etc. or above-mentioned any appropriate combination.
The computer for executing operation of the present invention can be write with one or more programming languages or combinations thereof
Program code, described program design language include object oriented program language-such as Java, Smalltalk, C++,
It further include conventional procedural programming language-such as C language or similar programming language.Program code can be complete
It executes, partly executed on the user computer on the user computer entirely, being executed as an independent software package, part
Part executes on the remote computer or executes on a remote computer or server completely on the user computer.It is relating to
And in the situation of remote computer, remote computer can pass through the network of any kind --- including local area network (LAN) or extensively
Domain net (WAN)-be connected to subscriber computer, or, it may be connected to outer computer (such as provided using Internet service
Quotient is connected by internet).
Note that the above is only a better embodiment of the present invention and the applied technical principle.It will be appreciated by those skilled in the art that
The invention is not limited to the specific embodiments described herein, be able to carry out for a person skilled in the art it is various it is apparent variation,
It readjusts and substitutes without departing from protection scope of the present invention.Therefore, although being carried out by above embodiments to the present invention
It is described in further detail, but the present invention is not limited to the above embodiments only, without departing from the inventive concept, also
It may include more other equivalent embodiments, and the scope of the invention is determined by the scope of the appended claims.
Claims (10)
1. a kind of experience route replacement method characterized by comprising
Obtain programme path, the corresponding replacement section in the section to be replaced in the programme path and the section to be replaced；
It is true based on the programme path, the starting point in the section to be replaced, terminal and the starting point in the replacement section, terminal
Surely section is replaced；
The section that section is replaced described in the programme path is replaced with into the replacement section；
Wherein, the starting point in the section to be replaced is different from the replacement starting point in section, and/or, the section to be replaced
Terminal is different from the replacement terminal in section.
2. the method according to claim 1, wherein if the starting point in the section to be replaced and the replacement section
Starting point is different and the terminal in the section to be replaced is different from the replacement terminal in section, it is described based on the planning
Route, the starting point in the section to be replaced, terminal and the starting point in the replacement section, terminal determine replacement section, comprising:
Determine it is described replacement section starting point into road set and it is described replacement section terminal abjection road set；
The approach axis of starting point on the programme path along the section to be replaced carries out search conversely, belongs to searching
When the road into road set, which is determined as to replace starting point road；
The abjection direction of terminal on the programme path along the section to be replaced carries out sequential search, belongs to searching
When the road of the abjection road set, which is determined as to replace terminal road；
The replacement starting point road and the replacement terminal road are identified as to the Origin And Destination in the replacement section；
It is corresponding, it is described that the section that section is replaced described in the programme path is replaced with into the replacement section, comprising:
Section between replacement starting point road described in the programme path and the replacement terminal road is replaced with into described replace
Change section.
3. the method according to claim 1, wherein if the starting point in the section to be replaced and the replacement section
Starting point is different and the terminal in the section to be replaced is identical with the replacement terminal in section, it is described based on the planning
Route, the starting point in the section to be replaced, terminal and the starting point in the replacement section, terminal determine replacement section, comprising:
Determine the starting point in the replacement section enters road set；
The approach axis of starting point on the programme path along the section to be replaced carries out search conversely, belongs to searching
When the road into road set, which is determined as to replace starting point road；
Next road of the replacement starting point road on the programme path and the terminal difference in the section to be replaced is true
It is set to the Origin And Destination in the replacement section；
It is corresponding, it is described that the section that section is replaced described in the programme path is replaced with into the replacement section, comprising:
The section of terminal by next road in the programme path from the replacement starting point road to the section to be replaced
Replace with the replacement section.
4. the method according to claim 1, wherein if the starting point in the section to be replaced and the replacement section
Starting point is identical and the terminal in the section to be replaced is different from the replacement terminal in section, it is described to be based on the planning
Route, the starting point in the section to be replaced, terminal and the starting point in the replacement section, terminal determine replacement section, comprising:
Determine the abjection road set of the terminal in the replacement section；
The abjection direction of terminal on the programme path along the section to be replaced carries out sequential search, belongs to searching
When the road of the abjection road set, which is determined as to replace terminal road；
Distinguish by the starting point in the section to be replaced, with a upper road of the replacement terminal road on the programme path true
It is set to the Origin And Destination in the replacement section；
It is corresponding, it is described that the section that section is replaced described in the programme path is replaced with into the replacement section, comprising:
By the section of the upper road in the programme path from the starting point in the section to be replaced to the replacement terminal road
Replace with the replacement section.
5. method according to any of claims 1-4, which is characterized in that obtain to be replaced in the programme path
The corresponding replacement section in section and the section to be replaced, comprising:
Obtain the replaceable section pair of pre-set at least one set of experience；
For each replaceable section pair of experience, if the section that the current replaceable section centering of experience includes is in the rule
It draws on route, then the section is determined as section to be replaced, using another section of the replaceable section centering of current experience as replacing
Change section.
6. the method according to any one of claim 2-4, which is characterized in that further include: if do not search belong to it is described
Into the road of road set, and/or, the road for belonging to the abjection road set is not searched, then issuing can not carry out
The prompt information of road replacement.
7. method according to any of claims 1-4, which is characterized in that the acquisition programme path, comprising:
According to the start and end dot position information of user's input and setting path planning algorithm, programme path is generated.
8. a kind of experience route alternative characterized by comprising
Obtain module, for obtaining programme path, the section to be replaced in the programme path and the section to be replaced it is corresponding
Replacement section；
Determining module, for based on the programme path, the starting point in the section to be replaced, terminal and the replacement section
Starting point, terminal determine replacement section；
Replacement module, for the section for replacing section described in the programme path to be replaced with the replacement section；
Wherein, the starting point in the section to be replaced is different from the replacement starting point in section, and/or, the section to be replaced
Terminal is different from the replacement terminal in section.
9. a kind of electronic equipment, which is characterized in that the electronic equipment includes:
One or more processors；
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors are real
The now experience route replacement method as described in any in claim 1-7.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor
The experience route replacement method as described in any in claim 1-7 is realized when execution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910194594.7A CN109781132B (en) | 2019-03-14 | 2019-03-14 | Experience route replacing method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910194594.7A CN109781132B (en) | 2019-03-14 | 2019-03-14 | Experience route replacing method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109781132A true CN109781132A (en) | 2019-05-21 |
| CN109781132B CN109781132B (en) | 2020-12-01 |
Family
ID=66487928
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910194594.7A Active CN109781132B (en) | 2019-03-14 | 2019-03-14 | Experience route replacing method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109781132B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109612490A (en) * | 2019-01-14 | 2019-04-12 | 闽江学院 | A kind of method and apparatus judging travel route based on travel speed |
| CN110579221A (en) * | 2019-09-30 | 2019-12-17 | 重庆元韩汽车技术设计研究院有限公司 | trajectory planning method and system for remote control |
| CN111707285A (en) * | 2020-06-28 | 2020-09-25 | 北京百度网讯科技有限公司 | Method and device for planning route |
| CN113494919A (en) * | 2020-03-20 | 2021-10-12 | 百度在线网络技术（北京）有限公司 | Navigation planning method and device based on personal local experience route |
| CN115240423A (en) * | 2022-07-24 | 2022-10-25 | 刘浩 | Internet-based intelligent city traffic allocation method and system |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101173861A (en) * | 2006-11-01 | 2008-05-07 | 阿尔派株式会社 | Navigation device for vehicle and ring shape cross display method |
| US20140046585A1 (en) * | 2012-08-10 | 2014-02-13 | Telogis, Inc. | Real-time computation of vehicle service routes |
| US20140100782A1 (en) * | 2011-08-24 | 2014-04-10 | Modular Mining Systems, Inc. | Guided maneuvering of a mining vehicle to a target destination |
| CN104236577A (en) * | 2014-09-19 | 2014-12-24 | 联想(北京)有限公司 | Information processing method and electronic equipment |
| CN104424799A (en) * | 2013-09-05 | 2015-03-18 | 吴汉才 | Dynamic real-time road condition acquisition and service system and method |
| CN104484514A (en) * | 2014-12-03 | 2015-04-01 | 宁波大学 | Flexible bus route design method capable of evading jammed road segments |
| JP2015224868A (en) * | 2014-05-24 | 2015-12-14 | インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ | Route guiding method using text |
| CN105606116A (en) * | 2016-03-24 | 2016-05-25 | 广东欧珀移动通信有限公司 | Navigation method, navigation device and system for navigating route |
| US20160162843A1 (en) * | 2008-06-27 | 2016-06-09 | Apple Inc. | Dynamic alerts for calendar events |
| CN105973257A (en) * | 2016-06-28 | 2016-09-28 | 百度在线网络技术（北京）有限公司 | Navigation method and device |
| CN106225794A (en) * | 2016-06-30 | 2016-12-14 | 百度在线网络技术（北京）有限公司 | A kind of method and device for planning of navigation way |
| CN106595684A (en) * | 2016-11-22 | 2017-04-26 | 上海斐讯数据通信技术有限公司 | Electronic map-based navigation method and device |
| US20180051997A1 (en) * | 2016-08-22 | 2018-02-22 | Microsoft Technology Licensing, Llc | Generating personalized routes with route deviation information |
| CN108020238A (en) * | 2016-11-02 | 2018-05-11 | 武汉四维图新科技有限公司 | A kind of method, apparatus and navigation equipment for obtaining transit point |
| CN108267150A (en) * | 2018-01-31 | 2018-07-10 | 武汉光庭信息技术股份有限公司 | It is a kind of to solve the layering rational method and system of route planning circuit |
-
2019
- 2019-03-14 CN CN201910194594.7A patent/CN109781132B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101173861A (en) * | 2006-11-01 | 2008-05-07 | 阿尔派株式会社 | Navigation device for vehicle and ring shape cross display method |
| US20160162843A1 (en) * | 2008-06-27 | 2016-06-09 | Apple Inc. | Dynamic alerts for calendar events |
| US20140100782A1 (en) * | 2011-08-24 | 2014-04-10 | Modular Mining Systems, Inc. | Guided maneuvering of a mining vehicle to a target destination |
| US20140046585A1 (en) * | 2012-08-10 | 2014-02-13 | Telogis, Inc. | Real-time computation of vehicle service routes |
| CN104424799A (en) * | 2013-09-05 | 2015-03-18 | 吴汉才 | Dynamic real-time road condition acquisition and service system and method |
| JP2015224868A (en) * | 2014-05-24 | 2015-12-14 | インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ | Route guiding method using text |
| CN104236577A (en) * | 2014-09-19 | 2014-12-24 | 联想(北京)有限公司 | Information processing method and electronic equipment |
| CN104484514A (en) * | 2014-12-03 | 2015-04-01 | 宁波大学 | Flexible bus route design method capable of evading jammed road segments |
| CN105606116A (en) * | 2016-03-24 | 2016-05-25 | 广东欧珀移动通信有限公司 | Navigation method, navigation device and system for navigating route |
| CN105973257A (en) * | 2016-06-28 | 2016-09-28 | 百度在线网络技术（北京）有限公司 | Navigation method and device |
| CN106225794A (en) * | 2016-06-30 | 2016-12-14 | 百度在线网络技术（北京）有限公司 | A kind of method and device for planning of navigation way |
| US20180051997A1 (en) * | 2016-08-22 | 2018-02-22 | Microsoft Technology Licensing, Llc | Generating personalized routes with route deviation information |
| CN108020238A (en) * | 2016-11-02 | 2018-05-11 | 武汉四维图新科技有限公司 | A kind of method, apparatus and navigation equipment for obtaining transit point |
| CN106595684A (en) * | 2016-11-22 | 2017-04-26 | 上海斐讯数据通信技术有限公司 | Electronic map-based navigation method and device |
| CN108267150A (en) * | 2018-01-31 | 2018-07-10 | 武汉光庭信息技术股份有限公司 | It is a kind of to solve the layering rational method and system of route planning circuit |
Non-Patent Citations (2)
| Title |
|---|
| FARAJI, AMIR H.等: ""Longitudinal evaluation of corticospinal tract in patients with resected brainstem cavernous malformations using high-definition fiber tractography and diffusion connectometry analysis: preliminary experience"", 《JOURNAL OF NEUROSURGERY》 * |
| 苏丽: ""基于VANET的交通流信息采集与动态路径选择方法研究"", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109612490A (en) * | 2019-01-14 | 2019-04-12 | 闽江学院 | A kind of method and apparatus judging travel route based on travel speed |
| CN110579221A (en) * | 2019-09-30 | 2019-12-17 | 重庆元韩汽车技术设计研究院有限公司 | trajectory planning method and system for remote control |
| CN110579221B (en) * | 2019-09-30 | 2023-02-21 | 重庆元韩汽车技术设计研究院有限公司 | Trajectory planning method and system for remote control |
| CN113494919A (en) * | 2020-03-20 | 2021-10-12 | 百度在线网络技术（北京）有限公司 | Navigation planning method and device based on personal local experience route |
| CN113494919B (en) * | 2020-03-20 | 2022-07-05 | 百度在线网络技术（北京）有限公司 | Navigation planning method and device based on personal local experience route |
| CN111707285A (en) * | 2020-06-28 | 2020-09-25 | 北京百度网讯科技有限公司 | Method and device for planning route |
| CN115240423A (en) * | 2022-07-24 | 2022-10-25 | 刘浩 | Internet-based intelligent city traffic allocation method and system |
| CN115240423B (en) * | 2022-07-24 | 2024-03-01 | 福建港南实业有限公司 | Internet-based intelligent urban traffic allocation method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109781132B (en) | 2020-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109781132A (en) | A kind of experience route replacement method, device, electronic equipment and storage medium | |
| JP7204826B2 (en) | Traffic accident identification method, apparatus, device and computer storage medium | |
| CN107656913A (en) | Map point of interest address extraction method, apparatus, server and storage medium | |
| CN106969782A (en) | Method for pushing, device, equipment and the storage medium of navigation way | |
| CN111680362A (en) | Method, device and equipment for acquiring automatic driving simulation scene and storage medium | |
| JP7245900B2 (en) | Route identification method, apparatus, device, program and computer storage medium | |
| CN113342912B (en) | Geographical location area coding method, and method and device for establishing coding model | |
| CN111353009A (en) | Route time consumption estimation model, route time consumption estimation method and corresponding device | |
| CN112634612B (en) | Intersection flow analysis method and device, electronic equipment and storage medium | |
| JP7145184B2 (en) | Method, apparatus, device and computer readable storage medium used for navigation | |
| CN114413920A (en) | Lane data processing method, navigation method and device | |
| CN101782402B (en) | Navigation system, and path planning method thereof | |
| KR20230007256A (en) | Method and apparatus for fusing road data to generate a map, and electronic device | |
| CN111292549B (en) | Method for establishing route time consumption estimation model, method for estimating route time consumption and corresponding device | |
| CN114547223A (en) | Trajectory prediction method, and trajectory prediction model training method and device | |
| CN113160693B (en) | Road intersection processing method, device, equipment and storage medium | |
| CN104280045A (en) | Method and device for acquiring navigation information | |
| CN113901341A (en) | Navigation information prompting method, device, medium and program product | |
| CN116168172B (en) | Shale oil gas dessert prediction method, device, equipment and storage medium | |
| Graser | Towards landmark-based instructions for pedestrian navigation systems using OpenStreetMap | |
| CN113624245B (en) | Navigation method and device, computer storage medium and electronic equipment | |
| CN113276888B (en) | Riding method, device, equipment and storage medium based on automatic driving | |
| CN115290106A (en) | Method, device, equipment and storage medium for determining intersection path | |
| CN111782748B (en) | Map retrieval method, information point POI semantic vector calculation method and device | |
| CN113344277A (en) | Prediction model training method, state updating method, device, equipment and medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |