CN105509742A - Path network constructing and path searching methods for indoor single-layer path searching - Google Patents

Path network constructing and path searching methods for indoor single-layer path searching Download PDF

Info

Publication number
CN105509742A
CN105509742A CN201510826252.4A CN201510826252A CN105509742A CN 105509742 A CN105509742 A CN 105509742A CN 201510826252 A CN201510826252 A CN 201510826252A CN 105509742 A CN105509742 A CN 105509742A
Authority
CN
China
Prior art keywords
road network
site
point
path
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
Application number
CN201510826252.4A
Other languages
Chinese (zh)
Other versions
CN105509742B (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)
  • Traffic Control Systems (AREA)
  • Navigation (AREA)

Abstract

The invention provides a path network constructing method for indoor single-layer path searching and provides an indoor single-layer path searching method. According to the methods, path network points are organized according to floor layer terrain differences, position coordinate information and communication information of the path network points are recorded in a path network, the path network points in the path network, which only communicate another path network point, are labeled as auxiliary path network points, and only two of the large number of the auxiliary path network points participate path network searching for each time so that searching space to be solved is greatly decreased, and therefore the efficiency of the path searching method is greatly increased than that of a traditional method in which all path network points participate searching.

Description

A kind of indoor build and method for searching with the road network of layer pathfinding
Technical field
The present invention relates to a kind of indoor to build and method for searching with the road network of layer pathfinding, especially a kind of indoor being applied in mobile terminal build and method for searching with the road network of layer pathfinding, belong to indoor with layer pathfinding technical field.
Background technology
Along with the high speed development of mobile Internet, and the continuous reinforcement of mobile terminal processing power, location Based service is more and more to be used; The raising of living standards of the people simultaneously, Commercial Complex gets more and more, and careat is increasing, and it is also unavoidable for arriving indoor the getting lost of a foreign environment.Although outdoor positioning pathfinding is very ripe, is generally all comprehensively locate based on GPS and mobile phone signal, these signals in indoor especially basement become very small effect and had too many difficulties to cope with regard to some.So the prefabricated indoor road network coordinate of the present invention, the more convenient combine with technique with indoor positioning, does not use GPS and mobile phone signal location, proposes a kind of indoor with layer method for searching efficiently.
Summary of the invention
One of the technical problem to be solved in the present invention is to provide the road network construction method of a kind of indoor with layer pathfinding, changes traditional GPS and mobile phone signal synthesized positioning method.
Two of the technical problem to be solved in the present invention is to provide a kind of indoor with floor method for searching: reduce the irrelevant road dot number in each search in floor, substantially increase the efficiency of search in layer.
In order to solve the problems of the technologies described above, the present invention is achieved by the following technical solutions:
Indoor, with a road network construction method for layer pathfinding, is characterized in that, described indoor comprise the steps: with the road network construction method of layer pathfinding
A: build the list of main road dot data, the list of main road dot data is capable expression main road site often, with " v " beginning, after ground level X, Z coordinate of and then point, terminate with " M ", be expressed as main road site;
B: build the list of bypass dot data, the list of bypass dot data is capable expression bypass site often, with " v " beginning, after ground level X, Z coordinate of and then point, terminate with " F ", be expressed as bypass site;
C: build connectivity information list, connectivity information list is capable expression connectivity information often, start with " p ", and then the Liang Ge road number node that this connectivity information is relevant below, middle be connected with "-", last numerical value of often going is the distance weights between this information two road network points of being correlated with.
A kind of indoor with layer method for searching, it is characterized in that: described indoor comprise the steps: with layer method for searching
A: first build road network information;
B: the main road site of designated floor is all put in a set A;
C: first determine the road network point nearest with starting point, terminal according to the coordinate of starting and terminal point, the road network found point both may be main road site also may be bypass site;
D: if starting point road network point is main road site, skim over this step, if starting point is bypass site, adds in set A by bypass site;
E: if terminal road network point is main road site, skim over this step, if terminal is bypass site, adds in set A by bypass site;
F: that states in set A contains in all This floor main road sites and the road network only containing relevant bypass site the path searched for from starting point road network point to terminal road network point;
G: path start increase from starting point to the through path of starting point road network point;
H: the last increase in path is from terminal road network point to the through path of terminal;
I: g, f, h are synthesized final path.
Described road network point comprises main road site and bypass site; Main road site is communicated with at least two other road network points, and bypass site is only communicated with other road network point.
Described road network is the path of two road network points, records the distance weights between two road network piont marks and road network point.
Described search gets minimum value according to the distance weights between road network point, has at most two bypass sites to participate in road network search in a large amount of bypass site at every turn.
The main beneficial effect of the present invention: owing to being bypass site by the road network point identification being only communicated with other road network point in road network in this method, there are at most two bypass sites to participate in road network search in a large amount of bypass site at every turn, the search volume solved reduces greatly, and the method efficiency therefore all participating in searching for than traditional all road network points improves a lot.
Accompanying drawing explanation
Fig. 1 is pathfinding process flow diagram 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 site is communicated to two and other road network point plural, and to be that bypass site is only direct be connected with other a road network point small circular node.
Fig. 3 is the Search Results schematic diagram of one embodiment of the invention;
Wherein 1 is path between road network point, and 2 is the through path from starting point to starting point road network point, and 3 is the through path from terminal road network point to terminal.
Embodiment
Be described further below in conjunction with drawings and Examples.
Basic thought of the present invention is: according to the difference of floor landform, organizes road network point, and in road network, record location coordinate information and the connectivity of road network point.Only have at most 2 bypass sites to participate in during searching route, greatly reduce the quantity of search road network point, improve efficiency.
Embodiment 1:
In layer, Organization of Data stores with behavior unit, and an example is as follows:
v1187.00,1079.00M
v1076.00,1100.00M
v998.00,1114.00M
v921.03,1129.41M
……
v949.00,645.00F
v324.00,206.00F
v295.00,373.00F
v324.00,1202.00F
……
p120-121112.445541
p119-120129.468140
p119-16094.045616
p80-8195.754898
p80-13176.015106
p50-51137.057144
p46-47140.027939
p38-39141.014191
Above-mentioned Part I is the list of main road site, often capable expression main road site, with " v " beginning, after the XZ coordinate of and then point, last " M " is expressed as main road site;
Above-mentioned Part II is the list of bypass site, often capable expression bypass site, with " v " beginning, after the XZ coordinate of and then point, last " F " is expressed as bypass site;
Above-mentioned Part III is connectivity information list, often capable expression connectivity information, with " p " beginning, after Liang Ge road number node that and then this connectivity information is relevant, middle be connected with "-", last numerical value of often going is the distance weights between this information two road network points of being correlated with.
This time the starting point of road network search and terminal are all positioned at same floor, then search in execution level as can be seen from Figure 3.In execution level, during search, step is as follows:
1) the main road site (the medium and small rectangle node of Fig. 2) of designated floor is all put in a set A
2) first determine the road network point nearest with starting point, terminal according to the coordinate of starting and terminal point in Fig. 3, this searches for 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) that states in set A contains in all This floor main road sites and the road network only containing relevant bypass site the path searched for from starting point road network point to terminal road network point, and Search Results is path 1;
6) path start increase from starting point to the through path 3 of starting point road network point;
7) the last increase in path is from terminal road network point to the through path 2 of terminal;
8) by path 3, path 1, path is 2-in-1 becomes final path, as Fig. 3 thick line mark.

