CN104008666A - Direction sign laying method oriented to interest points - Google Patents
Direction sign laying method oriented to interest points Download PDFInfo
- Publication number
- CN104008666A CN104008666A CN201410193586.8A CN201410193586A CN104008666A CN 104008666 A CN104008666 A CN 104008666A CN 201410193586 A CN201410193586 A CN 201410193586A CN 104008666 A CN104008666 A CN 104008666A
- Authority
- CN
- China
- Prior art keywords
- path
- interest
- point
- road network
- road
- 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
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000005457 optimization Methods 0.000 claims abstract description 26
- 239000000284 extract Substances 0.000 claims description 13
- 238000005253 cladding Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000010606 normalization Methods 0.000 claims description 6
- 230000002093 peripheral effect Effects 0.000 claims description 6
- 230000006698 induction Effects 0.000 description 5
- 238000013499 data model Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000011160 research Methods 0.000 description 4
- 238000012216 screening Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 238000010845 search algorithm Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000013461 design Methods 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 invention relates to a direction sign laying method oriented to interest points. The method includes the steps of extracting an indicating road network of the interest points on a road network model; defining path optimization indexes for measuring path guiding convenience, wherein the path optimization indexes include the path length, the traffic flow and the intersection steering; conducting traversal on the indicating road network in the breadth-first order, calculating and dynamically renewing the path optimization indexes, and obtaining the optimal guide path in the indicating road network; determining the content of set guide information and the positions of set guiding signs according to the optimal guide path. According to the direction sign laying method oriented to the interest points, influences of the path length and the traffic flow on the journey time and prolonging of the journey time caused by passing through the intersection are considered; the path index is optimized through combination with a breadth optimization search method; a direction sign laying scheme which is high in economic efficiency, fast and convenient to use can be obtained; by means of the laying scheme, the requirement for indicting the interest points in a short-distance and detailed mode can be met, and the requirement for conducting key guidance on a remote backbone road network can be met as well.
Description
Technical field
The present invention relates to traffic planninng and design field, more specifically, relate to a kind of fingerpost distribution method towards point of interest.
Background technology
In recent years Chinese society economic development is swift and violent, and urban infrastructure enters a flourish period, and particularly, as the pioneer of economic development, Urban Road enters a peak period, and a large amount of roads, exploitation new district, commercial center come into operation.As the road traffic facility of of paramount importance static path induction and traffic diverging, urban road fingerpost board is also needed badly and is upgraded upgrading.How on new traffic network, to make road user arrive quickly and easily destination, and the important topic that need to study of the shunting action that the realizes traffic flow person that is road management.The principal element that affects journey time has: path, the path magnitude of traffic flow, intersection turning etc.Therefore comprehensive path, the path magnitude of traffic flow and intersection turning situation have important practical significance to laying fingerpost board.
Present Research aspect fingerpost laying is as follows both at home and abroad now:
First, aspect fingerpost Research on Data Model, the people such as Huang Min, Sha Zhiren has proposed the road net data model to fingerpost, has proposed crossing fundamental function in model, and this function can be explained the road network topology data towards fingerpost such as the turning to of section, connected state.Huang Min has proposed three layer data models of fingerpost board: fingerpost point, fingerpost board, fingerpost item.Geography, transport information digitizing that three layers of fingerpost data model is fingerpost director information and fingerpost board provide solution.
The second, fingerpost distribution method can be divided into research object: study towards the fingerpost distribution method of crossing and towards the fingerpost distribution method of point of interest.Refer to taking crossing to be research object towards the fingerpost distribution method of crossing, the director information of the fingerpost board of crossing is divided into connectivity mark and direction signs, and set a series of directivity mark screening rule, as road according to functional stratification, draw near, by high-grade to low-grade screening directivity director information.The fingerpost board setting that is applicable to crossing of the method, forms regional guide but cannot make the fingerpost of adjacent crossing be together in series, and guides the continuous accessibility of object to be difficult to ensure.Towards the fingerpost distribution method of point of interest taking point of interest as guiding object, be starting point from specific gateway, cook up a fast and convenient fingerpost board wiring path, this method has met the function of the path induction of fingerpost to a certain extent, and ensure to guide the continuous accessibility of object, but the method is only applicable to the Way guidance of point-to-point, be difficult to meet regional guide.
Above-mentioned distribution method is mainly induced the fingerpost distribution method in path towards the wall scroll of single crossing or single point of interest, the screening of director information can be considered the feature of road attribute and point of interest, but the length in path is only considered to induce in induction path, all do not consider the impact on journey time on the magnitude of traffic flow and intersection turning, and cannot meet the fingerpost laying demand towards point of interest in appointed area.
Summary of the invention
The present invention is at least one defect (deficiency) overcoming described in above-mentioned prior art, and a kind of fingerpost distribution method towards point of interest that considers path, the path magnitude of traffic flow and three factors of intersection turning is provided.
For solving the problems of the technologies described above, technical scheme of the present invention is as follows:
Towards a fingerpost distribution method for point of interest, comprise
On road net model, extract 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 comprises path, the magnitude of traffic flow and intersection turning;
With the inferior ordered pair indicating road net traversal of breadth First, calculate and dynamically update path optimization's index, obtain the optimum guided path in instruction road network;
Determine the content that director information is set and the position that fingerpost board is set according to optimum guided path.
As a kind of preferred version, the indicating road netting gear body that extracts point of interest on road net model comprises:
On the basis of road net model, divide the indicating range R of point of interest according to the grade of point of interest and traffic traffic attraction;
Extract the instruction road network of point of interest with two circle cladding process.
As further preferred version, the indicating road netting gear bodies that extract points of interest with pair circle cladding process comprise:
Extract respectively the key road network in the careful road network of inner ring and outer ring;
Taking point of interest as the center of circle, taking radius as r
ca default careful road network of circle covering obtains the core indicating area G of point of interest
c;
Preset one between core indicating area G taking point of interest as the center of circle
cand annulus between indicating range R covers key road network and obtains the peripheral indicating area G of point of interest
p;
By core indicating area G
cwith peripheral indicating area G
pseamless tight linking, obtains point of interest instruction road network G
g.
As further preferred version, in instruction road network, node k is to the path P of node d
kd={ v
k... v
h, (v
h, v
i), v
i, (v
i, v
j), v
j... v
drepresent, wherein, v
k, v
h, v
i, v
drepresent the node in instruction road network, (v
i, v
j) represent the node i section to node j, path P
kdweights W (v
k, v
d) equal section weights all on path and add route turning weighted sum; During with the order traversal instruction road network of breadth First, to minimize path weight value value as optimization aim, dynamically update path optimization's index, obtain in two circles each crossing node to the optimal path of point of interest.
As preferred version further, route turning weighted sum is calculated by following formula:
T(P
kd)＝f
l×T
l(P
kd)+f
r×T
r(P
kd)+f
s×T
s(P
kd)+f
u×T
u(P
kd) (1)
T in formula (1)
l(P
kd), T
s(P
kd), T
r(P
kd), T
u(P
kd) represent respectively path P
kdupper left-hand rotation, craspedodrome, the number of times of turning right, turning around, f
l, f
s, f
r, f
uthe weighting coefficient of represent to turn left respectively, keeping straight on, turn right, turning around;
Section weight and calculating by following formula:
Section (the v of formula (2)
i, v
j) weight w (v
i, v
j) be normalized weight, it comprises two parts, wherein
for normalization road section length, l
ijfor section (v
i, v
j) road section length, l
minfor minimal path segment length in indicating range R, l
maxfor maximum road section length in indicating range R;
for normalization link flow, q
ijfor section (v
i, v
j) link flow, q
minfor minimum link flow in indicating range R, q
maxfor maximum link flow in indicating range R, α
1and α
2for the weighting coefficient of link flow and road section length, and α
1+ α
2=1;
Path P
kdweight calculation formula be:
λ in formula (3)
1and λ
2be respectively route turning and road section length flow and weighting coefficient, it calculates at the running cost in crossing and section according to driver.
As a kind of preferred version, director information comprises denoted object name, direction indication and distance.
As a kind of preferred version, the described position that fingerpost board is set comprises node and the section of instruction in road network, and wherein section is to enter behind crossing by turning to enter the section in convenient path.
Compared with prior art, the beneficial effect of technical solution of the present invention is:
(1) the present invention has considered path, the impact of the magnitude of traffic flow on journey time, consider again the increase of the journey time of bringing by crossing, and in conjunction with range optimizing search method, path index is optimized, because range optimizing search method is in breadth First traversal road network, calculate and adjust guided path, ensureing under the prerequisite that induction path can reach continuously, improve search efficiency, faster access areas border, can get a business efficiency high, fingerpost layout scheme quickly and easily, layout scheme can meet the in-plant careful instruction of point of interest, the emphasis on key road network that can meet again far-end guides.
(2) the present invention combines range Optimizing Search and two circle cladding process, when distance instruction point of interest is far away, outer ring instruction road network only comprises the road that higher grade, when nearer apart from point of interest, inner ring instruction road network also comprises the road of lower grade, and the division of two circle instruction road networks makes indicating area more meet driver's pathfinding custom, and driver's experience is better, have more science, can meet engineering demand.
Brief description of the drawings
Fig. 1 is the process flow diagram 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 that gets in the specific embodiment of the invention.
Fig. 3 utilizes range Optimizing Search algorithm to obtain in instruction road network all nodes to the particular flow sheet of point of interest final path.
Fig. 4 is that in instantiation of the present invention, part fingerpost board is laid situation schematic diagram.
Embodiment
Accompanying drawing, only for exemplary illustration, can not be interpreted as the restriction to this patent;
For better explanation the present embodiment, some parts of accompanying drawing have omission, zoom in or out, and do not represent the size of actual product;
To those skilled in the art, in accompanying drawing some known features and explanation thereof may to omit be understandable.
In description of the invention, except as otherwise noted, the implication of " multiple " is two or more.
Below in conjunction with drawings and Examples, technical scheme of the present invention is described further.
Embodiment 1
As shown in Figure 1, be the process flow diagram of a kind of fingerpost distribution method specific embodiment towards point of interest of the present invention.Referring to Fig. 1, the concrete steps of a kind of fingerpost distribution method towards point of interest of this specific embodiment comprise:
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 comprises path, the magnitude of traffic flow and intersection turning;
S103. with the inferior ordered pair indicating road net traversal of breadth First, in ergodic process, calculate and dynamically update path optimization's index, obtaining the optimum guided path in instruction road network;
S104. determine the content that director information is set and the position that fingerpost board is set according to optimum guided path.
In this specific embodiment, indicate road network by extraction, taking the convenience of travelling that maximizes guided path as target, consider path, the magnitude of traffic flow and intersection turning number of times, the optimization index of path convenience is weighed in definition; Inferior ordered pair indicating road net with breadth First travels through, calculate and dynamically update path optimization's index, in breadth First traversal road network, calculate and adjust guided path, ensureing, under the prerequisite that induction path can reach continuously, to make every paths be optimum guided path; According to result of calculation, determine that indicating road arranges place and the content of director information on the net, to obtain the optimum fingerpost layout scheme of point of interest, reach the laying target of science.
In step S101, the extraction of instruction road network can be carried out in the following way:
Step S1011. divides the indicating range R of point of interest on the basis of road net model according to the grade of point of interest and traffic traffic attraction; Wherein, in road net model, available digraph G=(V, A) represents, V={v
i| i=1,2 ..., n} is the nodal set of G, A={a
ij=(v
i, v
j) | i, j=1,2 ..., n; v
i, v
j∈ V} is the segmental arc collection of G, and the segmental arc in digraph represents a section in Actual path; The division of indicating range R can obtain according to the grade of point of interest and traffic traffic attraction, specifically can be taking point of interest D as the center of circle, radius is as r
pdelimit a circle as indicating range R, radius is as shown in Figure 2 r
pinside is designated as the indicating range R of point of interest D;
Step S1012. extracts the instruction road network of point of interest with two circle cladding process.Specifically extracting respectively careful road network and key road network, is that the center of circle, radius are r in order to point of interest D
ccircle cover careful road network, obtain the core indicating area G of point of interest D
c; With radius between r
cand r
pannulus cover key road network and obtain the peripheral indicating area G of point of interest D
p; By core indicating area G
cwith peripheral indicating area G
pclosely be connected, obtain the instruction road network G of point of interest D
g.Utilize two circle cladding process layout points of interest instruction road network around, can either cover careful road network, can cover again key road network, realized at point of interest periphery and carried out in-plant careful guide, the target of carrying out emphasis guide on the key road network in periphery.
In specific implementation process, path, the magnitude of traffic flow and the large factor of intersection turning three are considered, the therefore optimization index using path, the magnitude of traffic flow and intersection turning as guided path convenience.In instruction road network, node k is to the path P of node d
kd={ v
k... v
h, (v
h, v
i), v
i, (v
i, v
j), v
j... v
drepresent, wherein, v
k, v
h, v
i, v
drepresent the node in instruction road network, (v
i, v
j) represent the node i section to node j, section (v
i, v
j) length be l
ij, flow is q
ij; By section (v
h, v
i) enter crossing v
iarrive section (v
i, v
j) turn to (the v for t
i), path P
kdweights W (v
k, v
d) equal section weights all on path and add route turning weighted sum; While indicating road network with the order traversal of breadth First, to minimize path weight value value as optimization aim, dynamically update path optimization's index, obtain in two circles each crossing node to the optimal path of point of interest, wherein, dynamically updating path optimization's index refers to: what upgrade is the father node of node at every turn, and renewal postjunction diminishes to the weighted value of point of interest.
Wherein, route turning weighted sum is calculated by following formula:
T(P
kd)＝f
l×T
l(P
kd)+f
r×T
r(P
kd)+f
s×T
s(P
kd)+f
u×T
u(P
kd) (1)
T in formula (1)
l(P
kd), T
s(P
kd), T
r(P
kd), T
u(P
kd) represent respectively path P
kdupper left-hand rotation, craspedodrome, the number of times of turning right, turning around, f
l, f
s, f
r, f
uthe weighting coefficient of represent to turn left respectively, keeping straight on, turn right, turning around, each weighting coefficient can be set according to priori, is f as defined four weights that turn to order from big to small
u, f
l, f
r, f
s, the weight maximum turning around, the weight minimum of craspedodrome.
Section weight and calculating by following formula:
Section (the v of formula (2)
i, v
j) weight w (v
i, v
j) be normalized weight, it comprises two parts, wherein
for normalization road section length, l
ijfor section (v
i, v
j) road section length, l
minfor minimal path segment length in indicating range R, l
maxfor maximum road section length in indicating range R;
for normalization link flow, q
ijfor section (v
i, v
j) link flow, q
minfor minimum link flow in indicating range R, q
maxfor maximum link flow in indicating range R, α
1and α
2for the weighting coefficient of link flow and road section length, and α
1+ α
2=1;
Path P
kdweight calculation formula be:
λ in formula (3)
1and λ
2be respectively route turning and road section length flow and weighting coefficient, it calculates at the running cost in crossing and section according to driver.
In specific implementation process, utilize range Optimizing Search algorithm obtain instruction road network in all nodes can be as shown in Figure 3 to the idiographic flow of point of interest final path.
First define node v
kattribute five-tuple, { f
p(v
k), t (f
p(v
k)), W (f
p(v
k), v
d), w (v
k, f
p(v
k)), W (v
k, v
d);
Wherein f
p(v
k) expression v
kfather node;
T (f
p(v
k)) be illustrated in node f
p(v
k) locate node v
kwith its father node f
p(v
k) between segmental arc (v
k, f
p(v
k)) with respect to f
p(v
k) and ancestral's node (father node of father node) f
p(f
p(v
k)) between segmental arc (f
p(v
k), f
p(f
p(v
k))) turn to;
W (f
p(v
k), v
d) expression v
kfather node f
p(v
k) to instruction node v
dthe weights in path;
W (v
k, f
p(v
k)) be v
kto father node f
p(v
k) weights in section, W (v
k, v
d) expression v
kto start node v
dthe weights in path, obviously have W (v
k, v
d)=W (f
p(v
k), v
d)+λ
1× f
i+ λ
2× w (v
k, f
p(v
k)), wherein f
idesirable according to t (f
p(v
k)) value, get respectively f
l, f
s, f
r, f
u.
Referring to Fig. 3, in dynamic calculation instruction road network, the method for optimum guided path can realize by following flow process:
1) initialization: newly-built three node list FList, PList and TList, FList is all node lists in indicating range R, and PList represents optimal path list, and TList represents traversal of lists, and the initial value of PList is start node v
d, TList initial value is v
dneighborhood of nodes from direct north clockwise direction be respectively
wherein n represents v
dthe number of neighborhood of nodes;
2) get weights W (v in TList
k, v
d) the node v of minimum value
k, v
kadd PList;
3) from FList, obtain v
kneighborhood of nodes
4) judged whether i<n, if so, entered 5); If not, enter 9);
5) judgement
whether in PList, if so, i=i+1, enters 4); If not, enter 6);
6)
whether, in TList, if not, enter 7); If so, enter 8);
7) calculate
's
with
and
add in TList, i=i+1, enters 4);
8) calculate
pass through v
karrive v
dweight
whether have
be less than original weight
Be, amendment
's
with
i=i+1, enters 4); No, i=i+1, enters 4).
9) v
kshift out TList;
10) whether TList is empty, is to finish; No, return to 2);
Finish.
According to above-mentioned flow process, the optimal path list PList that can obtain.
In specific implementation process, can obtain the online any node v of indicating road by step S103
kto point of interest v
doptimal path be P
kd, can judge so v
kwith father node f
p(v
k) connected section (v
k, f
p(v
k)) at crossing f
p(v
k) whether need fingerpost board is set, and the content of director information: obtain v
kattribute t (f
p(v
k)), if
for turning left, turning right or turn around, need to be at node f
p(v
k) locate to arrange fingerpost board, turn to into
, the title that instruction content is point of interest.Usually, director information comprises denoted object name, direction indication and distance, and the position that fingerpost board is set comprises node and the section in instruction road network, and wherein section is to enter behind crossing by turning to enter the section in convenient path.
Below in conjunction with concrete example, above-mentioned flow process is described.
Instruction road network shown in being illustrated in figure 4, the initial value of PList is v
d, the initial value of TList is { v
6, v
8; Enter above-mentioned flow process 2) obtain v
6add PList; Flow process 3) obtain v
6neighborhood of nodes be v
d, v
9, v
5, v
10; Through judging 4) and judge 5) obtain v
din PList, return and judge 4); Enter and judge 5) obtain v
9not in PList, enter and judge 6) obtain v
9not in TList, calculate v
9f
p(v
9), t (f
p(v
9)), W (f
p(v
9), v
d), w (v
9, f
p(v
9)) and W (v
9, v
d) obtain v
9father node be v
6, i.e. f
p(v
9)=v
6, by section (v
9, v
6) enter crossing v
6arrive (v
6, v
d) turn to t (f
p(v
9)) for turning right, section (v
9, v
6) weights be
Path P
9doptimization weights be W (v
9, v
d)=W (v
6, v
d)+λ
1× f
l+ λ
2× w (v
9, v
6); V
9add in TList, like this TList={v
6, v
8, v
9; Return to 4), start to judge v
5, so repeat, until TList is empty, can obtain all nodes to v
doptimum instruction path.
The online node v of indicating road as shown in Figure 4
3, v
3be P to the optimal path of point of interest D
3d={ v
3, (v
3, v
4), v
4, (v
4, v
5), v
5, (v
5, v
6), v
6, (v
6, v
d), v
3father node f
p(v
3)=v
4, t (v
4) for turning right, so at v
4(the v of crossing
3, v
4) should arrange on section and refer to the right-handed fingerpost board to point of interest D advance notice.
In core indicating area, part fingerpost board facilities as shown in Figure 4.In Fig. 4, obtain from v by this method
1to instruction node v
doptimal path be path 1{v
1, (v
1, v
3), v
3, (v
3, v
4), v
4, (v
4, v
5), v
5, (v
5, v
6), v
6, (v
6, v
d).Obviously, path 1 and path 2{v
1, (v
1, v
3), v
3, (v
3, v
7), v
7, (v
7, v
12), v
12, (v
12, v
5), v
5, (v
5, v
6), v
6, (v
6, v
d) be optimal candidate path, path 1 is close with path 2 length, but 1, path use through 4 crossings, one of them turn right, three craspedodromes; Path 2 need to be through 5 crossings, a left-hand rotation, two right-hand rotations, two craspedodromes; Obviously the crossing of path 1 process still less and proportion gentlier keep straight on more, so path 1 optimum.On path 1, node is apart from denoted object v
dpath be 2 kilometers, therefore can be at v
4place arranges fingerpost board as shown in Figure 4.
The present invention is the indicating range of dividing point of interest according to indexs such as the grade of point of interest, traffic traffic attractions, in conjunction with road network topology structure, extract the instruction road network of point of interest with two circle cladding process, to realize in the careful guide of point of interest periphery low coverage, on the key road network in periphery, emphasis guides; To maximize the convenience of travelling of guided path as target, consider path, the magnitude of traffic flow and turn to number of times, the optimization index of path convenience is weighed in definition; Inferior ordered pair indicating road net with breadth First travels through, and calculates and dynamically update path optimization's index, makes every paths be optimum guided path; According to result of calculation, determine that indicating road arranges place and the content of director information on the net, to obtain the optimum fingerpost layout scheme of point of interest.The point of interest fingerpost layout scheme obtaining by the present invention is a kind of scientific approach, and to engineering, application has directive significance.
The corresponding same or analogous parts of same or analogous label;
In accompanying drawing, describe position relationship for only for exemplary illustration, can not be interpreted as the restriction to this patent;
Obviously, the above embodiment of the present invention is only for example of the present invention is clearly described, and is not the restriction to embodiments of the present invention.For those of ordinary skill in the field, can also make other changes in different forms on the basis of the above description.Here without also giving exhaustive to all embodiments.All any amendments of doing within the spirit and principles in the present invention, be equal to and replace and improvement etc., within all should being included in the protection domain of the claims in the present invention.
Claims (7)
1. towards a fingerpost distribution method for point of interest, it is characterized in that, comprise
On road net model, extract 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 comprises path, the magnitude of traffic flow and intersection turning;
With the order traversal instruction road network of breadth First, in ergodic process, calculate and dynamically update path optimization's index, obtain the optimum guided path in instruction road network;
Determine the content that director information is set and the position that fingerpost board is set according to optimum guided path.
2. the fingerpost distribution method towards point of interest according to claim 1, is characterized in that, the indicating road netting gear body that extracts point of interest on road net model comprises:
On the basis of road net model, divide the indicating range R of point of interest according to the grade of point of interest and traffic traffic attraction;
Extract the instruction road network of point of interest with two circle cladding process.
3. want the fingerpost distribution method towards point of interest described in 2 according to right, it is characterized in that, the indicating road netting gear bodies that extract points of interest with pair circle cladding process comprise:
Extract respectively careful road network and key road network;
Taking point of interest as the center of circle, taking radius as r
ca default careful road network of circle covering obtains the core indicating area G of point of interest
c;
Preset one between core indicating area G taking point of interest as the center of circle
cand annulus between indicating range R covers key road network and obtains the peripheral indicating area G of point of interest
p;
By core indicating area G
cwith peripheral indicating area G
pclosely be connected, obtain point of interest instruction road network G
g.
4. want the fingerpost distribution method towards point of interest described in 2 according to right, it is characterized in that, in instruction road network, node k is to the path P of node d
kd={ v
k... v
h, (v
h, v
i), v
i, (v
i, v
j), v
j... v
drepresent, wherein, v
k, v
h, v
i, v
drepresent the node in instruction road network, (v
i, v
j) represent the node i section to node j, path P
kdweights W (v
k, v
d) equal section weights all on path and add route turning weighted sum; During with the order traversal instruction road network of breadth First, to minimize path weight value value as optimization aim, dynamically update path optimization's index, obtain in two circles each crossing node to the optimal path of point of interest.
5. want the fingerpost distribution method towards point of interest described in 4 according to right, it is characterized in that, route turning weighted sum is calculated by following formula:
T(P
kd)＝f
l×T
l(P
kd)+f
r×T
r(P
kd)+f
s×T
s(P
kd)+f
u×T
u(P
kd) (1)
T in formula (1)
l(P
kd), T
s(P
kd), T
r(P
kd), T
u(P
kd) represent respectively path P
kdupper left-hand rotation, craspedodrome, the number of times of turning right, turning around, f
l, f
s, f
r, f
uthe weighting coefficient of represent to turn left respectively, keeping straight on, turn right, turning around;
Section weight and calculating by following formula:
Section (the v of formula (2)
i, v
j) weight w (v
i, v
j) be normalized weight, it comprises two parts, wherein
for normalization road section length, l
ijfor section (v
i, v
j) road section length, l
minfor minimal path segment length in indicating range R, l
maxfor maximum road section length in indicating range R;
for normalization link flow, q
ijfor section (v
i, v
j) link flow, q
minfor minimum link flow in indicating range R, q
maxfor maximum link flow in indicating range R, α
1and α
2for the weighting coefficient of link flow and road section length, and α
1+ α
2=1;
Path P
kdweight calculation formula be:
λ in formula (3)
1and λ
2be respectively route turning and road section length flow and weighting coefficient, it calculates at the running cost in crossing and section according to driver.
6. want the fingerpost distribution method towards point of interest described in 1 to 5 any one according to right, it is characterized in that, director information comprises denoted object name, direction indication and distance.
7. want the fingerpost distribution method towards point of interest described in 1 to 5 any one according to right, it is characterized in that, the described position that fingerpost board is set comprises node and the section of instruction in road network, and wherein section is to enter behind crossing by turning to enter the section in convenient path.
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 true CN104008666A (en) | 2014-08-27 |
| CN104008666B 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) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104899357A (en) * | 2015-05-12 | 2015-09-09 | 中山大学 | Topology data extraction method based on AutoCAD plane intersection engineering drawing |
| CN105139685A (en) * | 2015-07-24 | 2015-12-09 | 合肥工业大学 | Road network evacuation planning method based on maximum flow rate path first |
| 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 |
| CN105427647A (en) * | 2015-12-24 | 2016-03-23 | 青岛海信网络科技股份有限公司 | Path distribution method and device capable of discriminating vehicle turning direction |
| CN106484748A (en) * | 2015-09-02 | 2017-03-08 | 阿里巴巴集团控股有限公司 | A kind of method and device for determining that point of interest POI lays demand |
| 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 |
| CN110006430A (en) * | 2019-03-26 | 2019-07-12 | 智慧航海（青岛）科技有限公司 | A kind of optimization method of Path Planning |
| CN110175715A (en) * | 2019-05-24 | 2019-08-27 | 中南大学 | A method of the illegal parade path dynamic prediction relied on based on scene |
| CN112507047A (en) * | 2020-06-16 | 2021-03-16 | 中山大学 | Optimal ordered path query method based on interest point preference |
| CN112632663A (en) * | 2020-12-18 | 2021-04-09 | 广州方纬智慧大脑研究开发有限公司 | Road traffic direction mark generation method, device, equipment and medium |
| CN114495561A (en) * | 2021-12-29 | 2022-05-13 | 苏州摩卡智行信息科技有限公司 | 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 |
|---|
| 唐良: "城市道路交通指路标志智能设计系统的研究与实现", 《中国博士学位论文全文数据库 工程科技Ⅱ辑》, no. 09, 15 September 2009 (2009-09-15), pages 67 - 82 * |
| 黄敏 等: "城市道路指路标志数据模型设计及应用", 《测绘科学技术学报》, vol. 28, no. 6, 31 December 2011 (2011-12-31), pages 454 - 457 * |
Cited By (21)
| 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 |
| CN104899357A (en) * | 2015-05-12 | 2015-09-09 | 中山大学 | Topology data extraction method based on AutoCAD plane intersection engineering drawing |
| CN105139685A (en) * | 2015-07-24 | 2015-12-09 | 合肥工业大学 | Road network evacuation planning method based on maximum flow rate path first |
| CN106484748B (en) * | 2015-09-02 | 2019-07-23 | 阿里巴巴集团控股有限公司 | A kind of determining point of interest POI lays the method and device of demand |
| CN106484748A (en) * | 2015-09-02 | 2017-03-08 | 阿里巴巴集团控股有限公司 | A kind of method and device for determining that point of interest POI lays demand |
| US11244237B2 (en) | 2015-09-02 | 2022-02-08 | Advanced New Technologies Co., Ltd. | Determining deployment need for point of interest |
| 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 |
| CN105427647A (en) * | 2015-12-24 | 2016-03-23 | 青岛海信网络科技股份有限公司 | Path distribution method and device capable of discriminating vehicle turning direction |
| 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 |
| CN110006430A (en) * | 2019-03-26 | 2019-07-12 | 智慧航海（青岛）科技有限公司 | A kind of optimization method of Path Planning |
| CN110175715A (en) * | 2019-05-24 | 2019-08-27 | 中南大学 | A method of the illegal parade path dynamic prediction relied on based on scene |
| CN110175715B (en) * | 2019-05-24 | 2021-08-31 | 中南大学 | Scene-dependency-based method for dynamically predicting illegal walk path |
| CN112507047A (en) * | 2020-06-16 | 2021-03-16 | 中山大学 | Optimal ordered path query method based on interest point preference |
| CN112507047B (en) * | 2020-06-16 | 2024-03-26 | 中山大学 | Optimal ordered path query method based on interest point preference |
| CN112632663A (en) * | 2020-12-18 | 2021-04-09 | 广州方纬智慧大脑研究开发有限公司 | Road traffic direction mark generation method, device, equipment and medium |
| CN112632663B (en) * | 2020-12-18 | 2024-01-16 | 广州方纬智慧大脑研究开发有限公司 | Road traffic road sign generation method, device, equipment and medium |
| CN114495561A (en) * | 2021-12-29 | 2022-05-13 | 苏州摩卡智行信息科技有限公司 | Station path guiding method, system and storage medium in intelligent networking environment |
| CN114495561B (en) * | 2021-12-29 | 2023-11-10 | 苏州摩卡智行信息科技有限公司 | Station path guiding method, system and storage medium in intelligent networking environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104008666B (en) | 2016-08-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104008666A (en) | Direction sign laying method oriented to interest points | |
| CN102081658B (en) | Hierarchical road network-based path search method and device | |
| CN101614551B (en) | Method and device for establishing walking network, method and device for searching path | |
| CN108009666B (en) | Hierarchical priority optimal path calculation method based on dynamic road network | |
| CN102169637A (en) | Dynamic route guidance method oriented to urban traffic | |
| Caggiani et al. | A real time multi-objective cyclists route choice model for a bike-sharing mobile application | |
| Lin et al. | Sustainability SI: Bikeway network design model for recreational bicycling in scenic areas | |
| Hrncir et al. | Bicycle route planning with route choice preferences | |
| JP2013050413A (en) | Navigation system, navigation program, and navigation method | |
| Chen et al. | Building a cultural heritage corridor based on geodesign theory and methodology | |
| Ding et al. | An efficient algorithm for optimal route node sensing in smart tourism Urban traffic based on priority constraints | |
| CN104574966B (en) | Variable information identity device and variable information identification method | |
| CN104331424B (en) | The purification method of sensitive trajectory model in a kind of user's motion track | |
| Zhou et al. | Smart tour route planning algorithm based on clustering center motive iteration search | |
| CN112036621A (en) | Method and device for setting guide marks in traffic hub | |
| CN107403240A (en) | A kind of method, terminal and computer-readable recording medium for planning navigation way | |
| Han et al. | Optimal layout of tourist toilets using resilience theory: An empirical study on Dunhua City in ethnic region of China | |
| CN106709599B (en) | Road direction sign layout method capable of achieving maximization based on regional overall direction | |
| Alshammari | Smart pedestrian network is an approach for promoting walkability: A case of Riyadh city | |
| Geller et al. | Implementation of Pro-Bike Policies in Portland and Seville | |
| Pei et al. | Optimization of tourism routes in Lushunkou District based on ArcGIS | |
| JP6307270B2 (en) | Route search device | |
| Madhu et al. | Evaluation of optimal route selection for public transport network routes on urban roads using Fuzzy‐TOPSIS method | |
| KR20120092361A (en) | Method and system to provide improved path search sevice | |
| Kang et al. | Extension of bus service areas using genetic algorithm |
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 |