CN105509742B - A kind of indoor road network structure and method for searching with layer pathfinding - Google Patents

A kind of indoor road network structure and method for searching with layer pathfinding Download PDF

Info

Publication number
CN105509742B
CN105509742B CN201510826252.4A CN201510826252A CN105509742B CN 105509742 B CN105509742 B CN 105509742B CN 201510826252 A CN201510826252 A CN 201510826252A CN 105509742 B CN105509742 B CN 105509742B
Authority
CN
China
Prior art keywords
road network
point
site
road
bypass
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.)
Active
Application number
CN201510826252.4A
Other languages
Chinese (zh)
Other versions
CN105509742A (en
Inventor
吴亚峰
于复兴
索依娜
常永平
陈瑞琳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tangshan Shengtuo Technology Co.,Ltd.
Original Assignee
North China University of Science and Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by North China University of Science and Technology filed Critical North China University of Science and Technology
Priority to CN201510826252.4A priority Critical patent/CN105509742B/en
Publication of CN105509742A publication Critical patent/CN105509742A/en
Application granted granted Critical
Publication of CN105509742B publication Critical patent/CN105509742B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/20Instruments for performing navigational calculations
    • G01C21/206Instruments for performing navigational calculations specially adapted for indoor navigation

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)

Abstract

The present invention provides a kind of indoor road network structure and method for searching with layer pathfinding, this method, by building road network information, the main road site of designated floor is all put into a set A, according to the determination of the coordinate of starting and terminal point and starting point, the closest road network point of terminal, what set A was stated contains all This floor main road sites to search in the road network for only containing related bypass site from starting point road network point to the path of terminal road network point, until it is determined that path, due in this method according to the difference of floor landform, organize road network point, and the location coordinate information and connectivity of road network point are recorded in road network;Road network point supplemented by the road network point identifications of an other road network points will be only connected in road network, be up to two bypass sites participate in road network search every time in a large amount of bypass sites, the search space of solution is substantially reduced, therefore is improved a lot than the method efficiency that traditional all road network points are involved in searching for.

Description

