CN104008666B - A kind of fingerpost distribution method towards point of interest - Google Patents
A kind of fingerpost distribution method towards point of interest Download PDFInfo
- Publication number
- CN104008666B CN104008666B CN201410193586.8A CN201410193586A CN104008666B CN 104008666 B CN104008666 B CN 104008666B CN 201410193586 A CN201410193586 A CN 201410193586A CN 104008666 B CN104008666 B CN 104008666B
- Authority
- CN
- China
- Prior art keywords
- interest
- path
- point
- road network
- fingerpost
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000005457 optimization Methods 0.000 claims abstract description 21
- 230000008569 process Effects 0.000 claims description 18
- 239000000284 extract Substances 0.000 claims description 9
- 238000005253 cladding Methods 0.000 claims description 8
- 230000002093 peripheral effect Effects 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000010606 normalization Methods 0.000 claims description 5
- 238000004088 simulation Methods 0.000 claims description 5
- 230000006698 induction Effects 0.000 description 6
- 238000013499 data model Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000037361 pathway Effects 0.000 description 3
- 238000012216 screening Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000010845 search algorithm Methods 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 210000000988 bone and bone Anatomy 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000013517 stratification Methods 0.000 description 1
Landscapes
- Traffic Control Systems (AREA)
Abstract
The present invention relates to a kind of fingerpost distribution method towards point of interest.Described method is included on road net model the instruction road network extracting point of interest；Path optimization's index of guided path convenience is weighed in definition, and path optimization's index includes path, traffic flow and intersection turning；Indicate road network traversal with the secondary ordered pair of breadth First, calculate and dynamically update path optimization's index, obtaining the optimum guided path in instruction road network；The content that director information is set and the position that fingerpost board is set is determined according to optimum guided path.The present invention considers path, traffic flow to the impact of journey time and the increase of journey time that brought by crossing, in conjunction with range optimizing search method, path metric is optimized, a business efficiency height, quickly and easily fingerpost layout scheme can be got, layout scheme can meet the in-plant careful instruction of point of interest, and the emphasis on key road network that can meet again far-end guides.
Description
Technical field
The present invention relates to traffic planninng and design field, more particularly, to a kind of fingerpost towards point of interest
Will distribution method.
Background technology
In recent years Chinese society economic development is swift and violent, and urban infrastructure enters a flourish period, particularly makees
For the pioneer of economic development, Urban Road enters a peak period, and a large amount of roads, exploitation new district, commercial center throw
Enter to use.As the induction of of paramount importance static path and the road traffic facility of traffic diverging, urban road fingerpost board
Also renewal upgrading is needed badly.How to make road user arrive at quickly and easily on new traffic network, and realize handing over
Through-flow shunting action is road management, and person needs the important topic of research.The principal element affecting journey time has: path length
Degree, pathway traffic flow, intersection turning etc..Therefore integration schedules length, pathway traffic flow and intersection turning situation pair
Lay fingerpost board to have important practical significance.
Present Research in terms of fingerpost laying is as follows the most both at home and abroad:
First, in terms of fingerpost Research on Data Model, Huang Min, Sha Zhiren et al. propose the road network to fingerpost
Data model, proposes crossing characteristic function in a model, this function can state the turning to of section, connected state etc. towards
The road network topology data of fingerpost.Huang Min proposes three layer data models of fingerpost board: fingerpost point, fingerpost
Board, fingerpost item.Three layers of fingerpost data model are fingerpost director information and the geography of fingerpost board, traffic
Information digitalization provides solution.
Second, fingerpost distribution method can be divided into from object of study: towards the fingerpost distribution method of crossing
And the fingerpost distribution method research towards point of interest.Fingerpost distribution method towards crossing refers to
Object of study, is divided into connectivity mark and direction signs the director information of the fingerpost board of crossing, and sets a series of
Directivity mark screening rule, as road according to functional stratification, draw near, by high-grade to low-grade screening direction
Property director information.The fingerpost board being applicable to crossing of the method is arranged, but cannot make showing the way of adjacent crossing
Mark is together in series, and formation is regional guides, and guides the continuous accessibility of object to be difficult to ensure that.Showing the way towards point of interest
Mark distribution method, with point of interest for guiding object, is starting point from specific gateway, cooks up one and fast and convenient shows the way
Sign board wiring path, this method has met the function of the paths chosen of fingerpost to a certain extent, and ensure that
Guide the continuous accessibility of object, but the method is only applicable to the Way guidance of point-to-point, it is difficult to meet regionality and guide.
Above-mentioned distribution method is mainly directed towards the fingerpost cloth in the wall scroll induction path of single crossing or single point of interest
Equipment, method, the screening of director information is it can be considered that road attribute and the feature of point of interest, but induction path only considers induction
The length in path, does not all consider the impact on journey time on traffic flow and intersection turning, and cannot meet appointment district
In territory, the fingerpost towards point of interest lays demand.
Summary of the invention
The present invention is to overcome at least one defect (not enough) described in above-mentioned prior art, it is provided that one considers path
The fingerpost distribution method towards point of interest of length, pathway traffic flow and three factors of intersection turning.
For solving above-mentioned technical problem, technical scheme is as follows:
A kind of fingerpost distribution method towards point of interest, including
Road net model extracts the instruction road network of point of interest；
Path optimization's index of guided path convenience is weighed in definition, and described path optimization index includes path, friendship
Through-current capacity and intersection turning；
Indicate road network traversal with the secondary ordered pair of breadth First, calculate and dynamically update path optimization's index, obtaining instruction road
Optimum guided path in net；
The content that director information is set and the position that fingerpost board is set is determined according to optimum guided path.
As a kind of preferred version, the instruction road network extracting point of interest on road net model specifically includes:
The grade according to point of interest and indicating range R of road traffic simulation amount division point of interest on the basis of road net model；
The instruction road network of point of interest is extracted with double-round cladding process.
As further preferred version, the instruction road network extracting point of interest with double-round cladding process specifically includes:
Extract the careful road network of inner ring and outer ring backbone's road network respectively；
With point of interest as the center of circle, with radius as rcPreset a circle careful road network of covering and obtain the core instruction district of point of interest
Territory Gc；
One is preset between core indicating area G with point of interest for the center of circlecWith the annulus between indicating range R covers backbone
Road network obtains the peripheral indicating area G of point of interestp；
By core indicating area GcWith peripheral indicating area GpSeamless tight linking, obtains point of interest instruction road network Gg。
As further preferred version, in instruction road network, the path P of node k to node dkd={ vk,…vh,
(vh,vi),vi,(vi,vj),vj,…vdRepresent, wherein, vk、vh、vi、vdRepresent the node in instruction road network, (vi,vj) represent
Node i is to the section of node j, path PkdWeight W (vk,vd) equal to all of section weight on path with plus route turning
Weighted sum；When traveling through instruction road network with the order of breadth First, to minimize path weight value value as optimization aim, dynamically update road
Footpath optimizing index, in acquisition double-round, each crossing node is to the optimal path of point of interest.
As further preferred version, route turning weighted sum is calculated by equation below:
T(Pkd)=fl×Tl(Pkd)+fr×Tr(Pkd)+fs×Ts(Pkd)+fu×Tu(Pkd) (1)
T in formula (1)l(Pkd)、Ts(Pkd)、Tr(Pkd)、Tu(Pkd) represent path P respectivelykdUpper left-hand rotation, keep straight on, turn right, turn around
Number of times, fl、fs、fr、fuRepresent left-hand rotation, the weight coefficient kept straight on, turn right, turn around respectively；
Section weight and being calculated by equation below:
Section (the v of formula (2)i,vj) weight w (vi,vj) it is normalized weight, it comprises two parts, wherein
For normalization road section length, lijFor section (vi,vj) road section length, lminFor minimal path segment length in indicating range R, lmaxFor
Maximum road section length in indicating range R；For normalization link flow, qijFor section (vi,vj) link flow,
qminFor link flow minimum in indicating range R, qmaxFor link flow maximum in indicating range R, α1And α2For link flow and road
The weight coefficient of segment length, and α1+α2=1；
Path PkdWeight calculation formula be:
λ in formula (3)1And λ2Being route turning and the weight coefficient of road section length flow sum respectively, it is being handed over according to driver
The running cost in prong and section is calculated.
As a kind of preferred version, director information includes denoted object name, direction indication and distance.
As a kind of preferred version, the described position arranging fingerpost board includes the node in instruction road network and section,
By being redirected into the section of convenient road map after wherein section is entrance crossing.
Compared with prior art, technical solution of the present invention provides the benefit that:
(1) present invention considers path, the traffic flow impact on journey time, it is contemplated that by crossing band
The increase of journey time come, and combine range optimizing search method and path metric is optimized, due to range Optimizing Search
Method, while breadth first traversal road network, calculates and adjusts guided path, ensure induction path continuously up to premise
Under, improve search efficiency, faster access areas border, it is possible to get a business efficiency height, quickly and easily fingerpost
Will layout scheme, layout scheme disclosure satisfy that the in-plant careful instruction of point of interest, can meet again far-end at key road network
On emphasis guide.
(2) range Optimizing Search and double-round cladding process are combined by the present invention, distance indicates point of interest farther out when,
Outer ring instruction road network only includes higher ranked road, and when distance point of interest is nearer, inner ring instruction road network also includes relatively low etc.
The road of level, the division of double-round instruction road network makes indicating area more conform to the pathfinding custom of driver, and driver uses body
Test more preferably, have more science, it is possible to meet engineering demand.
Accompanying drawing explanation
Fig. 1 is the flow chart of a kind of fingerpost distribution method specific embodiment towards point of interest of the present invention.
Fig. 2 is the schematic diagram of the instruction road network got in the specific embodiment of the invention.
Fig. 3 is to utilize range Optimizing Search algorithm to obtain concrete to point of interest final path of all nodes in instruction road network
Flow chart.
Fig. 4 is that in instantiation of the present invention, situation schematic diagram laid by part fingerpost board.
Detailed description of the invention
Accompanying drawing being merely cited for property explanation, it is impossible to be interpreted as the restriction to this patent；
In order to the present embodiment is more preferably described, some parts of accompanying drawing have omission, zoom in or out, and do not represent actual product
Size；
To those skilled in the art, in accompanying drawing, some known features and explanation thereof may be omitted is to be appreciated that
's.
In describing the invention, except as otherwise noted, " multiple " are meant that two or more.
With embodiment, technical scheme is described further below in conjunction with the accompanying drawings.
Embodiment 1
As it is shown in figure 1, be the flow chart of a kind of fingerpost distribution method specific embodiment towards point of interest of the present invention.
Seeing Fig. 1, a kind of concrete steps towards the fingerpost distribution method of point of interest of this specific embodiment include:
S101. on road net model, extract the instruction road network of point of interest；
S102. path optimization's index of guided path convenience is weighed in definition, and described path optimization index includes path length
Degree, traffic flow and intersection turning；
S103. indicate road network traversal with the secondary ordered pair of breadth First, ergodic process calculates and dynamically updates path optimization
Index, obtains the optimum guided path in instruction road network；
S104. the content that director information is set and the position that fingerpost board is set are determined according to optimum guided path.
In this specific embodiment, by extract instruction road network, with maximize guided path traveling convenience as target,
Considering path, traffic flow and intersection turning number of times, the optimizing index of path convenience is weighed in definition；With range
Preferential secondary ordered pair instruction road network travels through, and calculates and dynamically updates path optimization's index, at breadth first traversal road network
Meanwhile, calculate and adjust guided path, ensure induction path continuously up on the premise of so that every paths is optimum and refers to
Lead the way footpath；According to result of calculation, determine place and the content that director information is set on instruction road network, to obtain the optimum of point of interest
Fingerpost layout scheme, reaches the laying target of science.
In step S101, the extraction of instruction road network can be carried out in the following way:
Step S1011. grade according to point of interest and road traffic simulation amount on the basis of road net model divide point of interest
Indicating range R；Wherein, in road net model, available directed graph G=(V, A) represents, V={vi| i=1,2 ..., n} is the node of G
Collection, A={aij=(vi,vj) | i, j=1,2 ..., n；vi, vj∈ V} is the segmental arc collection of G, and the segmental arc in directed graph represents actual road
A section in footpath；The division of indicating range R can obtain according to the grade of point of interest and road traffic simulation amount, specifically can be with
Point of interest D be the center of circle, radius be rpDelimiting a circle as indicating range R, radius as shown in Figure 2 is rpInside is designated as interest
Indicating range R of some D；
Step S1012. double-round cladding process extracts the instruction road network of point of interest.Extract careful road network and bone the most respectively
Distributory network, in order to point of interest D be the center of circle, radius be rcCircle cover careful road network, obtain the core indicating area G of point of interest Dc；
With radius between rcAnd rpAnnulus cover key road network and obtain the peripheral indicating area G of point of interest Dp；By core indicating area Gc
With peripheral indicating area GpClosely linking, obtains the instruction road network G of point of interest Dg.Utilize around double-round cladding process layout point of interest
Instruction road network, careful road network can either be covered, key road network can be covered again, it is achieved that carry out closely at point of interest periphery
The careful guide of distance, carries out the target of emphasis guide on peripheral key road network.
In specific implementation process, path, traffic flow and the big factor of intersection turning three are considered, therefore
Using path, traffic flow and intersection turning as the optimizing index of guided path convenience.In instruction road network, node
The path P of k to node dkd={ vk,…vh,(vh,vi),vi,(vi,vj),vj,…vdRepresent, wherein, vk、vh、vi、vdRepresent
Node in instruction road network, (vi,vj) represent node i to node j section, section (vi,vj) a length of lij, flow is qij；
By section (vh,vi) enter crossing viArrive section (vi,vj) turn to as t (vi), path PkdWeight W (vk,vd) etc.
All of section weight and plus route turning weighted sum on path；When traveling through instruction road network with the order of breadth First, with
Minimizing path weight value value is optimization aim, dynamically updates path optimization's index, and in acquisition double-round, each crossing node is to emerging
The optimal path of interest point, wherein, dynamically updates path optimization's index and refers to: update is the father node of node every time, and more
New postjunction diminishes to the weighted value of point of interest.
Wherein, route turning weighted sum is calculated by equation below:
T(Pkd)=fl×Tl(Pkd)+fr×Tr(Pkd)+fs×Ts(Pkd)+fu×Tu(Pkd) (1)
T in formula (1)l(Pkd)、Ts(Pkd)、Tr(Pkd)、Tu(Pkd) represent path P respectivelykdUpper left-hand rotation, keep straight on, turn right, turn around
Number of times, fl、fs、fr、fuRepresenting left-hand rotation, the weight coefficient kept straight on, turn right, turn around respectively, each weight coefficient can be according to elder generation
Test knowledge to set, be f as four weights turned to order from big to small can be definedu、fl、fr、fs, the weight i.e. turned around is
Greatly, the weight of craspedodrome is minimum.
Section weight and being calculated by equation below:
Section (the v of formula (2)i,vj) weight w (vi,vj) it is normalized weight, it comprises two parts, wherein
For normalization road section length, lijFor section (vi,vj) road section length, lminFor minimal path segment length in indicating range R, lmaxFor
Maximum road section length in indicating range R；For normalization link flow, qijFor section (vi,vj) link flow,
qminFor link flow minimum in indicating range R, qmaxFor link flow maximum in indicating range R, α1And α2For link flow and road
The weight coefficient of segment length, and α1+α2=1；
Path PkdWeight calculation formula be:
λ in formula (3)1And λ2Being route turning and the weight coefficient of road section length flow sum respectively, it is being handed over according to driver
The running cost in prong and section is calculated.
In specific implementation process, range Optimizing Search algorithm is utilized to obtain in instruction road network all nodes to point of interest
The idiographic flow of rear path can be as shown in Figure 3.
First definition node vkAttribute five-tuple, { fp(vk),t(fp(vk)),W(fp(vk),vd),w(vk,fp(vk)),W
(vk,vd)}；
Wherein fp(vk) represent vkFather node；
t(fp(vk)) represent at node fp(vk) place, node vkWith its father node fp(vkSegmental arc (v between)k,fp(vk))
Relative to fp(vk) and ancestral's node (father node of father node) fp(fp(vk)) between segmental arc (fp(vk),fp(fp(vk))) turn
To；
W(fp(vk),vd) represent vkFather node fp(vk) to indicating node vdThe weights in path；
w(vk,fp(vk)) it is vkTo father node fp(vk) weights in section, W (vk,vd) represent vkTo start node vdPath
Weights, hence it is evident that have W (vk,vd)=W (fp(vk),vd)+λ1×fi+λ2×w(vk,fp(vk)), wherein fiDesirable according to t (fp
(vk)) value, take f respectivelyl、fs、fr、fu。
Seeing Fig. 3, in dynamic calculation instruction road network, the method for optimum guided path can realize by below scheme:
1) initialize: newly-built three nodes list FList, PList and TList, FList is all knots in indicating range R
Point list, PList represents optimal path list, and TList represents traversal of lists, and the initial value of PList is start node vd, TList
Initial value is vdNeighborhood of nodes from direct north be respectively clockwiseWherein n represents vdNeighborhood of nodes
Number；
2) weight W (v in TList is takenk,vd) the node v of minimak, vkAdd PList；
3) from FList, v is obtainedkNeighborhood of nodes
4) determine whether i < n, the most then enter 5)；If it is not, then enter 9)；
5) judgeWhether in PList, the most then i=i+1, enter 4)；If it is not, enter 6)；
6)Whether in TList, if it is not, enter 7)；The most then enter 8)；
7) calculate'sWithAnd handleAdd
Enter in TList, i=i+1, enter 4)；
8) calculatePass through vkArrive vdWeightWhether haveLess than original weight
I.e. It is then to revise's WithI=i+1, enters 4)；No, i=i+1, enter 4).
9) vkRemoval TList；
10) whether TList is empty, is then to terminate；No, then return 2)；
Terminate.
According to above-mentioned flow process, it is possible to obtain optimal path list PList.
In specific implementation process, can obtain indicating any node v on road network by step S103kTo point of interest vd's
Optimal path is Pkd, then i.e. can determine whether vkWith father node fp(vk) be connected section (vk,fp(vk)) at crossing fp(vk) be
No need to arrange fingerpost board, and the content of director information: obtain vkAttribute t (fp(vk)), ifFor turning left,
Turn right or turn around, then needing at node fp(vk) place arranges fingerpost board, turn to into, instruction content is point of interest
Title.Usually, director information includes denoted object name, direction indication and distance, and the position arranging fingerpost board includes referring to
Show the node in road network and section, by being redirected into the section of convenient road map after wherein section is entrance crossing.
Below in conjunction with concrete example, above-mentioned flow process is described.
Being illustrated in figure 4 shown instruction road network, the initial value of PList is vd, the initial value of TList is { v6, v8}；Enter
Enter above-mentioned flow process 2) obtain v6Add PList；Flow process 3) obtain v6Neighborhood of nodes be vd、v9、v5、v10；Through judgement 4) and sentence
Disconnected 5) v is obtaineddIn PList, return judgement 4)；Enter judgement 5) obtain v9Not in PList, enter judgement 6) obtain v9No
In TList, calculate v9Fp(v9)、t(fp(v9))、W(fp(v9),vd)、w(v9,fp(v9)) and W (v9,vd) obtain v9Father knot
Point is v6, i.e. fp(v9)=v6, by section (v9,v6) enter crossing v6Arrive (v6, vd) turn to t (fp(v9)) for turning right,
Section (v9, v6) weights be Path P9dOptimization weights be W (v9,vd)=
W(v6,vd)+λ1×fl+λ2×w(v9,v6)；V9Add in TList, such TList={v6,v8,v9}；Return 4), start to sentence
Disconnected v5, so repeat, until TList be sky, i.e. can obtain all nodes to vdOptimum instruction path.
The node v on instruction road network as shown in Figure 43, v3Optimal path to point of interest D is P3d={ v3,(v3,v4),
v4,(v4,v5),v5,(v5,v6),v6,(v6,vd), v3Father node fp(v3)=v4, t (v4) for turning right, then at v4Crossing
(v3,v4) the fingerpost board to point of interest D advance notice turned right should be set to point on section.
In core indicating area, part fingerpost board facilities is as shown in Figure 4.In the diagram, with this method obtain from
v1To instruction node vdOptimal path be path 1{v1,(v1,v3),v3,(v3,v4),v4,(v4,v5),v5,(v5,v6),v6,
(v6,vd)}.Obviously, path 1 and path 2{v1,(v1,v3),v3,(v3,v7),v7,(v7,v12),v12,(v12,v5),v5,(v5,
v6),v6,(v6,vd) it is optimal candidate path, path 1 and path 2 similar length, but path 1 is only with through 4 crossings,
One of them is turned right, three craspedodromes；Path 2 needs through 5 crossings, a left-hand rotation, two right-hand rotations, two craspedodromes；Obviously
The crossing of path 1 process is less and proportion is gentlier kept straight on more, so path 1 is optimum.Node distance denoted object on path 1
vdPath be 2 kilometers, therefore can be at v4Place arranges fingerpost board as shown in Figure 4.
The present invention is the indicating range that the index such as the grade according to point of interest, road traffic simulation amount divides point of interest, in conjunction with road
Net topology structure, extracts the instruction road network of point of interest with double-round cladding process, to realize in the point of interest careful guide of periphery low coverage,
On peripheral key road network, emphasis guides；With maximize guided path traveling convenience as target, consider path, hand over
Through-current capacity and turn to number of times, the optimizing index of path convenience is weighed in definition；Road network is indicated to carry out with the secondary ordered pair of breadth First
Traversal, calculates and dynamically updates path optimization's index so that every paths is optimum guided path；According to result of calculation, really
Place and the content of director information are set on instruction road network surely, to obtain the optimum fingerpost layout scheme of point of interest.Pass through
The point of interest fingerpost layout scheme that the present invention obtains is a kind of scientific method, and engineer applied is had directive significance.
The corresponding same or analogous parts of same or analogous label；
Described in accompanying drawing, position relationship is used for the explanation of being merely cited for property, it is impossible to be interpreted as the restriction to this patent；
Obviously, the above embodiment of the present invention is only for clearly demonstrating example of the present invention, and is not right
The restriction of embodiments of the present invention.For those of ordinary skill in the field, the most also may be used
To make other changes in different forms.Here without also cannot all of embodiment be given exhaustive.All at this
Any amendment, equivalent and the improvement etc. made within the spirit of invention and principle, should be included in the claims in the present invention
Protection domain within.
Claims (7)
1. the fingerpost distribution method towards point of interest, it is characterised in that include
Road net model extracts the instruction road network of point of interest；
Path optimization's index of guided path convenience is weighed in definition, and described path optimization index includes path, traffic flow
Amount and intersection turning；
Traveling through instruction road network with the order of breadth First, calculate and dynamically update path optimization's index in ergodic process, acquisition refers to
Show the optimum guided path in road network；
The content that director information is set and the position that fingerpost board is set is determined according to optimum guided path.
Fingerpost distribution method towards point of interest the most according to claim 1, it is characterised in that on road net model
The instruction road network extracting point of interest specifically includes:
The grade according to point of interest and indicating range R of road traffic simulation amount division point of interest on the basis of road net model；
The instruction road network of point of interest is extracted with double-round cladding process.
Fingerpost distribution method towards point of interest the most according to claim 2, it is characterised in that use double-round cladding process
The instruction road network extracting point of interest specifically includes:
Extract careful road network and key road network respectively；
With point of interest as the center of circle, with radius as rcPreset a circle careful road network of covering and obtain the core indicating area G of point of interestc；
One is preset between core indicating area G with point of interest for the center of circlecWith the annulus between indicating range R covers key road network
Obtain the peripheral indicating area G of point of interestp；
By core indicating area GcWith peripheral indicating area GpClosely linking, obtains point of interest instruction road network Gg。
Fingerpost distribution method towards point of interest the most according to claim 2, it is characterised in that at instruction road network
In, the path P of node k to node dkd={ vk,…vh,(vh,vi),vi,(vi,vj),vj,…vdRepresent, wherein, vk、vh、
vi、vj、vdRepresent the node in instruction road network, (vi,vj) represent node i to node j section, path PkdWeight W (vk,vd)
The all of section weight and plus route turning weighted sum equal on path；When traveling through instruction road network with the order of breadth First,
To minimize path weight value value as optimization aim, dynamically update path optimization's index, obtain each crossing node in double-round and arrive
The optimum guided path of point of interest.
Fingerpost distribution method towards point of interest the most according to claim 4, it is characterised in that route turning weights
Calculate with by equation below:
T(Pkd)=fl×Tl(Pkd)+fr×Tr(Pkd)+fs×Ts(Pkd)+fu×Tu(Pkd) (1)
T in formula (1)l(Pkd)、Ts(Pkd)、Tr(Pkd)、Tu(Pkd) represent path P respectivelykdUpper left-hand rotation, keep straight on, turn right, turn around time
Number, fl、fs、fr、fuRepresent left-hand rotation, the weight coefficient kept straight on, turn right, turn around respectively；
Section weight and being calculated by equation below:
Section (the v of formula (2)i,vj) weight w (vi,vj) it is normalized weight, it comprises two parts, whereinFor returning
One changes road section length, lijFor section (vi,vj) road section length, lminFor minimal path segment length in indicating range R, lmaxFor instruction
Maximum road section length in scope R；For normalization link flow, qijFor section (vi,vj) link flow, qminFor
Minimum link flow, q in indicating range RmaxFor link flow maximum in indicating range R, α1And α2Long for link flow and section
The weight coefficient of degree, and α1+α2=1；
Path PkdWeight calculation formula be:
λ in formula (3)1And λ2Being route turning and the weight coefficient of road section length flow sum respectively, its foundation driver is in crossing
It is calculated with the running cost in section.
6. according to the fingerpost distribution method towards point of interest described in any one of claim 1 to 5, it is characterised in that refer to
Fuse breath includes denoted object name, direction indication and distance.
7. according to the fingerpost distribution method towards point of interest described in any one of claim 1 to 5, it is characterised in that institute
State and the position of fingerpost board is set includes indicating the node in road network and section, wherein section for after entering crossing by turning
To the section entering convenient road map.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410193586.8A CN104008666B (en) | 2014-05-08 | 2014-05-08 | A kind of fingerpost distribution method towards point of interest |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410193586.8A CN104008666B (en) | 2014-05-08 | 2014-05-08 | A kind of fingerpost distribution method towards point of interest |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104008666A CN104008666A (en) | 2014-08-27 |
| CN104008666B true CN104008666B (en) | 2016-08-24 |
Family
ID=51369301
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410193586.8A Expired - Fee Related CN104008666B (en) | 2014-05-08 | 2014-05-08 | A kind of fingerpost distribution method towards point of interest |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104008666B (en) |
Families Citing this family (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104899357B (en) * | 2015-05-12 | 2018-02-13 | 中山大学 | A kind of topological data extracting method based on AutoCAD level-crossing engineering drawings |
| CN105139685B (en) * | 2015-07-24 | 2017-06-06 | 合肥工业大学 | A kind of road network evacuation planning method based on maximum flow rate heat source |
| CN110347761B (en) | 2015-09-02 | 2023-07-28 | 创新先进技术有限公司 | Method and device for determining POI layout requirements |
| CN105225014A (en) * | 2015-10-27 | 2016-01-06 | 合肥工业大学 | A kind of road network evacuating system based on the reverse of self-adaptation limit and method |
| CN105427647B (en) * | 2015-12-24 | 2017-09-29 | 青岛海信网络科技股份有限公司 | A kind of path allocation methodology and device for distinguishing Vehicular turn |
| CN108227716A (en) * | 2018-01-19 | 2018-06-29 | 广东美的智能机器人有限公司 | The paths planning method and system of mobile robot |
| CN108268039A (en) * | 2018-01-19 | 2018-07-10 | 广东美的智能机器人有限公司 | The paths planning method and system of mobile robot |
| CN109583607A (en) * | 2018-06-29 | 2019-04-05 | 张文 | Net about vehicle interconnection method, terminal device, storage medium and system |
| CN110006430B (en) * | 2019-03-26 | 2021-05-04 | 智慧航海（青岛）科技有限公司 | Optimization method of track planning algorithm |
| CN110175715B (en) * | 2019-05-24 | 2021-08-31 | 中南大学 | Scene-dependency-based method for dynamically predicting illegal walk path |
| CN112507047B (en) * | 2020-06-16 | 2024-03-26 | 中山大学 | Optimal ordered path query method based on interest point preference |
| CN112632663B (en) * | 2020-12-18 | 2024-01-16 | 广州方纬智慧大脑研究开发有限公司 | Road traffic road sign generation method, device, equipment and medium |
| CN114495561B (en) * | 2021-12-29 | 2023-11-10 | 苏州摩卡智行信息科技有限公司 | Station path guiding method, system and storage medium in intelligent networking environment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1846030A (en) * | 2003-09-04 | 2006-10-11 | 皇家飞利浦电子股份有限公司 | Road-marking system |
| CN101240527A (en) * | 2007-03-23 | 2008-08-13 | 天津国锐工程实验检测有限公司 | Method for setting traffic sign used for optimizing freeway net |
| KR20080097896A (en) * | 2007-05-02 | 2008-11-06 | 엘지전자 주식회사 | Selecting route according to traffic information |
| CN201229671Y (en) * | 2008-05-26 | 2009-04-29 | 上海澳星照明电器制造有限公司 | LED variable guidance car lane indication device |
| WO2011126215A2 (en) * | 2010-04-09 | 2011-10-13 | 고려대학교 산학협력단 | Traffic flow control and dynamic path providing system linked with real-time traffic network structure control based on bidirectional communication function-combined vehicle navigation, and method thereof |
-
2014
- 2014-05-08 CN CN201410193586.8A patent/CN104008666B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1846030A (en) * | 2003-09-04 | 2006-10-11 | 皇家飞利浦电子股份有限公司 | Road-marking system |
| CN101240527A (en) * | 2007-03-23 | 2008-08-13 | 天津国锐工程实验检测有限公司 | Method for setting traffic sign used for optimizing freeway net |
| KR20080097896A (en) * | 2007-05-02 | 2008-11-06 | 엘지전자 주식회사 | Selecting route according to traffic information |
| CN201229671Y (en) * | 2008-05-26 | 2009-04-29 | 上海澳星照明电器制造有限公司 | LED variable guidance car lane indication device |
| WO2011126215A2 (en) * | 2010-04-09 | 2011-10-13 | 고려대학교 산학협력단 | Traffic flow control and dynamic path providing system linked with real-time traffic network structure control based on bidirectional communication function-combined vehicle navigation, and method thereof |
Non-Patent Citations (2)
| Title |
|---|
| 城市道路交通指路标志智能设计系统的研究与实现;唐良;《中国博士学位论文全文数据库 工程科技Ⅱ辑》;20090915(第09期);第67-82页 * |
| 城市道路指路标志数据模型设计及应用;黄敏 等;《测绘科学技术学报》;20111231;第28卷(第6期);第454-457页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104008666A (en) | 2014-08-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104008666B (en) | A kind of fingerpost distribution method towards point of interest | |
| Gu et al. | Spatial accessibility of country parks in Shanghai, China | |
| CN103984997B (en) | Power transmission engineering addressing selection method based on GIS spatial informations | |
| CN103440780B (en) | The complicated traffic environment Route Guidance System in a kind of city based on positioning label and method | |
| CN101614551B (en) | Method and device for establishing walking network, method and device for searching path | |
| Yang et al. | An Asian model of TOD: The planning integration in Singapore | |
| CN102169637A (en) | Dynamic route guidance method oriented to urban traffic | |
| CN102245458A (en) | Route searching system, route searching server and route searching method | |
| CN106203725A (en) | Door-to-door trip route scheme personalized recommendation method based on heuristic search | |
| CN107167152A (en) | Paths planning method and device | |
| CN110378527A (en) | A kind of water station site selecting method | |
| Hasnat et al. | Developing satellite towns: a solution to housing problem or creation of new problems | |
| CN107729610B (en) | travel recommended route map generation method based on network travel notes | |
| Abdelfattah et al. | The 15-minute city as a hybrid model for Milan | |
| Chen et al. | Building a cultural heritage corridor based on geodesign theory and methodology | |
| Deng et al. | Characteristics of the spatiotemporal changes in urban agglomeration in the Guangdong–Hong Kong–Macao Greater Bay Area, China | |
| Wang et al. | Evolution of the commercial blocks in ancient Beijing city from the street network perspective | |
| CN106709599A (en) | Whole region guide maximization-based road guide sign laying method | |
| CN107403240A (en) | A kind of method, terminal and computer-readable recording medium for planning navigation way | |
| CN112036621A (en) | Method and device for setting guide marks in traffic hub | |
| CN110390144A (en) | Determination method, apparatus, equipment and the storage medium of oriented identification laying information | |
| Kramberger et al. | A heuristic approach to reduce carbon dioxide emissions | |
| Solomon | Hong Kong–aformal urbanism | |
| CN108509720A (en) | A kind of coordinate system conversion method of the subsidiary geological state switching of power pipeline | |
| CN103021165A (en) | Urban road traffic information board layout optimizing method considering road network topological attribute |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160824 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |