KR101710985B1 - Apparatus and method for searching path in interior space using ble technology - Google Patents

Abstract

An apparatus and method for searching for a path in an indoor space based on BLE (Bluetooth Low Energy) technology is disclosed. The path searching apparatus includes a step of collecting beacon node information installed in a room and link information indicating a connection between two arbitrary adjacent beacons, Calculating a link cost between any two neighboring beacons using the number of identified user terminals, determining a minimum link cost based on the calculated link cost and the collected link information, Searching for a path having a cost, and transmitting the retrieved path to a requesting user terminal.

Description

[0001] APPARATUS AND METHOD FOR SEARCHING PATH IN INTERIOR SPACE USING BLE TECHNOLOGY [0002]

More particularly, the present invention relates to an apparatus and method for searching for a path in an indoor space based on BLE (Bluetooth Low Energy) technology. More specifically, the present invention relates to an apparatus and method for searching for a shortest path Thereby providing a path searching apparatus and method in an indoor space.

Currently, various location based services are provided in the outdoor environment using smart phones and GPS. Examples include car navigation and smartphone map applications. However, as the performance of the smartphone gradually improves, the smartphone is perceived to be a device which plays the role of a personal secretary more than a simple telephone to the users.

Therefore, despite the fact that users often use the smartphone indoors as well as outdoors, indoor location tracking technology is not yet activated. Location based services using GPS are not available indoors, and location based services using NFC local communication technology are also slow to spread. Therefore, a new technology for a location-based service in a room has become necessary.

The present invention relates to an apparatus and method for searching for a path in an indoor space based on BLE (Bluetooth Low Energy) technology. In order to overcome the disadvantages described above, By applying the information to the shortest path search algorithm, it is possible to search the path in the indoor space.

According to an embodiment of the present invention, a path search method in an indoor space performed by a server includes collecting link information indicating beacon node information installed in an indoor space and connection between two adjacent beacons, Identifying a user terminal that is located near a respective beacon node for a predetermined period of time using a predetermined number of user terminals, calculating a link cost between two adjacent beacons using the number of the identified user terminals, Searching for a path having a minimum cost based on the calculated link cost and the collected link information, and transmitting the retrieved path to the requesting user terminal.

Wherein the collected beacon node information includes at least one of a current time, identification information of each beacon, identification information of the user terminal, and location information of the user terminal, and the identification information of the user terminal includes an ESN (Electronic Serial Number) , An International Mobile Equipment Identity (IMEI), a Mobile Equipment Identifier (MEID), and a MAC ID.

Wherein the calculating step calculates a link cost using the number of user terminals located in the vicinity of any two beacons when there is a link between any two beacons, If it does not exist, the link cost can be calculated infinitely.

Wherein the searching comprises defining a set of beacon nodes with a minimum path cost determined, initializing the defined set to an empty set, determining if the set of beacon nodes with the minimum path cost is all beacons of the collected beacon node information And searching for the path until it includes the node.

The apparatus for searching a path in an indoor space according to an embodiment of the present invention includes a collecting unit for collecting beacon node information installed in a room and link information indicating a connection between two adjacent beacons, A confirmation unit for confirming a user terminal having a predetermined signal strength or more located near each beacon node for a predetermined period of time using the number of user terminals and a link cost calculating unit for calculating a link cost between any two adjacent beacons using the number of the identified user terminals, A searching unit searching for a path having a minimum cost based on the calculated link cost and the collected link information, and a transmitting unit transmitting the retrieved path to the requesting user terminal.

According to an embodiment of the present invention, an apparatus and a method for searching for a path in an indoor space are provided by applying information acquired using a beacon based on BLE technology to an algorithm capable of searching for a shortest path.

FIG. 1 illustrates a route search apparatus according to an embodiment of the present invention.
FIG. 2 illustrates a process of moving information collected in a beacon in a route search apparatus according to an exemplary embodiment.
FIG. 3 is a flowchart illustrating a route search method according to an exemplary embodiment of the present invention.
FIG. 4 illustrates an example of a shortest path search algorithm according to an embodiment.
FIG. 5 illustrates an example of a shortest path search algorithm according to an embodiment.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