A kind of indoor road network structure and method for searching with layer pathfinding
Technical field
The present invention relates to a kind of indoor road network structure and method for searching, especially one kind with layer pathfinding to apply mobile whole The indoor road network structure and method for searching with layer pathfinding at end, belongs to interior with layer pathfinding technical field.
Background technology
With the continuous reinforcement of the high speed development of mobile Internet, and mobile terminal disposal ability, location-based clothes It is engaged in more and more used;The raising of living standards of the people simultaneously, Commercial Complex is more and more, and careat is increasing, It is also unavoidable to reach lost in a foreign environment room.It is typically all to be based on although outdoor positioning pathfinding is very ripe GPS and mobile phone signal synthesis positioning, these signals indoors especially basement become very small effect with regard to some have too many difficulties to cope with. So the prefabricated indoor road network coordinate of the present invention, more convenient to be combined with the technology of indoor positioning, determine without using GPS and mobile phone signal Position, propose a kind of efficient interior with layer method for searching..
The content of the invention
One of the technical problem to be solved in the present invention is to provide a kind of indoor road network construction method with layer pathfinding, changes and passes The GPS and mobile phone signal synthesized positioning method of system.
The second technical problem to be solved by the present invention is to provide a kind of interior with layer method for searching:Reduce in layer and search every time Unrelated road dot number in rope, substantially increase the efficiency of search in layer.
In order to solve the above-mentioned technical problem, the present invention is achieved by the following technical solutions:
A kind of indoor road network structure and method for searching with layer pathfinding, wherein, the indoor road network with layer pathfinding is built Comprise the steps with method for searching:
a:First build road network information:Including structure main road dot data list, the list of structure bypass dot data, structure connection Connectivity information list;The main road site and bypass site are referred to as road network point;Main road site connects at least two other road networks Point, bypass site only connect an other road network point;The road network is the path of two road network points;
b:The main road site of designated floor is all put into a set A;
c:The road network point closest with starting point, terminal, the road network point found are determined according to the coordinate of starting and terminal point first Both it had been probably that main road site is also likely to be bypass site;
d:This step is skimmed over if being main road site if starting point road network point, adds bypass site if starting point is bypass site Into set A;
e:This step is skimmed over if being main road site if terminal road network point, adds bypass site if terminal is bypass site Into set A;
f:Contain all This floor main road sites what set A was stated and searched in the road network for only containing related bypass site Rope is from starting point road network point to the path of terminal road network point;Search takes minimum value, great Liang Fu according to the distance between road network point weights Be up to two bypass sites participate in road network search every time in road network point;
g:Start increase from starting point to the through path of starting point road network point in path;
h:Through path of the last increase from terminal road network point to terminal in path;
i:G, f, h are synthesized into final path.
The road network records the distance between two road network piont marks and road network point weights.
In the step a, often row represents a main road site to the list of main road dot data, is started with " v ", is followed by a little Ground level X, Z coordinate, with " M " terminate, be expressed as main road site.
In the step a, often row represents a bypass site to the list of bypass dot data, is started with " v ", is followed by a little Ground level X, Z coordinate, with " F " terminate, be expressed as bypass site.
In the step a, often row represents a connectivity information to connectivity information list, is started with " p ", is followed by this Two related road number nodes of bar connectivity information, centre are connected with "-", often go last numerical value as this information correlation The distance between two road network points weights.
The main beneficial effect of the present invention:Due to the road network point of an other road network points will be only connected in this method in road network Bypass site is identified as, two bypass sites is up in a large amount of bypass sites every time and participates in road network searches, the search of solution is empty Between be substantially reduced, therefore than traditional all road network points be involved in search method efficiency improve a lot.
Brief description of the drawings
Fig. 1 is pathfinding flow chart of the present invention.
Fig. 2 is road network structure schematic diagram of the present invention;
Its medium and small rectangle node is that main road network point is communicated to two and more than two other road network points, small circular node are Bypass site is only directly connected with an other road network points.
Fig. 3 is the search result schematic diagram of one embodiment of the invention;
Wherein 1 between road network point path, 2 be from starting point to the through path of starting point road network point, and 3 be from terminal road network point To the through path of terminal.
Embodiment
It is described further with reference to the accompanying drawings and examples.
The present invention basic thought be:According to the difference of floor landform, road network point is organized, and road network point is recorded in road network Location coordinate information and connectivity.At most only 2 bypass sites participate in during searching route, greatly reduce search The quantity of road network point, improves efficiency.
Embodiment 1:
Data tissue is stored with behavior unit in layer, and an example is as follows:
v 1187.00,1079.00 M
v 1076.00,1100.00 M
v 998.00,1114.00 M
v 921.03,1129.41 M
……
v 949.00,645.00 F
v 324.00,206.00 F
v 295.00,373.00 F
v 324.00,1202.00 F
……
p 120-121 112.445541
p 119-120 129.468140
p 119-160 94.045616
p 80-81 95.754898
p 80-131 76.015106
p 50-51 137.057144
p 46-47 140.027939
p 38-39 141.014191
Above-mentioned Part I is main road network point list, and often row represents a main road site, is started with " v ", is followed by a little XZ coordinates, last " M " is expressed as main road site;
Road network point list supplemented by above-mentioned Part II, one bypass site of often row expression, is started with " v ", is followed by a little XZ coordinates, last " F " is expressed as bypass site;
Above-mentioned Part III is connectivity information list, and often row represents a connectivity information, is started with " p ", followed by Two related road number nodes of this connectivity information, centre is connected with "-", and last numerical value of often going is this information phase The distance between the two road network points closed weights.
This time the beginning and end of road network search is all located at same floor as can be seen from Figure 3, then is searched in execution level. Step is as follows when being searched in execution level:
1)By the main road site of designated floor(Small rectangle node in Fig. 2)All it is put into a set A
2)The road network point closest with starting point, terminal is determined according to the coordinate of starting and terminal point in Fig. 3 first, this search The road network point nearest with starting and terminal point found is all bypass site;
3)This search starting point road network point is bypass site, is added in set A;
4)This search terminal road network point is bypass site, is added in set A;
5)Contain all This floor main road sites what set A was stated and searched in the road network for only containing related bypass site For rope from starting point road network point to the path of terminal road network point, search result is path 1;
6)Start increase from starting point to the through path 3 of starting point road network point in path;
7)Through path 2 of the last increase from terminal road network point to terminal in path;
8) by path 3, path 1, path is 2-in-1 to turn into final path, as Fig. 3 thick lines mark.

