CN101488158A - Road network modeling method based on road element - Google Patents
Road network modeling method based on road element Download PDFInfo
- Publication number
- CN101488158A CN101488158A CNA2009100461933A CN200910046193A CN101488158A CN 101488158 A CN101488158 A CN 101488158A CN A2009100461933 A CNA2009100461933 A CN A2009100461933A CN 200910046193 A CN200910046193 A CN 200910046193A CN 101488158 A CN101488158 A CN 101488158A
- Authority
- CN
- China
- Prior art keywords
- road
- node
- network
- traffic
- model
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Traffic Control Systems (AREA)
Abstract
The invention provides a road network modeling method which takes road as a fundamental element, aiming at describing a traffic network by utilizing mutual relation among the roads with substitutive characteristics of the road in the traffic network taken into account. A data model matched with a conceptual model is given on the basis of improving a road network model which takes the road as the fundamental element, and data redundancy is reduced by blending related traffic information. A path searching algorithm suitable for the road network model is proposed on the basis of the road network model, and the path searching optimization is realized by utilizing road relation and road traffic attribute.
Description
Technical field
The present invention relates to the master pattern of path planning series in a kind of intelligent transportation field, the road net model method for building up of support path traffic information inquiry and optimum route search.
Background technology
Traffic network mainly comprises two-part information, and they are spatial information and transport information.Spatial information mainly comprises the spatial positional information of each object on the road network, and the topological relation between these objects.Object on the traffic network mainly comprises entities such as road, traffic intersection and various factory, sub-district, refuelling station; Wherein factory, sub-district belong to " face " object, and road belongs to " line " object, and some other place such as traffic intersection then belong to " point " object.Transport information is the significant information on the traffic network, is the essential characteristic of traffic network.
Transport information in the traffic network mainly comprises whether allowing on the title, rank, width, design speed per hour, track quantity of road in the traffic network, current direction restriction, the road that the U type turns to, turn to static information such as restriction between the road, also comprises multidate informations such as traffic congestion situation, traffic hazard, control traffic message.These information have abundant feature, attribute and complexity, must set up the good road net model that is applicable to intelligent transportation system of a cover, to satisfy various actual needs.
Road net model not only wants to describe clear, intuitively the spatial information of road network, also want to improve the various actual traffic information of describing on the road network, the more important thing is and to support the diverse network analysis operation that intelligent transportation system requires that the efficient of these query manipulations also is the key factor of assessment road net model performance.The core of diverse network analysis operation is a route searching on the traffic network, and it is the graph model of fundamental element that current modeling to traffic network is mainly adopted with the node, and adopting with Di Jiesitela (Dijkstra) algorithm is the various path search pass of basic algorithm.
Figure 1 shows that one contains the small-sized road network at 9 roads and 15 crossings.With regard to the spatial information of traffic network, this model has comprised 9 " line " objects, 15 " point " objects, and the some spatial topotaxies that are combined to form by these objects.And the transport information of model comprises static information and multidate information two big classes, wherein: the restriction of turning between the title on road, rank, width, design speed per hour, track quantity, current direction restriction, road etc. belongs to the traffic static information, and traffic congestion situation, traffic hazard, control traffic message then belong to multidate information.
No matter being which kind of spatial network model, all is the most basic function that this model should possess to the support of network analysis operation, and in the network analysis the problem of basic most critical be shortest route problem.For traffic network, shortest path refers to that not only the distance on the general geographic significance is the shortest, can also amplify other tolerance, as: time, expense or the like.Correspondingly, shortest route problem just becomes the fastest path problem, minimum charge routing problem or the like.
Classical shortest path first dijkstra's algorithm is that present most system solves the Prototype Algorithm that shortest route problem adopts, and just different system has been adopted different implementation methods.A
*Algorithm is an a kind of heuristic shortest path first the most commonly used, and the scope that can obtain distance between them by the analysis to source point and terminal point locus is as estimated value, A
*Algorithm is exactly to utilize the heuritic approach of estimated distance as constraint condition.Search intermediate point method is decomposed into two independently search problems with search step.A search is launched by starting point, and another launches from point of destination, has finished whole search step when these two searching process are met.
There is limited evidence currently of is seen the patent of traffic network modelling and Shortest Path Searching aspect.Research in this respect rests on the periodical literature stage more.
In document " city road network in the vehicle Real-Time Scheduling and traffic descriptive model " (article numbering: 1002-0268 (2005) 05-0128-04), people such as Shi Jianjun have proposed Using geographic information system (GIS, Geographical Information System) node-segmental arc topology data model, the method that the city road network with multidate informations such as traffic controls is described.Particularly, employing road network connection matrix reflects UNICOM's information and the transport information between road, to express the intersection and to turn to control information.But because along with the increasing progressively of road number in the road network, connection matrix is too huge, upgrade and computation process very slow.And actual urban road network scale (as Shanghai) comprises nodal point number more than 100,000, and using the road network connection matrix can't be described.
In document " based on the foundation and the analysis of city digital map road network topology relational model ", people such as Peng soldier are in conjunction with the polar plot of a large amount of dwg form of city road network, the road network topology relational data model has been proposed, this model is an one with geometry topological analysis and network topology model organic combination, has formed the city road network topological relation model based on polar plot.This kind model adopts manual CAD drawing, and its degree of accuracy depends on the drawing personnel, exists the data object border indeterminate, and same target is by digitizing repeatedly or the mistake that is not digitized.And model can not provide the description that traffic such as the restriction of turning limits, and practical application is relatively poor.
In document " is applicable to the dynamic road network descriptive model of path planning system ", people such as Song Yan, Shi Jianjun has set up based on GIS node-segmental arc topology data model, by road network is changed into dual graph, successfully solved the intersection turning restricted problem that exists in the optimal path computation process.And can demarcate the right of way of antithesis chain under the different optimal objective functions.But node-segmental arc topology data model also has its weak point, because segmental arc and attribute record are one to one, because the variation of crowding on the same highway section in the road network, by dummy node complete road is divided into some highway sections, cause the data bulk redundancy, reduced the efficient of optimal path computation undoubtedly.
At Chinese patent " a kind of quick map-matching method " (application number: 200610112433.1) based on the small lattice road network institutional framework, people such as Zhu Tongyu have proposed a kind of quick map-matching method based on the small lattice road network institutional framework, this invention is owing to can directly navigate to the grid at a place, and grid is generally smaller, highway section in the grid is also just fewer, the point inquiry velocity is fast, the efficient height, no matter what grids whole road network has been divided into, the required grid of searching of algorithm has only fixing 9, calculates simple.But in this invention, the division of grid is a difficult point, and grid dividing is excessive, just can't accurately locate, and grid dividing is too small, and then the data-storing amount is big, and divides the meticulous original intention of running counter to invention itself.This invention only is applicable to a little location, can't provide optimal path inquiry etc. all multi-functional.
(application number: 200510110549.7), Qian Hong's ripple has proposed a kind of control method that can improve traffic intersection capacity and road network capacity at Chinese patent " a kind of new city road network and crossing traffic design and traffic control method ".Its juche idea is to utilize the road network of master periphery to form a microcirculation to finish the task that turns on all directions; Adopt means such as no left turn, one-way traffic to simplify the traffic conflict of crossing, improve the traffic capacity of crossing; Utilize " green ripple " traffic (promptly, to allow the major trunk roads wagon flow block by nothing as far as possible, improve the vehicle handling capacity by the Based Intelligent Control means.) minimizing stop frequency and traffic delay.This scheme has higher efficient than traditional sparse, chaotic road network design proposal, but is not applied to as yet at present in the reality, can not reach an agreement with the actual traffic road net model, can't support actual route planning, only can be used for theoretical research.
The traffic network model of mentioning in above patent or the article all is based on node-segmental arc topology data model of GIS.Model building method both increased road net model complexity, strengthened the data volume of physical model, reduced space search efficient simultaneously again to this model, fundamentally influence the efficient of intelligent transportation system operation.
Summary of the invention
At the deficiency of above-mentioned technology, the present invention proposes a kind of is road network (RB) modeling method of fundamental element with the road, and this method utilizes the overlapping relation between road to describe traffic network at the essential characteristic of road in the traffic network.Improving with the road is on the basis of road net model of fundamental element, has provided the data model that is complementary with conceptual model, has reduced data redundancy by merging relevant transport information.On the basis of road net model, propose the path search algorithm that adapts with it, utilized relation and the optimizing of road traffic attribute realizing route between the road.
Method of the present invention is:
Step 1: set up the road network spatial model;
Step 2: set up the road net data model.
The establishment step of described road network spatial model is:
Step 1-1; Open Mapinfo 7.0, newdata table a selects to open new browser Open new Brower and open new map Open new Mapper two options simultaneously;
Step 1-2; Each field of table a is set, the traffic attribute of the corresponding road of each field;
Step 1-3; Add the real electronic chart in certain zone in this new map, make it visual; A newly-built figure layer, and select " broken line or straight line " object by the trend of road of the reality spatial object that draws, simultaneously, is filled in each traffic attribute of this road on map;
Step 1-4; Press category of roads and divide, divide several figure layers to store respectively the road object, so that the road relation of research figure interlayer;
Step 1-5; To all scheme integrated being saved in the space of layer at last, just form the spatial model of traffic network.
The establishment step of described road net data model is:
Step 2-1; In the Access database, newly-built road Road table is provided with each field with field among the table a;
Step 2-2; A newly-built road relation table Roadrelation is provided with following field respectively: main stem road ID, initial road ID, stop road ID, road section length, turn to restricted information.
The step of method for searching shortest route is:
Advantage of the present invention is, from the understanding of people to road network, catches the essential characteristic of traffic network, has certain advantage expressing on the road information;
The object that the modeling method that invention provides need be handled will greatly have been simplified the data model complexity much smaller than the conventional node model.
Having made full use of the position heuristic information, greatly searched solution space little, and can not omit optimum solution, is a kind of effective algorithm.
Searching method provided by the invention is applicable to the actual road network of various scales, can obtain optimal result fast, and solution procedure is stable.
Modeling method provided by the invention can be carried out digitized processing to any one city, makes things convenient for the user to set up spatial model, can be widely used in intelligent transportation field.In a word, the invention provides practicable urban road network modeling method and optimum route search algorithm, the proposition of this model has certain reference value to the theoretical research that concerns between line and the line, and the raising of traffic network modeling in China's intelligent transportation field and path planning level is had important directive significance.
Description of drawings
Fig. 1 is a small-sized road network example schematic.
Fig. 2 is that the Shanghai City outer shroud is with interior each main trunk road traffic network synoptic diagram.
Fig. 3 is based on the data organization graph of a relation of road network in the road net model of road element.
Fig. 4 route searching fructufy illustration of the present invention.
Fig. 5 is the overall A with traffic restriction
*The searching algorithm process flow diagram.
Embodiment
Please referring to shown in the accompanying drawing 1, be one to contain the small-sized road network at 9 roads and 15 crossings, the master data in its RB model can be expressed as tables of data as shown in table 1, wherein first classifies road as, is called the M road; Second classifies the source point O on M road shown in first row as; The 3rd row begin to be the road that intersects with M road shown in first row, be called the Li road (i=1,2 ...); Last valid data of each row are the terminal point E on M road shown in first row.In fact, the representative of the Li road in the table 1 is intersected the crossing that forms with the M road.Near more apart from the source point O on M road with the Li road that intersect on same M road, the record in table 1 is near more from O.If two or above road are arranged, intersect at same crossing and same M road as Li road and Lj road, then the priority that occurs in table of Li road and Lj road is unaffected.
1 table of listing 1 is as follows with reference to the accompanying drawings:
Table 1 pair Fig. 1 road network example adopts the road relation table of road network modeling method of the present invention.
In fact table 1 has described road in the road network and mutual relation thereof.Also stipulated simultaneously the positive dirction of every road, promptly source point O is to the direction of terminal point E.Lifting the R1 road is example, R5-R1-the enforcement direction of R8 is R1 road positive dirction, and and R9-〉 R1-R6 is the negative direction of R1 road.The positive negative direction of variable record road is set, promptly realizes the traffic restriction in road single-double-row road.And when turning, eight kinds of two vectors of the question resolves itself into are arrived relation in the intersection, whether this two vector can reach on the relevant variable record space by being provided with, and finishes the turning restriction of road net model.
Road network spatial model of the present invention is finished by means of the MapInfo7 function software.MapInfo Professional 7.0 (be called for short Mapinfo7) is the most complete, powerful in the world at present, desktop map infosystem comprehensively and intuitively, can show under same environment, and disclose relation between Drawing Object and the data rapidly.It is related to make things convenient for the user to set up between the different data in database, improves operation efficiency.Particularly, the present invention has selected for use actual Shanghai City outer shroud with interior whole major trunk roads, highway, and part inferior grade road, and totally 517 roads adopt the layering stacked system to make up road net model.Actual visible Fig. 2 of road network spatial model.
After the spatial model of having set up road network, further set up the data model of road network, utilize relevant database Access to organize counter structure, come topological relation and other transport information of correct storage space object.Among the present invention, get a tables of data a, be specifically designed to the essential information of storage road element, comprising: the title of road, the grade of road, link length, speed limit, have or not traffic restriction etc.Get a tables of data b, be used for writing down the topological relation of each bar road, reach road section length and turn to information such as limiting indication.The Spatial Data Model structure can be referring to Fig. 3, symbol among the figure
It between presentation-entity the corresponding relation more than 1 pair; In like manner,
1 pair 1 corresponding relation between presentation-entity.This data model has 8 square frames from top to bottom from left to right.Fig. 3 center 1 is the road network table, the relation between describing road and road being connected; Frame 2 is a path information table, is storing the essential information such as title, grade, length, speed limit of road; Frame 3 is the road synthetic information table, is the core of whole road net data model; Frame 4 is the road relation table, and the topology that is writing down between road connects; Frame 5 is the road curve segment table, describes getting in touch between highway section and the flex point; Frame 6 is flex point information tables, has write down the coordinate figure of road crossbar contact; Frame 7 is transport information lists of elements, is writing down the current cost of changing the road.Frame 8 is the transport information matrix table, is describing getting in touch of intersection and current cost information.
Road is the fundamental element based on the road element road net model that the present invention proposes, and road relation is its core element, and the present invention sets the relation between other roads in a road and the traffic network that illustrates by setting up a road relation.
At first introduce definition and the character of road relational tree.
The road relation tree is the multiway tree structure that concerns between the road in the reflection traffic network, and each node in the road relation tree is represented a road, and wherein root node is represented initial road.Comprise reachability relation between node and its child node in the road relation tree, represent that the road of this node representative can change the road of Lu Zhiqi child node representative, reachability relation points to leaf node from root node.Because exist on the road direction and change the restriction that the road turns to different roads, whether the road of child node representative can change the road of Lu Zhiqi father node representative can not be determined.Finish after the structure of road relation tree, the road that has promptly obtained the root node representative in the road network other whole roads reach the road mode of changing.
The corresponding road of each node for finishing route searching, need be provided with its base attribute in the road relation tree, and is specific as follows:
Node call number (intNode_index): be used for symbol string form retrieval node information;
The node number of plies (intNode_level): be used to describe the residing search hierarchical position of node, also promptly process change the road number of times.Node level as root node is 0.If a certain node level is i, then represent from the road of root node representative, change the road that the road can arrive this node representative through i time;
Node ID number (intNode_Road_ID): but the critical item of this node of unique identification, and its value is the numbering of corresponding road;
Parent node index number (intNode_Parent_index): its value is the numbering of this node father road;
Current node is apart from the node distance value (sinNode_length) that starts: be used for writing down the start value that expends of road node accumulative total of this node distance;
Current node is apart from purpose node estimated value (Fnode_length): be used for estimating the shortest path length through this node;
Leaf node sign (bolNode_leaf): be a Boolean variable value, be used for judging whether a road node is the leaf node of road tree, value is 0 represent nonleaf node, and being 1 is leaf node.
Finish child node and add (bolNode_Add): be a Boolean variable value, be used to judge whether to have added whole child nodes of one circuit node.If being 0 representative, this value do not finish interpolation as yet, if this value is the interpolation that whole child nodes have been finished in 1 representative.
Storage for the road relation tree can be adopted sequential storage structures such as chained list or array, at first answer initialization storage organization and memory allocated space when setting up the road relation tree, set up root node subsequently and add in-tree, then according to whether directly reaching, root node is added child node, repetition according to whether directly reaching the work of adding node, is finished up to the road relation tree in road relation.
Shortest Path Searching Algorithm adopts heuristic search algorithm A among the present invention
*Algorithm, its algorithm flow chart is seen Fig. 5.Accompanying drawing frame 1 is the algorithm initialization operational module; Accompanying drawing frame 2 is finished screening operation, selects and waits to investigate the node that has minimum weights in the road set; Accompanying drawing frame 3 is finished the follow-up node work that launches current minimum weights node; Accompanying drawing frame 4 functions only are to finish the road node work in the shoofly set that takes out in turn; Accompanying drawing frame 5 functions are to handle the restriction matters of turning; The road that accompanying drawing frame 6 will newly detect adds waits to investigate the road set, is the ready work of search next time.
Specific algorithm is described below: (establishing strroad is initial road, and Openlist table, Closelist table and Templist table all are the data acquisitions that are used to preserve the road tree)
(1) initial work: Openlist table, Closelist table and Templist table are emptied, initial road strroad is added in the Openlist table;
(2) judge whether the Openlist table is empty:
Be sky, then do not find the purpose road, algorithm is withdrawed from the algorithm failure;
Non-NULL is selected the node that has minimum F value (actual distance that F value=strroad point arrives current road spends the estimated value S of G value+current road node apart from purpose road node) in the current Openlist table.
(3) whether the road node of electing in the determining step (2) is the purpose road:
Be, then searched the purpose road, in the Closelist table, carry out backward successively and search father node, until searching the strroad road, the output shortest path;
Not, this node is added in the Closelist table, examine or check the whole child nodes that link to each other of node therewith, they are added in the Templist table.
(4) judge whether current Templist table is empty:
Be sky, then forward step (2) to and carry out;
Non-NULL then shifts out road node in the Templist table, might as well get first node, and number of elements subtracts one in the Templist table simultaneously.
(5) whether the road node of selecting in the determining step (4) appears in Openlist table or the Closelist table:
Be that then algorithm forwards in (4) and carries out;
, algorithm does not jump in the step (6) and carries out.
(6) inquire about grandfather and great grandfather's node of this node, calculate great grandfather respectively, and the grandfather is to the enforcement direction of the road segment segment of father's node, and then the inquiry restriction of turning is shown to grandfather's node road segment segment
(7) judge to turn whether be under an embargo:
Be that the direct rebound step of algorithm (4) continues to judge;
Not, calculate node F value, and write down its father node ID and other road attribute informations, it is joined in the Openlist table, algorithm forwards in the step (4) and carries out.
Be example with spatial model shown in Figure 1 below,, specify the building process of data model by setting up data model for it.Table 1 is a kind of simple description of corresponding diagram 1 road network, and each line item in the table 1 represents that with a certain road be main road, with the crossing in proper order annexation of other roads.Record in the his-and-hers watches 1, we split into N subrecord (N is the number that main stem road and other auxilliary roads intersect), as the road R1 among Fig. 1, the road that intersects with its has R5, R6, R8 and R9 respectively, totally 4 roads, promptly this moment N=4.We store this 4 records by the crossing order of the positive dirction of road, and the record of this moment is represented to be followed successively by: R1-R5, R5-R1-R6, R6-R1-R8, R8-R1-these 4 sections highway sections of R9.Promptly represented to change each bar road of commentaries on classics, implied and explained the positive negative direction of road, correctly write down the distance value in each highway section again, laid the foundation for calculating optimal path length by R1.
But only such data structure still can not be explained the relation that turns between the road.For this reason, we are provided with 4 and turn to limited field turn1, turn2, turn3 and turn4, and the corresponding field value is that 0 expression can be turned, and are 1 expression no turn.Now, establishing main road is M, and bypass is F, and forward travel represents that with 1 negative sense travels and represents with 0.The corresponding M=1 of turn1 then, the situation of F=1; The corresponding M=1 of turn2, the situation of F=0; In like manner, the corresponding M=0 of turn3, the situation of F=1; The corresponding M=0 of turn4, the F=0 situation.By making up such data model, can fully characterize the various traffic restrictions in the actual traffic road network.
The data structure of road circuit node.In order to cooperate the realization of path search algorithm, be necessary the road circuit node is provided with required attribute.At first be ID number of each node, this is the unique identification of node, and arbitrary operation of node is navigated on this ID number always.When calculating shortest path, also need to know two information, the one, source point is apart from the distance value of present node, and current node is apart from the range estimation value of destination node.Expend the minimum value of sum according to both, make a policy, this also is A
*The step of core in the algorithm.We write down these two apart from attribute with mvarsinLength and mvarfLength respectively.According to preceding introduction, the search procedure in path is exactly the process of setting up tree in fact, and independent node structure is the structural information that can't characterize tree, if adopt pointer to solve this problem,, implement quite complicated with pointer because this tree construction that dynamically generates can constantly change.For this reason, we write down the father node of present node with an attribute mvarintParentNode_ID, have in fact just realized the function of similar pointer.Like this, each node in the road tree all points to its father node, and whole road tree construction just can draw complete display.
The major function of traffic network model is promptly supported query manipulation, the good and bad degree of model institutional framework will directly influence the efficient of space querying, thereby influence the performance of whole intelligent transportation system, so model is the place of answering emphasis to consider when setting up model to the tenability of space correlation inquiry, this point embodies a concentrated reflection of on the path search algorithm.Introduce the overall A that uses among the present invention below
*Searching algorithm.
Overall situation A
*In the implementation procedure of searching algorithm, mainly use two aggregate list Openlist and Closelist, be used for storing road circuit node of not examining or check as yet and the road of having examined or check its child node respectively.During the search beginning, initial road circuit node str is added in the Openlist table, and examination and its child node that directly links to each other, also these nodes are added the Openlist table.And Closelist put sky, and the str road is moved in the Closelist table, finish initial work.Judge this moment, whether the Openlist table was empty,, all roads then are described in the limit road network, and fail to find the purpose road, the searching algorithm failure if empty; If not empty then calculates the Fnode_length value of each node in the current Openlist table respectively, and it can expend the value sum by separated into two parts.The value that expends that is start node apart from current node, i.e. a sinNode_length; Another is the estimated value of current road node apart from purpose road node.Take out the minimum node of Fnode_length value, might as well be made as the A point.Whether and then to investigate this node be destination node, if, then find the purpose road, satisfy the algorithm end condition, the output result withdraws from circulation.If not, then to further investigate the whole sub-road circuit node that A is ordered, its child node is added in the interim tabulation templist table, carry out next step judgement.And with the A point from Openlist table, move among the Closelist.
Take out Node B in the Templist table, inquire about this node and in Openlist or Colselist table, occurred? if occurred,, get next road element judgement in the templist table simultaneously Node B deletion from the templist table.If do not occur, then inquire about grandfather and great grandfather's node of this node, calculate great grandfather respectively to grandfather's node road segment segment, reach the travel direction of grandfather to the road segment segment of father's node, and then inquiry turning restriction table.If no turn, illustrate that its grandfather's node is the conversion that can't be accomplished to its father node representative road, also just can't arrive this node-link, so also should give up this node, and then examination templist show in next element.Repeat this process, do not had the road element in the templist table, then algorithm jumps back among the Openlist, carries out two kinds of calculating that expend value of each node, and adds father node and wait operation ID number.So repetitive operation is till finding purpose road dim or Openlist to be sky.
Find and to export road behind the purpose road and handle, in the Closelist table of this moment, stored road circuit nodes whole on the optimal path.Can utilize the father node attribute of node, backward finds father node ID number successively, till searching source point str, and output route again.
Fig. 4 is a route searching fructufy illustration of the present invention, wherein be in the road network spatial model, input Shanghai City electronic chart, and in pressing the category of roads division, divide 6 figure layer storages respectively with the road object, searching route is the Cao Anlu (A20 highway) from Shanghai, searches the shortest path circuit of Siping Road (state Kang Lu).Its search results map is seen Fig. 4, and the black circuit is the optimal route that searches.
Claims (4)
1, a kind of road network modeling method based on road element, the step of this method is:
Step 1: set up the road network spatial model;
Step 2: set up the road net data model.
2, by the described a kind of road network modeling method of claim 1 based on road element,
The establishment step of described road network spatial model is:
Step 1; Open Mapinfo 7.0, newdata table a selects to open new browser Open new Brower and open new map Open new Mapper two options simultaneously;
Step 2; Each field of table a is set, the traffic attribute of the corresponding road of each field; Step 3; Add the real electronic chart in certain zone in this new map, make it visual; A newly-built figure layer, and select " broken line or straight line " object by the trend of road of the reality spatial object that draws, simultaneously, is filled in each traffic attribute of this road on map;
Step 4; Press category of roads and divide, divide several figure layers to store respectively the road object, so that the road relation of research figure interlayer;
Step 5; To all scheme integrated being saved in the space of layer at last, just form the spatial model of traffic network.
3, by the described a kind of road network modeling method based on road element of claim 1, the establishment step of described road net data model is:
Step 1; In the Access database, newly-built road Road table is provided with each field with field among the table a;
Step 2; A newly-built road relation table Roadrelation is provided with following field respectively: main stem road ID, initial road ID, stop road ID, road section length, turn to restricted information.
4, the step by the method for searching shortest route of the described a kind of road network modeling method based on road element of claim 1 or right 2 or right 3 is:
Step 1, algorithm initialization operational module;
Step 2, finish screening operation, select and wait to investigate the node that has minimum weights in the road set;
Step 3, finish the follow-up node work that launches current minimum weights node;
Step 4, finish the road node work in the shoofly set that takes out in turn;
Step 5, processing are turned and are limited matters;
Step 6, the road that will newly detect add waits to investigate the road set, is the ready work of search next time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100461933A CN101488158A (en) | 2009-02-13 | 2009-02-13 | Road network modeling method based on road element |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009100461933A CN101488158A (en) | 2009-02-13 | 2009-02-13 | Road network modeling method based on road element |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101488158A true CN101488158A (en) | 2009-07-22 |
Family
ID=40891046
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2009100461933A Pending CN101488158A (en) | 2009-02-13 | 2009-02-13 | Road network modeling method based on road element |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101488158A (en) |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102072734A (en) * | 2009-11-19 | 2011-05-25 | 罗伯特·博世有限公司 | Method and navigation device for providing additional data in digital road map |
| CN102110128A (en) * | 2009-12-28 | 2011-06-29 | 日电（中国）有限公司 | Traffic information conversion method and device based on traffic information element knowledge base |
| CN102176283A (en) * | 2011-01-07 | 2011-09-07 | 重庆大学 | Traffic network simplifying model and navigating method based on same |
| CN102629417A (en) * | 2012-04-26 | 2012-08-08 | 吉林大学 | Optimization method for traffic control network data organization and traffic induction path, based on positioning query |
| CN101620803B (en) * | 2009-08-11 | 2012-08-22 | 北京四维图新科技股份有限公司 | Method and device for recording traffic restricted information on electronic map |
| CN102087113B (en) * | 2009-12-07 | 2013-02-27 | 厦门雅迅网络股份有限公司 | Autonomous navigation method of on-board unit |
| CN103680185A (en) * | 2013-12-25 | 2014-03-26 | 厦门雅迅网络股份有限公司 | Vehicle traveling road level precise division method |
| CN104217579A (en) * | 2013-07-23 | 2014-12-17 | 同济大学 | Method for searching critical road sections of traffic networks on basis of redundancy of road section sub-networks |
| CN105371857A (en) * | 2015-10-14 | 2016-03-02 | 山东大学 | Device and method for constructing road network topology based on bus GNSS space-time tracking data |
| CN106017492A (en) * | 2016-05-13 | 2016-10-12 | 苏州东方智旅信息科技有限公司 | Intelligent navigation method adopted in scenic region |
| CN106055809A (en) * | 2016-06-06 | 2016-10-26 | 厦门大学 | Method for solving minimum factor combination of invalid system with logic ring based on multi-way tree |
| CN106067072A (en) * | 2016-05-30 | 2016-11-02 | 清华大学 | A kind of path self adaptation fast acquiring method under logic road net model |
| CN106846805A (en) * | 2017-03-06 | 2017-06-13 | 南京多伦科技股份有限公司 | A kind of dynamic road grid traffic needing forecasting method and its system |
| CN107679305A (en) * | 2017-09-25 | 2018-02-09 | 南京市城市与交通规划设计研究院股份有限公司 | Road net model creation method and device |
| CN107978219A (en) * | 2016-10-25 | 2018-05-01 | 武汉四维图新科技有限公司 | A kind of method and device for the road network for building numerical map |
| CN107990909A (en) * | 2016-10-27 | 2018-05-04 | 千寻位置网络有限公司 | A kind of test method and its system of simulated roadway position data |
| CN109637112A (en) * | 2018-11-23 | 2019-04-16 | 江苏省南京市公安局交通管理局车辆管理所 | Emphasis vehicle source dynamic supervision system and monitoring method |
| CN110070239A (en) * | 2019-03-29 | 2019-07-30 | 北京航空航天大学 | A kind of personalized route recommendation method based on A star search and deep learning |
| CN110781255A (en) * | 2019-08-29 | 2020-02-11 | 腾讯大地通途（北京）科技有限公司 | Road aggregation method, road aggregation device and electronic equipment |
| CN113486619A (en) * | 2021-06-22 | 2021-10-08 | 国网新疆电力有限公司昌吉供电公司 | Energy model-based single line diagram block layout algorithm |
| CN113609691A (en) * | 2021-08-10 | 2021-11-05 | 四川易方智慧科技有限公司 | Intersection modeling processing method for intelligent traffic simulation |
-
2009
- 2009-02-13 CN CNA2009100461933A patent/CN101488158A/en active Pending
Cited By (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101620803B (en) * | 2009-08-11 | 2012-08-22 | 北京四维图新科技股份有限公司 | Method and device for recording traffic restricted information on electronic map |
| CN102072734B (en) * | 2009-11-19 | 2015-01-28 | 罗伯特·博世有限公司 | Method and navigation device for providing additional data in digital road map |
| CN102072734A (en) * | 2009-11-19 | 2011-05-25 | 罗伯特·博世有限公司 | Method and navigation device for providing additional data in digital road map |
| CN102087113B (en) * | 2009-12-07 | 2013-02-27 | 厦门雅迅网络股份有限公司 | Autonomous navigation method of on-board unit |
| CN102110128A (en) * | 2009-12-28 | 2011-06-29 | 日电（中国）有限公司 | Traffic information conversion method and device based on traffic information element knowledge base |
| CN102176283A (en) * | 2011-01-07 | 2011-09-07 | 重庆大学 | Traffic network simplifying model and navigating method based on same |
| CN102176283B (en) * | 2011-01-07 | 2013-05-08 | 重庆大学 | Traffic network simplifying model and navigating method based on same |
| CN102629417A (en) * | 2012-04-26 | 2012-08-08 | 吉林大学 | Optimization method for traffic control network data organization and traffic induction path, based on positioning query |
| CN102629417B (en) * | 2012-04-26 | 2015-07-29 | 吉林大学 | A kind of restricted driving policing networks Organization of Data based on locating query and traffic guided path optimization method |
| CN104217579B (en) * | 2013-07-23 | 2016-08-24 | 同济大学 | Transportation network key road segment searching method based on section sub-network redundancy |
| CN104217579A (en) * | 2013-07-23 | 2014-12-17 | 同济大学 | Method for searching critical road sections of traffic networks on basis of redundancy of road section sub-networks |
| CN103680185A (en) * | 2013-12-25 | 2014-03-26 | 厦门雅迅网络股份有限公司 | Vehicle traveling road level precise division method |
| CN103680185B (en) * | 2013-12-25 | 2018-05-08 | 厦门雅迅网络股份有限公司 | A kind of vehicle travel level precise division method |
| CN105371857A (en) * | 2015-10-14 | 2016-03-02 | 山东大学 | Device and method for constructing road network topology based on bus GNSS space-time tracking data |
| CN105371857B (en) * | 2015-10-14 | 2018-05-22 | 山东大学 | A kind of device and method based on bus GNSS space-time trajectory data construction road network topologies |
| CN106017492A (en) * | 2016-05-13 | 2016-10-12 | 苏州东方智旅信息科技有限公司 | Intelligent navigation method adopted in scenic region |
| CN106067072A (en) * | 2016-05-30 | 2016-11-02 | 清华大学 | A kind of path self adaptation fast acquiring method under logic road net model |
| CN106067072B (en) * | 2016-05-30 | 2020-01-14 | 清华大学 | Path self-adaptive rapid acquisition method under logic road network model |
| CN106055809A (en) * | 2016-06-06 | 2016-10-26 | 厦门大学 | Method for solving minimum factor combination of invalid system with logic ring based on multi-way tree |
| CN106055809B (en) * | 2016-06-06 | 2018-07-17 | 厦门大学 | The method that the minimum factor combination of nuclear power plant system failure is solved based on multiway tree |
| CN107978219A (en) * | 2016-10-25 | 2018-05-01 | 武汉四维图新科技有限公司 | A kind of method and device for the road network for building numerical map |
| CN107978219B (en) * | 2016-10-25 | 2020-05-01 | 武汉四维图新科技有限公司 | Method and device for constructing road network of digital map |
| CN107990909B (en) * | 2016-10-27 | 2021-05-25 | 千寻位置网络有限公司 | Test method and system for simulating road position data |
| CN107990909A (en) * | 2016-10-27 | 2018-05-04 | 千寻位置网络有限公司 | A kind of test method and its system of simulated roadway position data |
| CN106846805A (en) * | 2017-03-06 | 2017-06-13 | 南京多伦科技股份有限公司 | A kind of dynamic road grid traffic needing forecasting method and its system |
| CN107679305B (en) * | 2017-09-25 | 2020-10-30 | 南京市城市与交通规划设计研究院股份有限公司 | Road network model creating method and device |
| CN107679305A (en) * | 2017-09-25 | 2018-02-09 | 南京市城市与交通规划设计研究院股份有限公司 | Road net model creation method and device |
| CN109637112A (en) * | 2018-11-23 | 2019-04-16 | 江苏省南京市公安局交通管理局车辆管理所 | Emphasis vehicle source dynamic supervision system and monitoring method |
| CN110070239A (en) * | 2019-03-29 | 2019-07-30 | 北京航空航天大学 | A kind of personalized route recommendation method based on A star search and deep learning |
| CN110070239B (en) * | 2019-03-29 | 2021-05-11 | 北京航空航天大学 | Personalized route recommendation method based on A star search and deep learning |
| CN110781255A (en) * | 2019-08-29 | 2020-02-11 | 腾讯大地通途（北京）科技有限公司 | Road aggregation method, road aggregation device and electronic equipment |
| CN110781255B (en) * | 2019-08-29 | 2024-04-05 | 腾讯大地通途（北京）科技有限公司 | Road aggregation method, road aggregation device and electronic equipment |
| CN113486619A (en) * | 2021-06-22 | 2021-10-08 | 国网新疆电力有限公司昌吉供电公司 | Energy model-based single line diagram block layout algorithm |
| CN113609691A (en) * | 2021-08-10 | 2021-11-05 | 四川易方智慧科技有限公司 | Intersection modeling processing method for intelligent traffic simulation |
| CN113609691B (en) * | 2021-08-10 | 2023-08-08 | 四川易方智慧科技有限公司 | Intersection modeling processing method oriented to intelligent traffic simulation |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101488158A (en) | Road network modeling method based on road element | |
| CN102538806B (en) | A kind of paths planning method and relevant device | |
| CN103412897B (en) | A kind of parallel data processing method based on distributed frame | |
| CN100523735C (en) | Fast map matching method based on small lattice road network organization and structure | |
| CN103134505B (en) | Path planning system and method thereof | |
| CN102435200B (en) | Rapid path planning method | |
| CN102810118B (en) | A kind of change weighs net K nearest neighbor search method | |
| CN103544291A (en) | Mobile object continuous k-nearest neighbor (CKNN) query method based on road based road networks tree (RRN-Tree) in road network | |
| CN104462190A (en) | On-line position prediction method based on mass of space trajectory excavation | |
| CN104252489A (en) | Method for fast obtaining position character description information according to latitude and longitude data | |
| CN102169637A (en) | Dynamic route guidance method oriented to urban traffic | |
| WO2022199388A1 (en) | Travel path planning method and travel path recommendation method | |
| CN102749084A (en) | Path selecting method oriented to massive traffic information | |
| CN102890719B (en) | A kind of method that license plate number is searched for generally and device | |
| CN105740964A (en) | Urban road network data organization and shortest path rapid calculation method | |
| CN109492150A (en) | Reverse nearest neighbor queries method and device based on semantic track big data | |
| Sarwat | Interactive and scalable exploration of big spatial data--a data management perspective | |
| CN101526366B (en) | Map data processing method and navigation equipment. | |
| CN102043857A (en) | All-nearest-neighbor query method and system | |
| CN105761037A (en) | Logistics scheduling method based on space reverse neighbor search under cloud computing environment | |
| CN104794551A (en) | Automatic optimization system and method of itinerary with time window | |
| CN103593409A (en) | Real-time database retrieval method and real-time database retrieval system | |
| Meishan | Design of intelligent planning system for tourist scenic route based on ant colony algorithm | |
| CN109840620A (en) | The querying method of k nearest neighbors pair in more attribute timing transportation networks | |
| CN104462467B (en) | A kind of coordinate points processing method and processing device for electronic map interface |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20090722 |