Claims (5)

1. indoor are with a road network construction method for layer pathfinding, it is characterized in that, described indoor comprise the steps: with the road network construction method of layer pathfinding
A: build the list of main road dot data, the list of main road dot data is capable expression main road site often, with " v " beginning, after ground level X, Z coordinate of and then point, terminate with " M ", be expressed as main road site;
B: build the list of bypass dot data, the list of bypass dot data is capable expression bypass site often, with " v " beginning, after ground level X, Z coordinate of and then point, terminate with " F ", be expressed as bypass site;
C: build connectivity information list, connectivity information list is capable expression connectivity information often, start with " p ", and then the Liang Ge road number node that this connectivity information is relevant below, middle be connected with "-", last numerical value of often going is the distance weights between this information two road network points of being correlated with.
2. indoor are with a layer method for searching, it is characterized in that: described indoor comprise the steps: with layer method for searching
A: first build road network information;
B: the main road site of designated floor is all put in a set A;
C: first determine the road network point nearest with starting point, terminal according to the coordinate of starting and terminal point, the road network found point both may be main road site also may be bypass site;
D: if starting point road network point is main road site, skim over this step, if starting point is bypass site, adds in set A by bypass site;
E: if terminal road network point is main road site, skim over this step, if terminal is bypass site, adds in set A by bypass site;
F: that states in set A contains in all This floor main road sites and the road network only containing relevant bypass site the path searched for from starting point road network point to terminal road network point;
G: path start increase from starting point to the through path of starting point road network point;
H: the last increase in path is from terminal road network point to the through path of terminal;
I: g, f, h are synthesized final path.
3. as claimed in claim 2 indoor with layer method for searching, it is characterized in that: described road network point comprises main road site and bypass site; Main road site is communicated with at least two other road network points, and bypass site is only communicated with other road network point.
4. as claimed in claim 2 indoor with layer method for searching, it is characterized in that: described road network is the path of two road network points, record the distance weights between two road network piont marks and road network point.
5. as claimed in claim 2 indoor with layer method for searching, it is characterized in that: search gets minimum value according to the distance weights between road network point in a large amount of bypass site, having at most two bypass sites to participate in road network search at every turn.
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 true CN105509742A (en) 2016-04-20
CN105509742B 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)