Claims (5)

  1. A kind of 1. indoor road network structure and method for searching with layer pathfinding, it is characterised in that the indoor road network with layer pathfinding Structure and method for searching comprise the steps:
    a:First build road network information:Including structure main road dot data list, the list of structure bypass dot data, structure connectivity Information list;The main road site and bypass site are referred to as road network point;Main road site connects 1 other road network points, auxiliary Road network point only connects an other road network point;The road network is the path of two road network points;
    b:The main road site of designated floor is all put into a set A;
    c:The road network point closest with starting point, terminal is determined according to the coordinate of starting and terminal point first, the road network point found both may be used Can be that main road site is also likely to be bypass site;
    d:This step is skimmed over if being main road site if starting point road network point, bypass site is added to collection if starting point is bypass site Close in A;
    e:This step is skimmed over if being main road site if terminal road network point, bypass site is added to collection if terminal is bypass site Close in A;
    f:Set A stated containing all This floor main road sites and only containing related bypass site road network in search for from Starting point road network point is to the path of terminal road network point;Search takes minimum value, a large amount of bypass nets according to the distance between road network point weights Be up to two bypass sites participate in road network search every time in point;
    g:Start increase from starting point to the through path of starting point road network point in path;
    h:Through path of the last increase from terminal road network point to terminal in path;
    i:G, f, h are synthesized into final path.
  2. A kind of 2. indoor road network structure and method for searching with layer pathfinding as claimed in claim 1, it is characterised in that:The road Net records the distance between two road network piont marks and road network point weights.
  3. A kind of 3. indoor road network structure and method for searching with layer pathfinding as claimed in claim 1, it is characterised in that:The step In rapid a, often row represents a main road site to the list of main road dot data, is started with " v ", and ground level X, the Z being followed by a little are sat Mark, terminated with " M ", be expressed as main road site.
  4. A kind of 4. indoor road network structure and method for searching with layer pathfinding as claimed in claim 1, it is characterised in that:The step In rapid a, often row represents a bypass site to the list of bypass dot data, is started with " v ", and ground level X, the Z being followed by a little are sat Mark, terminated with " F ", be expressed as bypass site.
  5. A kind of 5. indoor road network structure and method for searching with layer pathfinding as claimed in claim 1, it is characterised in that:The step In rapid a, often row represents a connectivity information to connectivity information list, is started with " p ", is followed by this connectivity information phase Guan Liangge roads number node, centre are connected with "-", often go last numerical value between two related road network points of this information Apart from weights.
CN201510826252.4A 2015-11-25 2015-11-25 A kind of indoor road network structure and method for searching with layer pathfinding Active CN105509742B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510826252.4A CN105509742B (en) 2015-11-25 2015-11-25 A kind of indoor road network structure and method for searching with layer pathfinding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510826252.4A CN105509742B (en) 2015-11-25 2015-11-25 A kind of indoor road network structure and method for searching with layer pathfinding

Publications (2)

Publication Number Publication Date
CN105509742A CN105509742A (en) 2016-04-20
CN105509742B true CN105509742B (en) 2018-03-20

Family

ID=55717899

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510826252.4A Active CN105509742B (en) 2015-11-25 2015-11-25 A kind of indoor road network structure and method for searching with layer pathfinding

Country Status (1)