FIG. 1 illustrates a route search apparatus according to an embodiment of the present invention.

The path searching apparatus 100 according to an embodiment may include a database 110, a collecting unit 120, an identifying unit 130, a calculating unit 140, a searching unit 150, and a transmitting unit 160 have.

The database 110 may store beacon node information and link information. The beacon node information may be obtained from a plurality of BLE beacons applying the BLE technology installed in the indoor space, and the beacon node information may include at least one of a current time located around the BLE beacon, identification information of each BLE beacon, identification information of the user terminal, And location information of the terminal. At this time, the identification information of the user terminal may include at least one of an electronic serial number (ESN), an International Mobile Equipment Identity (IMEI), a Mobile Equipment Identifier (MEID), and a MAC ID. The link information may refer to a connection between any two adjacent BLE beacons. That is, if there is a link when two adjacent BLE beacons are connected to the corridor in the indoor space, and there is a wall between two adjacent BLE beacons, there may be no link.

The collecting unit 120 may collect beacon node information and link information from the database 110. At this time, the beacon node information and the link information collected may be beacon node information and link information existing in one layer or beacon node information and link information existing in a plurality of layers, if necessary.

The confirmation unit 130 can identify the user terminal that is located near each BLE beacon and has a predetermined signal strength for a predetermined time using the collected beacon node information collected by the collection unit 120. [ The collected beacon node information may include at least one of a current time at which the user terminal is located around the BLE beacon, identification information of each BLE beacon, identification information of the user terminal, and location information of the user terminal. Accordingly, the confirmation unit 130 can confirm the number of user terminals located near each BLE beacon for a predetermined time through the collected beacon node information. At this time, the user terminal identified in the beacon node information collected through each BLE beacon may include a user terminal having a predetermined signal strength or more. By defining a user terminal identified through each BLE beacon through a predetermined signal strength, one user terminal can be prevented from identifying a plurality of BLE beacons.

The calculation unit 140 can calculate the link cost between any two adjacent BLE beacons using the number of user terminals near each BLE beacon confirmed by the confirmation unit 130. [ The link cost can mean the congestion between any two adjacent BLE beacons. That is, the larger the value of the link cost, the higher the congestion and the longer the time travels through the path between the two BLE beacons. Conversely, the smaller the link cost value, the lower the congestion and the time to travel through the path between the two BLE beacons may be shortened. At this time, the link cost between any two BLE beacons can be expressed by Equation 1 below.

는 실내 공간에 배치된 다수의 BLE 비콘들 중에서 임의의 BLE 비콘을 의미할 수 있다. 예를 들어,

에서 인덱스 i의 범위하는 i=1,..., M은 BLE 비콘의 총 수를 의미할 수 있다. 링크비용(C)은 임의의 두 BLE 비콘 사이의 비용(Cost)를 의미할 수 있고 수학식 1을 보면 알 수 있듯이, 링크 비용(C)은 각 링크에 분포하는 사용자 단말의 개수에 비례할 수 있다. 여기서, 계산부(140)는 링크를 구성하는 임의의 두 BLE 비콘 사이에 통로가 있는 경우 링크가 있는 것으로 판단하여 상기 수학식 1을 통해 링크 비용을 계산할 수 있다. 반면에, 링크를 구성하는 임의의 두 BLE 비콘 사이에 통로가 없는 경우 링크가 없는 것으로 판단하여 해당 링크의 비용을 무한대로 간주할 수 있다.At this time,

May refer to any BLE beacon among a plurality of BLE beacons disposed in the indoor space. E.g,

I = 1, ..., M in the range of the index i can mean the total number of BLE beacons. The link cost C may mean the cost between any two BLE beacons. As can be seen from Equation 1, the link cost C may be proportional to the number of user terminals distributed on each link have. Here, if there is a path between any two BLE beacons constituting the link, the calculation unit 140 determines that there is a link and calculates the link cost through Equation (1). On the other hand, if there is no path between any two BLE beacons constituting the link, it is determined that there is no link, and the cost of the link can be regarded as infinite.

The search unit 150 may search for a path having the minimum cost based on the beacon node information and the link information collected by the collecting unit 120 and the link cost calculated by the calculating unit 140. [ The search unit 150 may use a Dijkstra algorithm that can obtain the shortest path through path length calculation to search for a path having the minimum cost.

The transmission unit 160 may transmit the path having the minimum cost found in the search unit 150 to the user terminal. The user terminal can display the path having the minimum cost received by the transmission unit 160 through the specific application.

FIG. 2 illustrates a process of moving information collected in a beacon in a route search apparatus according to an exemplary embodiment.

A plurality of BLE beacons 210 to which the BLE technology is applied can be installed at unspecified locations in the indoor space. The BLE beacon 210 can continuously emit its identification information and Received Signal Strength Indication (RSSI) values as a signal. The user terminal 200 carried by the user can recognize a signal emitted by each BLE beacon 210 according to the position of the user. The user terminal 200 may receive the signal of the BLE beacon 210 having a predetermined RSSI value or more and transmit the information required for the path search to the path searching apparatus 100 through the communication communication network 220. [ At this time, the necessary information may include information such as the current time that the user terminal 200 is located around the BLE beacon 210, the identification information of each BLE beacon 210, the identification information of the user terminal 200, The location information of the mobile terminal 100 may include at least one of location information of the mobile terminal.

The path searching apparatus 100 may search for a path having a minimum cost requested by the user terminal 200 based on the information required for the path search transmitted from the user terminal 200 and may transmit the path to the user terminal 200.

FIG. 3 is a flowchart illustrating a route search method according to an exemplary embodiment of the present invention.

In step 300, the path searching apparatus 100 may collect beacon node information and link information stored in the database 110. The beacon node information may be collected from the BLE beacon 210 based on the BLE technology. The BLE beacon 210 may be installed at an indefinite position in the room, and may continuously emit its identification information and RSSI value. The user terminal 200 may receive the signal of the BLE beacon 210 having a predetermined RSSI value or more and transmit the signal to the path searching apparatus 100 through the communication network 220. [ At this time, the path searching apparatus 100 searches the path searching apparatus 100 for a current time, which is located around the BLE beacon 210, identification information of each BLE beacon 210, identification information of the user terminal 200, And may receive at least one of the position information of the user terminal 200.

In step 310, the path searching apparatus 100 can confirm the number of user terminals in the vicinity of each BLE beacon. The path searching apparatus 100 can recognize the number of user terminals 200 having a RSSI value equal to or greater than a preset RSSI value by using the beacon node information stored in the database 110. [

In step 320, the path searching apparatus 100 may calculate the link cost between any two adjacent BLE beacons using the number of user terminals near each BLE beacon identified in step 310. [ The link information may refer to a connection between any two adjacent BLE beacons, and if there is no path between any two BLE beacons constituting the link, it is determined that there is no link and the cost of that link may be regarded as infinite . On the other hand, if there is a path between any two BLE beacons constituting the link, it is determined that there is a link and the link cost can be calculated through Equation (1). The link cost can mean the congestion between any two adjacent BLE beacons. That is, the larger the value of the link cost, the higher the congestion and the longer the time travels through the path between the two BLE beacons. Conversely, the smaller the link cost value, the lower the congestion and the time to travel through the path between the two BLE beacons may be shortened.

The path searching apparatus 100 may search for a path having the minimum cost based on the beacon node information and the link information collected in step 300 and the link cost calculated in step 320 in step 330. [ The path searching apparatus 100 may use a Dijkstra algorithm that can find the shortest path through path length calculation to search for a path having the least cost.

First, a beacon node set can be defined and then the beacon node set can be initialized to an empty set. The beacon node set may then retrieve the path until all beacon nodes of the beacon node information collected in step 300 are included. If the beacon node set includes all the beacon nodes of the beacon node information collected in step 300, the path search may be completed.

If the beacon node set does not include all the beacon nodes of the collected beacon node information in step 300, the path search can be performed using Equation (2) below.

는 경로의 시작 비콘 노드로부터 임의의 비콘 노드(시작 비콘 노드 제외)까지의 경로 비용을 의미할 수 있으며,

는 비콘 노드

과 비콘 노드

사이의 링크 비용을 의미한다. 경로 검색 장치(100)는 비콘 노드 집합이 단계(300)에서 수집된 비콘 노드 정보의 모든 비콘 노드를 포함할 때까지 경로 검색 수행할 수 있다. here,

May denote the path cost from the start beacon node of the path to any beacon node (except the start beacon node)

Beacon node

And beacon node

Lt; / RTI > link cost. The path searching apparatus 100 can perform the path search until the beacon node set includes all of the beacon nodes of the beacon node information collected in step 300. [

In step 340, the path searching apparatus 100 may transmit the path having the minimum cost found through the step 330 to the user terminal 200 requesting the path search. The user terminal 200 can display a path having the minimum cost transmitted by the path searching apparatus 100 through the application in the user terminal 200. [

FIGS. 4 and 5 illustrate an example of a shortest path search algorithm according to an embodiment.

The path searching apparatus 100 may use a multi-extrude algorithm capable of finding a shortest path through path length calculation to search for a path having a minimum cost required by a user.

In FIGS. 4 and 5, there are various paths that the path searching apparatus 100 can go from the 0th beacon node to the 3rd beacon node. The path searching apparatus 100 can obtain information necessary for searching for a path having the least cost by using a multi-extensional algorithm. At this time, the necessary information may be information including at least one of the beacon node information and link information collected by the collecting unit 120 and the link cost calculated by the calculating unit 140.

According to one embodiment, in the identification number (a), the path search apparatus 100 may define the beacon node set as S and initialize it as an empty set. The path cost to any beacon node based on the start beacon node 0 is equal to the path cost which is the sum of the link cost between the start beacon node and any beacon node. In this case, since the beacon nodes 2, 3, and 6 are not connected to the start beacon node 0, the path cost is equal to infinity. This is because if there is no path between any two BLE beacons constituting the link, it is judged that there is no link and the cost of the link is regarded as infinite.

In the identification number (b), the path searching apparatus 100 can connect to the fourth beacon node having the smallest path cost among beacon nodes connected to the current start beacon node 0. It is now possible to connect to beacon nodes 3 and 6 that were not previously associated with the starting beacon node 0. The important point here is that the path cost of beacon node 1 has been changed from 7 to 5. Before the beacon node 0 and the beacon node 4 are connected, the path cost for direct connection from the beacon node 0 to the beacon node 1 is 7. However, if we move to beacon node 1 through beacon node 4, the path cost is reduced to 5. Also, the path cost of beacon nodes # 3 and # 6 is reduced to 14 and 8 at infinity, respectively.

In the identification number (c), the path searching apparatus 100 can connect to the first beacon node having the smallest path cost among the beacon nodes not included in the beacon node set S. At this time, it is possible to connect to the second beacon node which is not connected to the 0th node. And the beacon node number 2 is also reduced to 9 from the existing infinity.

In the identification number (d), the path searching apparatus 100 can connect to beacon node # 6 having the smallest path cost among beacon nodes not included in the beacon node set S. [ At this time, the path cost of the third beacon node is 14 to 12.

In the identification number (e), the path searching apparatus 100 can connect to the second beacon node having the smallest path cost among the beacon nodes not included in the beacon node set S. At this time, the path cost of the third beacon node is reduced from 12 to 11.

In the identification number (f), the path searching apparatus 100 can connect to beacon node No. 5 having the smallest path cost among beacon nodes not included in the beacon node set S. [

Finally, at the identification number (g), the path searching apparatus 100 can connect to the third beacon node having the smallest path cost among the beacon nodes not included in the beacon node set S. [

4번

1번

2번

3번 비콘 노드가 될 수 있다.Now, the path searching apparatus 100 can complete the path search because the beacon node set S includes all the beacon nodes located on the path, and the path having the finally found minimum cost is 0

No. 4

number 1

No.2

3 beacon nodes.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the apparatus and components described in the embodiments may be implemented within a computer system, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable array (FPA) A programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.

The software may include a computer program, code, instructions, or a combination of one or more of the foregoing, and may be configured to configure the processing device to operate as desired or to process it collectively or collectively Device can be commanded. The software and / or data may be in the form of any type of machine, component, physical device, virtual equipment, computer storage media, or device , Or may be permanently or temporarily embodied in a transmitted signal wave. The software may be distributed over a networked computer system and stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.

The method according to an embodiment may be implemented in the form of a program command that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions to be recorded on the medium may be those specially designed and configured for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced. Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

100: Path search device
110: Database
120: collecting section
130:
140:
150:
160:
200: user terminal
210: BLE beacon
220: Mobile communication network

Claims (5)

Collecting beacon node information for a plurality of beacon nodes installed in one or more layers of a room and link information indicating a connection between any two adjacent beacon nodes among the plurality of beacon nodes;
Identifying a user terminal that is located near a beacon node and has a predetermined signal strength or more for a predetermined period of time using the collected beacon node information;
And if it is determined that there is a link between any adjacent two beacon nodes based on the collected link information in a corridor between the adjacent two beacon nodes, Calculating a link cost proportional to the number of distributed user terminals, the link cost indicating a congestion between any two adjacent beacons;
And if it is determined that there is no link between any adjacent two beacon nodes, the link between the adjacent two beacon nodes based on the collected link information, Calculating a cost at infinity;
Searching for a path having a minimum cost based on the calculated link cost and the collected link information; And
Transmitting the retrieved route to the requesting user terminal
Lt; / RTI >
Wherein the searching comprises:
If all the beacon nodes of the beacon node information are included in the beacon node set initialized to the empty set, the path search is completed,
If all the beacon nodes of the beacon node information are not included in the beacon node set, all the beacon nodes of the beacon node information are allocated to the beacon node by using the path cost from the start beacon node to the beacon node except for the start beacon node. Performs a path search until it is included in the set,
Wherein the path cost is determined based on a link cost between any two beacon nodes. The method according to claim 1,
The collected beacon node information includes at least one of:
A current time, identification information of each beacon, identification information of the user terminal, and location information of the user terminal,
Wherein the identification information of the user terminal comprises:
A path search method using at least one of an ESN (Electronic Serial Number), an IMEI (International Mobile Equipment Identity), a MEID (Mobile Equipment Identifier), and a MAC ID. delete delete A collecting unit collecting beacon node information for a plurality of beacon nodes installed in one or more layers of the indoor space and link information indicating a connection between any two adjacent beacon nodes among the plurality of beacon nodes;
A confirmation unit for confirming a user terminal which is located near the beacon node and has a predetermined signal intensity or more for a predetermined time using the collected beacon node information;
And if it is determined that there is a link between any adjacent two beacon nodes based on the collected link information in a corridor between the adjacent two beacon nodes, Calculating a link cost proportional to the number of distributed user terminals, the link cost representing a congestion between any two adjacent beacons, and determining, based on the collected link information, A calculator for calculating a link cost infinitely between the adjacent two beacon nodes when it is determined that there is no link between any adjacent two beacon nodes,
A search unit for searching for a path having a minimum cost based on the calculated link cost and the collected link information; And
A transmitting unit for transmitting the searched route to the requesting user terminal,
Lt; / RTI >
The search unit may search,
If all the beacon nodes of the beacon node information are included in the beacon node set initialized to the empty set, the path search is completed,
If all the beacon nodes of the beacon node information are not included in the beacon node set, all the beacon nodes of the beacon node information are allocated to the beacon node by using the path cost from the start beacon node to the beacon node except for the start beacon node. Performs a path search until it is included in the set,
Wherein the path cost is determined based on a link cost between any two beacon nodes.

Images