Cited By (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
CN106931978A (en) * 2017-02-23 2017-07-07 湖南天特智能科技有限公司 The method of the automatic indoor map generation for building road network

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130003572A1 (en) * 2009-11-27 2013-01-03 Kt Corporation Indoor position determination method and system based on wlan signal strength
CN103267526A (en) * 2013-05-24 2013-08-28 北京邮电大学 Indoor navigation method and system
US20130281111A1 (en) * 2012-04-19 2013-10-24 Nokia Corporation Method, apparatus, and computer program product for distributed indoor three-dimensional radiomap
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
US20150185022A1 (en) * 2013-12-27 2015-07-02 Electronics And Telecommunications Research Institute Stereoscopic indoor route providing apparatus, system and method
CN105066997A (en) * 2015-07-28 2015-11-18 中国地质大学(武汉) Dynamic path generation method directed at indoor navigation

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130003572A1 (en) * 2009-11-27 2013-01-03 Kt Corporation Indoor position determination method and system based on wlan signal strength
US20130281111A1 (en) * 2012-04-19 2013-10-24 Nokia Corporation Method, apparatus, and computer program product for distributed indoor three-dimensional radiomap
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
US20150185022A1 (en) * 2013-12-27 2015-07-02 Electronics And Telecommunications Research Institute Stereoscopic indoor route providing apparatus, system and method
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

Cited By (3)

* 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
CN106931978A (en) * 2017-02-23 2017-07-07 湖南天特智能科技有限公司 The method of the automatic indoor map generation for building road network
CN106931978B (en) * 2017-02-23 2020-05-22 湖南傲派自动化设备有限公司 Indoor map generation method for automatically constructing road network

Also Published As

Publication number Publication date
CN105509742B (en) 2018-03-20

Similar Documents

Publication Publication Date Title
CN103808326B (en) Air navigation aid and navigation system
CN102147260B (en) Electronic map matching method and device
CN110008413B (en) Traffic travel problem query method and device
CN106528589B (en) Data managing method and device
CN108133619A (en) Method, apparatus, storage medium and the terminal device of Parking prediction
US11009362B2 (en) Generating trail network maps
CN104391869B (en) Electronic map data update method and device
CN107167136A (en) Recommend method and system in a kind of position towards electronic map
CN104978420A (en) Traveling route matching method and apparatus
CN104252489A (en) Method for fast obtaining position character description information according to latitude and longitude data
CN106205161A (en) traffic information transmission method and device
CN106931985B (en) Scenic spot intelligent planning tourist guide path system and method based on hand-drawing map
CN106557474A (en) Obtain the method and device of POI, database, navigation terminal and automobile on the way
CN108362298A (en) Air navigation aid and device in area map
CN103020098A (en) Navigation service searching method with speech recognition function
CN103323017B (en) A kind of air navigation aid and guider
CN109271591A (en) Recommending scenery spot method, computer equipment and computer readable storage medium
CN105426375A (en) Relationship network calculation method and apparatus
CN106767863A (en) A kind of method and system of share-car trip route navigation
CN102902689A (en) Application of matching method and system based on traveling line geometrical characteristics to social network
CN109857947A (en) A kind of broadband installation site selecting method and system based on GIS map
CN105424045A (en) Road network building and pathfinding method for indoor cross-layer pathfinding
CN104978376A (en) Method and system for tracking sharing path comments
CN106708837A (en) Interest point search method and device
CN109472416B (en) Indoor path planning method and device based on automatic road network data extraction, and client

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.