Country Link
CN (1) CN105509742B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106017492A (en) * 2016-05-13 2016-10-12 苏州东方智旅信息科技有限公司 Intelligent navigation method adopted in scenic region
CN106931978B (en) * 2017-02-23 2020-05-22 湖南傲派自动化设备有限公司 Indoor map generation method for automatically constructing road network

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103267526A (en) * 2013-05-24 2013-08-28 北京邮电大学 Indoor navigation method and system
CN103674017A (en) * 2013-12-20 2014-03-26 广东瑞图万方科技股份有限公司 Indoor electronic map generation system, indoor navigation method and system
CN103900600A (en) * 2012-12-25 2014-07-02 中国电信股份有限公司 Method and system for navigating indoor paths of maps across floors
CN104215237A (en) * 2013-06-05 2014-12-17 北京掌尚无限信息技术有限公司 Indoor map navigation route guidance algorithm
CN104280028A (en) * 2014-06-04 2015-01-14 上海赛图计算机科技有限公司 Realizing method for computing part involving path crossing floors based on indoor map path
CN105066997A (en) * 2015-07-28 2015-11-18 中国地质大学(武汉) Dynamic path generation method directed at indoor navigation

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100994840B1 (en) * 2009-11-27 2010-11-16 주식회사 케이티 Position determination method and system based on wlan rssi value
US9234958B2 (en) * 2012-04-19 2016-01-12 Nokia Technologies Oy Method, apparatus, and computer program product for distributed indoor three-dimensional radiomap
KR20150076796A (en) * 2013-12-27 2015-07-07 한국전자통신연구원 3-Dimensional Indoor Route Providing Apparatus, System and the Method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103900600A (en) * 2012-12-25 2014-07-02 中国电信股份有限公司 Method and system for navigating indoor paths of maps across floors
CN103267526A (en) * 2013-05-24 2013-08-28 北京邮电大学 Indoor navigation method and system
CN104215237A (en) * 2013-06-05 2014-12-17 北京掌尚无限信息技术有限公司 Indoor map navigation route guidance algorithm
CN103674017A (en) * 2013-12-20 2014-03-26 广东瑞图万方科技股份有限公司 Indoor electronic map generation system, indoor navigation method and system
CN104280028A (en) * 2014-06-04 2015-01-14 上海赛图计算机科技有限公司 Realizing method for computing part involving path crossing floors based on indoor map path
CN105066997A (en) * 2015-07-28 2015-11-18 中国地质大学(武汉) Dynamic path generation method directed at indoor navigation

Also Published As

Publication number Publication date
CN105509742A (en) 2016-04-20

Similar Documents

Publication Publication Date Title
CN101587673B (en) View spot triggering method based on explication point in GPS intelligent guide system
CN106094834A (en) Based on the method for planning path for mobile robot under known environment
CN105509742B (en) A kind of indoor road network structure and method for searching with layer pathfinding
CN107133700A (en) Mobile phone signaling data road network method based on R* tree indexes
CN104215237A (en) Indoor map navigation route guidance algorithm
CN106075906A (en) The method for searching of a kind of simulated object, the building method of scene and the device of correspondence
CN103716803B (en) A kind of wireless sensor network relay node deployment method
CN101944095A (en) Path planning method and system
CN108362293A (en) A kind of track of vehicle matching process based on key point technology
CN106767826A (en) A kind of indoor method across floor path navigation
CN107677269A (en) A kind of low signal areas intelligent navigation method based on topological map
CN103995837A (en) Personalized tourist track planning method based on group footprints
CN104394568B (en) Geographic routing method based on artificial spider web in vehicle self-organizing network
CN103323017B (en) A kind of air navigation aid and guider
CN104784932A (en) Path finding method for game role
CN105424045A (en) Road network building and pathfinding method for indoor cross-layer pathfinding
CN103020130B (en) A kind of k nearest neighbor query method towards support area in the location-based service of city road network
CN109271591A (en) Recommending scenery spot method, computer equipment and computer readable storage medium
CN107357965A (en) A kind of path planning design method of wind power plant collection electric line
CN114495552B (en) Navigation method and system for quickly parking and finding vehicle
CN110345964A (en) Route matching method, apparatus, system and storage medium
CN106767863A (en) A kind of method and system of share-car trip route navigation
CN101620814B (en) Tour guide and navigation method and tour guide and navigation terminal
CN109031379A (en) A kind of generation method and system of navigation routine map
CN103900582A (en) Residential quarter map recording method and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20181205

Address after: Room 1102, Tangshan Science and Technology Center, Tangshan High-tech Zone, Hebei Province

Patentee after: Tangshan Yongteng Technology Co.,Ltd.

Address before: 063009 Xinhua West Road, Tangshan City, Hebei Province, No. 46

Patentee before: NORTH CHINA University OF SCIENCE AND TECHNOLOGY

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230403

Address after: 903-2, 9th Floor, No. 1698 Weiguo North Road, High tech Industrial Park, Tangshan City, Hebei Province, 063000

Patentee after: Tangshan Shengtuo Technology Co.,Ltd.

Address before: Room 1102, Tangshan Science and Technology Center, Tangshan High-tech Zone, Hebei Province

Patentee before: Tangshan Yongteng Technology Co.,Ltd.