CN114125711A - Indoor wireless equipment deployment method and system based on local search algorithm - Google Patents
Indoor wireless equipment deployment method and system based on local search algorithm Download PDFInfo
- Publication number
- CN114125711A CN114125711A CN202111385992.0A CN202111385992A CN114125711A CN 114125711 A CN114125711 A CN 114125711A CN 202111385992 A CN202111385992 A CN 202111385992A CN 114125711 A CN114125711 A CN 114125711A
- Authority
- CN
- China
- Prior art keywords
- deployment
- points
- target
- clauses
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/33—Services specially adapted for particular environments, situations or purposes for indoor environments, e.g. buildings
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an indoor wireless equipment deployment method and system based on a local search algorithm, relates to a wireless equipment deployment method, can quickly generate an equipment deployment scheme aiming at a specified target area on the premise of considering the influence of an obstacle on a signal, can flexibly set the signal quantity requirement received by each position and other constraint conditions, is not only suitable for solving a small area, but also suitable for deploying a large-scale area.
Description
Technical Field
The invention relates to a wireless device deployment method, in particular to an indoor wireless device deployment method based on a local search algorithm.
Background
With the rapid development of the internet of things and the mobile internet technology, the indoor positioning service has become a focus of attention in the current location service research field and industry. Indoor wireless equipment such as bluetooth equipment can provide the function of indoor location, however because receive in the indoor location environment influence such as many factors such as non-line of sight, multipath effect, the indoor space object such as barrier, wall body, furniture has great interference to the propagation of bluetooth signal. Therefore, how indoor wireless devices are deployed plays a crucial role in the effectiveness and accuracy of indoor positioning.
The existing wireless device deployment methods can be mainly divided into two types, and the first type is a geometric deployment method, such as a regular quadrilateral deployment method and a regular hexagon deployment method. The regular quadrilateral deployment method divides the whole area to be covered by an inscribed square of a circle, and the position of the center of each circle is the deployment position of the selected equipment. Similarly, the regular hexagon deployment divides the entire area by a regular hexagon, the center of which is the device deployment location. The second deployment method is to model the equipment deployment problem as a linear programming problem and then solve the problem by using an existing linear programming solver. For example, chinese patent application CN109963254A discloses a bluetooth positioning beacon deployment method based on an indoor map, the scheme of which is mainly to divide an indoor positioning area grid according to the indoor map, divide a positioning area according to an indoor space structure data type, and extract key nodes of the indoor positioning area; randomly generating a beacon deployment scheme according to a certain deployment rule according to the key nodes; and performing global optimization of Bluetooth beacon deployment by adopting a genetic algorithm to obtain an optimal deployment scheme.
The existing wireless device deployment method mainly has the following limitations:
1) most of the current deployment methods are directed to open areas, that is, assuming that there is no obstacle in the target area, the signal of the device can propagate unimpeded, so that the signal coverage of the device is circular at each position. However, the actual indoor environment is usually complex, and there are obstacles such as doors and windows, walls, etc., and the signal passes through these obstacles and then has a large attenuation, but the problem is not considered in the existing deployment mode, which may cause a large difference between the theoretical solution result and the actual effect.
2) Most of the current deployment methods can only ensure that each position is covered by at least one equipment signal, but in order to improve the precision, each position is expected to receive at least a plurality of signal information. At present, a geometric deployment method is researched and designed, so that signals of 4 devices can be received at each position, but the solution is complex, and the requirement of the minimum signal quantity cannot be set at will.
3) In the first type of geometry deployment, once the model is determined, it can only be used for one actual situation. When there are other device deployment requirements in other situations, their invention does not work well if the deployment requirements (e.g., the number of coverage per location) change.
4) The second type is modeling into a linear programming problem and then calling a linear programming solver to do so. The linear programming solver is expensive, the code is closed, and personalized customization cannot be realized.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides an indoor wireless equipment deployment method based on a local search algorithm, which can quickly generate an equipment deployment scheme aiming at a specified target area on the premise of considering the influence of an obstacle on a signal, can flexibly set the requirement of the number of signals received at each position and other constraint conditions (such as the distance between any two pieces of equipment cannot be too close), and is not only suitable for solving a small area, but also suitable for deploying a large-scale area.
The invention adopts the following technical scheme:
an indoor wireless equipment deployment method based on a local search algorithm comprises the following steps:
1) dividing an indoor target area according to grids, taking each intersection point of grid lines as a target point covered by at least k wireless equipment signals, and determining coordinates of the target point;
2) extracting three-dimensional space structure information of a target area and coordinate information of an obstacle, and processing to obtain a structure information graph of the target area;
3) constructing a coverage set aiming at each target point according to a structural information graph of a target area, wherein elements in the coverage set are candidate deployment points which are all other target points of the target point corresponding to the coverage set covered by the wireless equipment signal;
4) selecting any two candidate deployment points from the coverage set, wherein the distance between the two candidate deployment points is required to be greater than a preset value;
5) and 3) taking the steps 3) and 4) as two constraint conditions, selecting the minimum candidate deployment point from the coverage set of all target points through an optimization solution algorithm, and taking the minimum candidate deployment point as a deployment point for deploying the wireless equipment.
Further, the step of determining candidate deployment points is:
calculating the distance L between any two target points according to the coordinates of the target points;
according to the radius D of a signal coverage area of the wireless equipment, the attenuation distance D after each obstacle is encountered in signal propagation and the number of obstacles between two points, if L is less than or equal to D-m x D, the two target points are judged as candidate deployment points of each other, and the candidate deployment points are added into a coverage set.
Further, whether an obstacle exists between the two target points is judged according to whether a connecting line segment between the two target points in the structural information graph of the target area is intersected with the obstacle line segment.
Further, whether an obstacle exists between the two target points is judged through a rapid filtering method or a straddle experiment method; wherein the content of the first and second substances,
the rapid filtration method comprises the following steps: if the two line segments of the connecting line segment between the two target points and the barrier line segment are not intersected in the x-axis direction or in the y-axis direction, the two line segments are not intersected, otherwise, the two line segments are intersected;
a straddle experimental method: if two line segments, namely a connecting line segment between two target points and an obstacle line segment, span, namely two end points of one line segment are positioned at two ends of the other line segment, the two line segments are intersected; whether the straddling is judged by vector multiplication, and the method comprises the following steps: for the two line segments AB and CD, it is determined that the two line segments intersect if the following two vector equations (CA × CD) ((CB × CD) < ═ 0 and (AC × AB) ((AD × AB) < ═ 0, where × represents the vector product and × represents the digital product.
Further, the optimization solution algorithm comprises a dynamic weighting mechanism and a heuristic function, and the heuristic function is preferably a local search algorithm.
Further, the optimization solution algorithm is as follows: firstly, taking candidate deployment points in all coverage sets as variables, giving a weight value to each variable randomly or greedily, and constructing an initial solution; then the algorithm enters a loop, the current solution is iteratively improved in the loop until a termination condition is reached, and the found optimal solution is returned; in the cyclic process of the algorithm, if a better solution is found, the current optimal solution is updated, otherwise, the algorithm selects a variable to turn over and endows a weight value; and if the algorithm enters local optimization and the variable cannot be selected, updating the weight according to a dynamic weighting mechanism weighting-PMS, randomly selecting a variable and turning the weight value given by the variable.
Further, the method is realized by engineering through the following four steps:
1) problem modeling step: modeling an indoor wireless device deployment problem into an extended maximum satisfiability problem, comprising the specific steps of:
1.1) divide the target area into a grid of d, each intersection of the grid lines as a target point covered by k wireless devices, the set of target points being denoted as { x }1,x2,…,xnIn which xiX represents the deployment of a wireless device on the candidate deployment pointi0 represents no device deployed on the candidate deployment point;
1.2) modeling by defining hard clauses, let set
For each coverage target point xiFor each target point xiThe following hard clauses were constructed:
wherein V represents an extraction; the meaning of this formula is that at least k target points are true;
1.3) two candidate deployment points x are defined by constructing the following hard clausesiAnd xjWhen the minimum distance between the two is not less than d, the two are deployed simultaneouslyLine equipment, wireless equipment is not deployed simultaneously when hour d:
in the formula (I), the compound is shown in the specification,
represents the operator NOT;
1.4) for each candidate deployment point xiConstructing a soft clause:
in the form of soft clausesiIs shown in position
Without deployment of wireless devices, λ(s)i) As soft clauses siIf the soft clause is not satisfied, i.e. at siCalculating a penalty value according to the weight if the wireless equipment is deployed;
establishing constraint conditions through the hard clauses and the soft clauses constructed in the steps 1.2), 1.3) and 1.4);
2) a data preparation step:
2.1) drawing the three-dimensional space structure information of the target area and the coordinate information of the obstacle in a CAD file in advance, and analyzing the information from the CAD file when in use;
2.2) modeling according to the information analyzed by the CAD file and the constraint conditions established in the step 1), and determining the coordinates of the target points and the coverage set of each target point;
2.3) outputting constraint condition data according to a specified format, wherein each line corresponds to a clause representing the constraint condition, and the specified output format of each line is as follows: the weight of the clauses, at least how many characters in the clauses need to be true, and which characters are related in the clauses;
3) algorithm design and implementation steps: firstly, calculating the weight and penalty value of a clause, and scoring a variable, wherein the score is the sum of all self-inhabited penalty values reduced by turning over the assignment of the variable; secondly, guiding a local search algorithm to search according to the scores, searching out a solution which meets the hard clause and has the minimum punishment value, and obtaining a deployment scheme which uses the minimum number of wireless devices under the condition that each point is covered at least k times; finally, when the local search algorithm is in local optimum, updating the weight of the clause according to a dynamic weighting mechanism weighting-PMS;
4) a tool step: and making a visualization tool, inputting the CAD file and the constraint condition parameters of the target area, and generating a visualized wireless device deployment scheme aiming at the target area.
Further, the dynamic weighting mechanism weighting-PMS is as follows:
the weight for all unsatisfied hard clauses is increased by 1;
the weight for all unsatisfied soft clauses with weights less than 1000 is increased by 1.
An indoor wireless device deployment system based on a local search algorithm comprises a memory on which a computer program is stored and a processor which, when executing the program, implements the steps of the above method.
A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned method.
Drawings
FIG. 1 is a flow chart of an indoor wireless device deployment method based on a local search algorithm according to the present invention
Fig. 2 is a flow chart of an engineering implementation of an indoor wireless device deployment method based on a local search algorithm according to the present invention.
FIG. 3 is a schematic diagram of the present invention for determining whether two straight lines straddle by vector multiplication.
Detailed Description
In order to make the aforementioned and other features and advantages of the invention more comprehensible, embodiments accompanied with figures are described in detail below.
The invention discloses an indoor wireless equipment deployment method based on a local search algorithm, the flow of which is shown in figure 1, and the method specifically comprises the following steps:
1) dividing an indoor target area according to grids, taking each intersection point of grid lines as a target point covered by at least k wireless equipment signals, and determining coordinates of the target point;
2) extracting three-dimensional space structure information of a target area and coordinate information of an obstacle, and processing to obtain a structure information graph of the target area;
3) constructing a coverage set aiming at each target point according to a structural information graph of a target area, wherein elements in the coverage set are candidate deployment points which are all other target points of the target point corresponding to the coverage set covered by the wireless equipment signal;
4) selecting any two candidate deployment points from the coverage set, wherein the distance between the two candidate deployment points is required to be greater than a preset value;
5) and 3) taking the steps 3) and 4) as two constraint conditions, selecting the minimum candidate deployment point from the coverage set of all target points through an optimization solution algorithm, and taking the minimum candidate deployment point as a deployment point for deploying the wireless equipment.
In a specific embodiment, the overall process of the engineering implementation of the method of the present invention includes four steps of problem modeling, data preparation, algorithm design and implementation, and tool, the core work is mainly in the data preparation and algorithm design part, as shown in fig. 2, and each step is detailed as follows:
firstly, problem modeling: the indoor wireless device deployment problem is modeled as an extended maximum satisfiability problem.
Hard clauses and soft clauses are defined in the extended maximum satisfiability problem: hard clause c: ({ l)1∨…∨lmK) for the set l1∨…∨lmAt least k of m words in the Chinese character are true. Soft clause s: ({ l)1∨…∨lm-if there are less than k true words in k), a penalty value is introduced: dependency [ s ]]＝λ(s)*(k-sum[s]). Wherein sum [ s ]]＝l1+l2+…+lmAnd λ(s) is the weight of the soft clause. As described aboveHard clauses and soft clauses are expressed using a master disjunctive normal form, l represents text, and V represents disjunctions. Given an extended maximum satisfiable problem instance, which contains a series of hard and soft clauses, the goal is to find a variable assignment such that all hard clauses are satisfied (i.e., at least k are true) and the sum of all unsatisfied soft clause penalty values is minimal.
The specific modeling method for modeling the minimum equipment deployment problem into the expanded maximum satisfiability problem is as follows:
(1) dividing the target area by a grid with the side length of d, wherein each intersection point of grid lines is used as a target point to be covered by k wireless devices. While each target point is also a candidate deployment point for deploying the wireless device. For convenience, the points are labeled x sequentially from left to right, top to bottom, in that order1,x2,…,xn。xiX represents the deployment of a wireless device on the candidate deployment pointi0 represents that no device is deployed at the candidate deployment point.
(2) Hard clause modeling 1: since each target point xiAt least needs to be covered by k wireless devices. Order set
For all the coverable target points xiThe set of candidate deployment points. For each target point xiThe following hard clauses were constructed:
the above-mentioned formula is shown in the specification,
the representation may cover point xiRequiring each point to be covered by at least k wireless devices, with hard clause ciIndicating that there are at least k wordsIs true (value is 1), i.e.
At least k of which are 1.
(3) Hard clause modeling 2: in practice, if two devices are deployed too far apart, mutual signal interference can occur. It is therefore desirable to limit the minimum distance d between deployed devices. Thus for any two candidate deployment points xiAnd xjIf the distance between them is less than d, then the two candidate deployment points may not deploy the device at the same time. The following hard clauses were constructed:
the above-mentioned formula is shown in the specification,
the operator "not" is represented in a disjunctive normal form; this hard clause represents the deployment point x for any two candidatesiAnd xjIf the distance between them is less than d, it is required that the two points cannot deploy the device at the same time. From the truth table it can be seen that only xiAnd xjWhen not true at the same time, the hard clause can be satisfied.
(4) Modeling soft clauses: the optimization goal of the method is to hope to meet the above hard constraints with as little equipment as possible. Thus for each deployment point xiConstructing a soft clause:
the above expression, soft clause siIs shown in position
Without deployment of wireless devices, λ(s)i) As soft clauses siIf the soft clause is not satisfied, i.e. at siThe device is deployed, then according to thisThe weights calculate penalty values.
According to the mode, the corresponding data are modeled into an expanded maximum satisfiability problem, and a series of hard clauses and soft clauses are obtained, namely an expanded maximum satisfiability problem example.
Secondly, preparing data: and reading the CAD file of the designated area, extracting the structural information of the target area from the CAD file, and generating constraint condition data. The method mainly comprises two tasks: CAD file parsing and constraint data modeling.
1) CAD file parsing
The dxfgrabber library in python is used to analyze the CAD drawing stored in the DXF format, and the structure information of the target area, the coordinate information of the obstacle, and the like are extracted from the drawing layer of the partition such as the wall, the door, the window, and the like. And processing the extracted original information to generate a structural information graph of the target area. DXF is a CAD data file format developed by Autodesk for CAD data exchange between AutoCAD and other software, and its interior is ASCII code, so that different types of computers can exchange DXF files to achieve the purpose of exchanging graphics. The Dxfgrabber is a library provided by python and used for reading the DXF file, and can conveniently read layers, entities and the like in the DXF file.
2) Constraint data modeling
And performing data modeling on the constraint conditions on the basis of the CAD analysis result to generate a constraint condition data file as the input of a subsequent algorithm.
The main objective of the invention is to flexibly set the signal quantity requirement to be received by each position and to rapidly produce the equipment deployment scheme. Among the most critical constraints are: the main steps for data modeling of this constraint are as follows:
(1) determining coordinates x of a target pointi: the problem modeling module divides the target area into grids and generates a target point set, and only on the basis, a coordinate system is established to determine the coordinates of each target point.
(2) Determining each target point xiOfSet of lids Si: first assume that the effective coverage area of a device is a circle centered at the device and having a radius of D. And assume that the signal travels a distance d after encountering an obstacle (e.g., a wall) in that direction. For any two target points xiAnd xjThe actual distance between them can be calculated from their actual coordinates as L, assuming that the number of obstacles between them is m. If L is less than or equal to D-m.d, x is addediJoining to the overlay set SjIn (1), xjJoining to the overlay set SiIn (x)iAnd xjEach being a candidate deployment point). And traversing all the point pairs to obtain a coverage set corresponding to each target point.
Where the parameter D, d needs to be actually measured based on the equipment and actual obstacle conditions. Whether an obstacle exists between any two target points is judged by judging whether a connecting line segment of the two points is intersected with an obstacle line segment, wherein the position information of the obstacle line segment is obtained by a CAD file analysis module. The specific method comprises the following steps:
a rapid filtration method: two line segments do not intersect if they do not intersect in the x-axis direction or in the y-axis direction. Taking the x-axis as an example, if the minimum x-coordinate of one line segment is larger than the maximum x-coordinate of the other line segment, the two line segments do not intersect in the x-axis direction.
A straddle experimental method: if two line segments intersect, then a stride is necessary. Straddling means that two end points of one line segment are at two ends of the other line segment. Whether the crossover is caused or not can be determined by the vector product, and if (CA × CD) (CB × CD) < ═ 0(× represents a vector product, and × represents a digital product), as shown in fig. 3, it is described that the directions of the vector CA and the vector CB with respect to the vector CD are different, and the points a and B are located on both sides of the CD, respectively. Similarly, it can be determined whether C and D are located on both sides of AB.
Therefore, if (CA × CD) ((CB × CD) < ═ 0 and (AC × AB) ((AD × AB) < ═ 0, the two line segments intersect.
(3) Outputting constraint condition data: and outputting constraint condition data according to a specified format, wherein each line corresponds to a clause representing the constraint condition. Each row specifies an output format as: the weight of the clause, at least how many characters in the clause need to be true, and which characters are involved in the clause. The data are separated by spaces.
Thirdly, algorithm design and realization:
at present, a plurality of algorithms for solving the set coverage problem exist, but the algorithms cannot be well adapted to various requirements in practical situations. The invention designs an expanded solving algorithm of the maximum satisfiability problem. The algorithm belongs to a heuristic search algorithm, and comprises a dynamic weighting mechanism and a heuristic function. The local search algorithm framework is as follows:
the local search algorithm is a heuristic function that solves the optimization problem. Firstly, an initial solution is randomly or greedily constructed, then the algorithm enters a loop, the current solution is iteratively improved in the loop until a termination condition is reached, and finally the best solution found in the process is returned. In the course of iterative improvement, the algorithm will perform a local operation once at a time to change the current solution.
The input to the present algorithm is the maximum satisfiability problem example of the above-described encoded extension. Wherein the variable is x1,x2,…,xn. In the initialization stage, each variable is randomly assigned with 0 and 1, wherein 0 represents no deployment and 1 represents deployment, so that an initial solution is constructed. The algorithm then enters a loop to iteratively refine the current solution. In the algorithm loop process, whenever a better solution is found, the optimal solution is updated. Otherwise, the algorithm selects a variable to flip its assignment, i.e. from 0 to 1 or from 1 to 0, according to a heuristic function. If the algorithm enters local optimization, namely when the variables cannot be selected according to the heuristic function, the algorithm updates the weights according to a dynamic weighting mechanism weighting-PMS, then the algorithm randomly selects one variable and then turns over the assignment of the variable. The specific steps are described in detail below:
(1) weight of clause: for any clause c (which may be a hard clause or a soft clause), an integer w [ c ] is given as its weight. In the initial stage, the weight initialization of all clauses is 1.
(2) Penalty of clauses: for any clause c (which may be a hard clause and a soft clause), if it is unsatisfied, it introduces a penalty value:
penalty[c]＝w(c)*(k-sum[c])。
where sum [ c ] corresponds to the number of all genuine words in the clause, and m represents the number of clauses. If the clause is satisfied, then dependency [ c ] is 0.
(3) Score of the variables: for any variable x, its score [ x ] is the sum of the penalty values of all clauses reduced by flipping the variable's valuation. The scores are used for guiding a heuristic search algorithm to search, and a solution which meets the hard clause and has the punishment value as small as possible is searched. The problem is to use a deployment scenario with as few devices as possible, satisfying that each point is covered at least k times.
(4) Dynamic weighting mechanism weighting-PMS: whenever the algorithm falls into local optimum, i.e. no variable scores greater than 0. The algorithm will update the weight of the clause according to the following rule:
a) the weight for all unsatisfied hard clauses is increased by 1.
b) The weight for all unsatisfied soft clauses with weights less than 1000 is increased by 1.
The algorithm will cycle through until the cutoff time T is reached. Where T is a parameter considered to be given according to actual needs. The algorithm finally outputs a variable x1,x2,…,xnIs assigned to the global value. Wherein xiA device needs to be deployed at its corresponding coordinates for a point of 1. So there are as many devices as needed for a variable with a value of 1.
Fourthly, a tool module:
the module generates a visual tool which can be directly used by using an open-source Web framework Django, and inputs a CAD file of a target area and related constraint parameters, so that an equipment deployment scheme aiming at the area can be rapidly and visually generated. Django is an open-source Web application framework written by python, which is a framework that follows the MVC (model, view, controller) design pattern. By using the framework, the high-quality, easy-to-maintain and database-driven application program can be conveniently and quickly created. The tool is divided into a document uploading page and a result output page. And uploading the CAD file in the DXF format of the target area in the file uploading page, setting relevant parameters, and visually displaying the deployment result in a result page after clicking confirmation.
Although the present invention has been described with reference to the above embodiments, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. An indoor wireless equipment deployment method based on a local search algorithm is characterized by comprising the following steps:
1) dividing an indoor target area according to grids, taking each intersection point of grid lines as a target point covered by at least k wireless equipment signals, and determining coordinates of the target point;
2) extracting three-dimensional space structure information of a target area and coordinate information of an obstacle, and processing to obtain a structure information graph of the target area;
3) constructing a coverage set aiming at each target point according to a structural information graph of a target area, wherein elements in the coverage set are candidate deployment points which are all other target points of the target point corresponding to the coverage set covered by the wireless equipment signal;
4) selecting any two candidate deployment points from the coverage set, wherein the distance between the two candidate deployment points is required to be greater than a preset value;
5) and 3) taking the steps 3) and 4) as two constraint conditions, selecting the minimum candidate deployment point from the coverage set of all target points through an optimization solution algorithm, and taking the minimum candidate deployment point as a deployment point for deploying the wireless equipment.
2. The method of claim 1, wherein the step of determining candidate deployment points is:
calculating the distance L between any two target points according to the coordinates of the target points;
according to the radius D of a signal coverage area of the wireless equipment, the attenuation distance D after each obstacle is encountered in signal propagation and the number of obstacles between two points, if L is less than or equal to D-m x D, the two target points are judged as candidate deployment points of each other, and the candidate deployment points are added into a coverage set.
3. The method according to claim 1, wherein whether the obstacle exists between the two target points is determined according to whether a link segment between the two target points in the structural information map of the target area intersects with the obstacle segment.
4. The method of claim 3, wherein whether an obstacle exists between two target points is determined by a rapid filtering method or a transnational experimental method; wherein the content of the first and second substances,
the rapid filtration method comprises the following steps: if the two line segments of the connecting line segment between the two target points and the barrier line segment are not intersected in the x-axis direction or in the y-axis direction, the two line segments are not intersected, otherwise, the two line segments are intersected;
a straddle experimental method: if two line segments, namely a connecting line segment between two target points and an obstacle line segment, span, namely two end points of one line segment are positioned at two ends of the other line segment, the two line segments are intersected; whether the straddling is judged by vector multiplication, and the method comprises the following steps: for the two line segments AB and CD, it is determined that the two line segments intersect if the following two vector equations (CA × CD) ((CB × CD) < ═ 0 and (AC × AB) ((AD × AB) < ═ 0, where × represents the vector product and × represents the digital product.
5. The method of claim 1, wherein the optimization solution algorithm comprises a dynamic weighting mechanism and a heuristic function, the heuristic function preferably being a local search algorithm.
6. The method of claim 1, wherein the optimization solution algorithm is: firstly, taking candidate deployment points in all coverage sets as variables, giving a weight value to each variable randomly or greedily, and constructing an initial solution; then the algorithm enters a loop, the current solution is iteratively improved in the loop until a termination condition is reached, and the found optimal solution is returned; in the cyclic process of the algorithm, if a better solution is found, the current optimal solution is updated, otherwise, the algorithm selects a variable to turn over and endows a weight value; and if the algorithm enters local optimization and the variable cannot be selected, updating the weight according to a dynamic weighting mechanism weighting-PMS, randomly selecting a variable and turning the weight value given by the variable.
7. The method of claim 1, wherein the method is engineered by four steps comprising:
1) problem modeling step: modeling an indoor wireless device deployment problem into an extended maximum satisfiability problem, comprising the specific steps of:
1.1) divide the target area into a grid of d, each intersection of the grid lines as a target point covered by k wireless devices, the set of target points being denoted as { x }1,x2,…,xnIn which xiX represents the deployment of a wireless device on the candidate deployment pointi0 represents no device deployed on the candidate deployment point;
1.2) modeling by defining hard clauses, let set
For each coverage target point xiFor each target point xiThe following hard clauses were constructed:
wherein V represents an extraction; the meaning of this formula is that at least k target points are true;
1.3) two candidate deployment points x are defined by constructing the following hard clausesiAnd xjThe minimum distance between the wireless devices is not less than d, the wireless devices are deployed at the same time when d is hour, and the wireless devices are deployed at the same time when d is hour:
in the formula (I), the compound is shown in the specification,
represents the operator NOT;
1.4) for each candidate deployment point xiConstructing a soft clause:
in the form of soft clausesiIs shown in position
Without deployment of wireless devices, λ(s)i) As soft clauses siIf the soft clause is not satisfied, i.e. at siCalculating a penalty value according to the weight if the wireless equipment is deployed;
establishing constraint conditions through the hard clauses and the soft clauses constructed in the steps 1.2), 1.3) and 1.4);
2) a data preparation step:
2.1) drawing the three-dimensional space structure information of the target area and the coordinate information of the obstacle in a CAD file in advance, and analyzing the information from the CAD file when in use;
2.2) modeling according to the information analyzed by the CAD file and the constraint conditions established in the step 1), and determining the coordinates of the target points and the coverage set of each target point;
2.3) outputting constraint condition data according to a specified format, wherein each line corresponds to a clause representing the constraint condition, and the specified output format of each line is as follows: the weight of the clauses, at least how many characters in the clauses need to be true, and which characters are related in the clauses;
3) algorithm design and implementation steps: firstly, calculating the weight and penalty value of a clause, and scoring a variable, wherein the score is the sum of all self-inhabited penalty values reduced by turning over the assignment of the variable; secondly, guiding a local search algorithm to search according to the scores, searching out a solution which meets the hard clause and has the minimum punishment value, and obtaining a deployment scheme which uses the minimum number of wireless devices under the condition that each point is covered at least k times; finally, when the local search algorithm is in local optimum, updating the weight of the clause according to a dynamic weighting mechanism weighting-PMS;
4) a tool step: and making a visualization tool, inputting the CAD file and the constraint condition parameters of the target area, and generating a visualized wireless device deployment scheme aiming at the target area.
8. The method of claim 6 or 7, wherein the dynamic weighting mechanism weighting-PMS is:
the weight for all unsatisfied hard clauses is increased by 1;
the weight for all unsatisfied soft clauses with weights less than 1000 is increased by 1.
9. An indoor wireless device deployment system based on a local search algorithm, comprising a memory having stored thereon a computer program and a processor implementing the steps of the method according to any one of claims 1 to 8 when the processor executes the program.
10. A computer-readable storage medium, characterized in that a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111385992.0A CN114125711B (en) | 2021-11-22 | 2021-11-22 | Indoor wireless equipment deployment method and system based on local search algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111385992.0A CN114125711B (en) | 2021-11-22 | 2021-11-22 | Indoor wireless equipment deployment method and system based on local search algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114125711A true CN114125711A (en) | 2022-03-01 |
| CN114125711B CN114125711B (en) | 2022-10-14 |
Family
ID=80439112
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111385992.0A Active CN114125711B (en) | 2021-11-22 | 2021-11-22 | Indoor wireless equipment deployment method and system based on local search algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114125711B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009085786A1 (en) * | 2007-12-28 | 2009-07-09 | Boston Scientific Scimed, Inc. | Prosthesis loading delivery and deployment apparatus |
| CN109726479A (en) * | 2018-12-29 | 2019-05-07 | 南京宁麒智能计算芯片研究院有限公司 | A kind of dispositions method of network on three-dimensional chip vertical channel |
| CN110798351A (en) * | 2019-10-30 | 2020-02-14 | 云南电网有限责任公司信息中心 | Power grid fault detection point deployment method based on PSO and ant colony-genetic algorithm |
| CN112996009A (en) * | 2021-03-31 | 2021-06-18 | 建信金融科技有限责任公司 | Wireless device deployment method and device, electronic device and storage medium |
-
2021
- 2021-11-22 CN CN202111385992.0A patent/CN114125711B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009085786A1 (en) * | 2007-12-28 | 2009-07-09 | Boston Scientific Scimed, Inc. | Prosthesis loading delivery and deployment apparatus |
| CN109726479A (en) * | 2018-12-29 | 2019-05-07 | 南京宁麒智能计算芯片研究院有限公司 | A kind of dispositions method of network on three-dimensional chip vertical channel |
| CN110798351A (en) * | 2019-10-30 | 2020-02-14 | 云南电网有限责任公司信息中心 | Power grid fault detection point deployment method based on PSO and ant colony-genetic algorithm |
| CN112996009A (en) * | 2021-03-31 | 2021-06-18 | 建信金融科技有限责任公司 | Wireless device deployment method and device, electronic device and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 徐公国等: "基于多目标局部变异-自适应量子粒子群优化算法的复杂地形多传感器优化部署", 《兵工学报》 * |
| 谷雨等: "融合PSO和Powell的雷达组网反隐身部署优化算法", 《数据采集与处理》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114125711B (en) | 2022-10-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10937211B2 (en) | Automated parametrization of floor-plan sketches for multi-objective building optimization tasks | |
| CN111504325A (en) | Global path planning method based on weighted A-algorithm for expanding search neighborhood | |
| Asl et al. | BIM-based parametric building energy performance multi-objective optimization | |
| AlBahnassi et al. | Near real-time motion planning and simulation of cranes in construction: Framework and system architecture | |
| Li et al. | A dynamic feature information model for integrated manufacturing planning and optimization | |
| JP4893148B2 (en) | Shape simplification device and program used therefor | |
| CN112257137A (en) | Building structure BIM forward automatic design method based on Revit | |
| Fuhrimann et al. | Data-driven design: Exploring new structural forms using machine learning and graphic statics | |
| CN107563653A (en) | Multi-robot full-coverage task allocation method | |
| KR20160121997A (en) | Spatial knowledge extractor and extraction method | |
| Ashour | Optimizing creatively in multi-objective optimization | |
| CN104318618A (en) | Three-dimensional sectioning method of generalized tri-prism spatial data model | |
| Strobbe et al. | Toward a visual approach in the exploration of shape grammars | |
| CN110619187A (en) | Concrete dam construction scheme and resource conflict detection and adjustment method | |
| Keshavarzi et al. | Sketchopt: Sketch-based parametric model retrieval for generative design | |
| Claessens et al. | Spatial zoning for better structural topology design and performance | |
| Khan et al. | Determination of optimal path under approach and exit constraints | |
| CN114125711B (en) | Indoor wireless equipment deployment method and system based on local search algorithm | |
| van der Blom et al. | Multicriteria building spatial design with mixed integer evolutionary algorithms | |
| Morley et al. | Identification of invariant average weighted haul distance to simplify earthmoving simulation modeling in planning site grading operations | |
| CN114297929A (en) | Machine learning-fused radial basis function curved surface complex ore body modeling method and device | |
| Chen et al. | Developing an open python library for urban design optimisation-pyliburo | |
| CN102292749A (en) | System, method, and computer program product for determining a translation vector | |
| Brasebin et al. | Stochastic buildings generation to assist in the design of right to build plans | |
| Roh et al. | Improvement of ship design practice using a 3D CAD model of a hull structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |