PATENT CLAIM ANALYSIS

Application Number: 16322806
Application Type: Utility
Filing Date: 2019-02
Publication Date: 2019-06
Patent Classification: ["455", "456300"]

Abstract:
A method that exploits all of the uncertainties of the ranging measurements and the positions of the anchors is provided, so as to modify the position of the anchors and arrive at a minimal squared error in the ranging measurements. The result of the implementation of the method allows the position of one or more objects in a given space to be obtained precisely.

Claim (Index 1):
A method for determining the position of one or more objects able to move in a network, one or more objects being provided with an ability to measure distance to the other objects of the network, at least some of the coordinates of an object are known, wherein it comprises at least the following steps:\n defining a set of points Ai or anchors and the uncertainties associated with their coordinates, the coordinates of the anchors and the uncertainty as to the coordinates describing information on the position of the objects and the uncertainty as to this information, generating a set containing the estimated positions of the objects and defining an initial position of the points, measuring a set of distances between at least two objects Mi, Mj, with associated uncertainties, and executing the following steps: Step 1, for each object M i , calculate a displacement \u03b4 \u2192 \u2192 i = \u2211 j \u2208 R i \ue89e \u03b4 \u2192 j \u2192 i corresponding to the vector sum of the ranging or measurement displacements over the set of available ranging measurements toward the object M i  and induced on this object M i  by all of the other objects having a ranging measurement from said object M i , due to the relative ranging measurement r ij  between M i  and M j  and its uncertainty \u03c3 rij , with R i ={r ij } all of the available ranging measurements toward M i , and \u03b4 \u2192 -> i = \u2211 j \u2208 R i \ue89e \u03b4 \u2192 j \u2192 i \ue89e \ue89e where \ue89e \ue89e \u03b4 \u2192 j \u2192 i = \u03d5 \ue8a0 ( \u0394 ij , \u03c3 rij ) \ue89e M j \ue89e M i \u2192 \uf605 M j \ue89e M i \u2192 \uf606 with \u0394 ij  the coordinates of M j M i , \u03c6 is a given displacement function,\n Step 2, for each object M i , having an anchoring coordinate in a virtual anchor associated with a fixed anchor A i , calculate a return displacement value {right arrow over (a)} \u2192i  to this anchor, with {right arrow over (a)} \u2192i =\u03a8({right arrow over (A i M i )}+{right arrow over (\u03b4)} \u2192i ,{right arrow over (\u03c3)} Ai ), \u03a8 a displacement function, \n Step 3, apply, to each object M i , a displacement equal to the sum of the ranging displacement {right arrow over (\u03b4)} \u2192i  and the anchoring correction {right arrow over (a)} \u2192i  that were calculated previously, \n Step 4, calculate the square of the error term \u0394 tot 2  where \n \u0394 i 2 = \u2211 j \u2260 i \ue89e \u0394 ij 2 with \u0394 ij =r ij \u2212d(M i ,M j ), A is an error term between an estimation of the distance d(Mi, Mj) after displacement of the object in step 3 and the distance measurement provided by ranging devices on all of the nodes, compare this quantity with a stopping criterion defined beforehand by an operator if \u0394 tot 2 \u2264\u0394 fin 2 , or else max(|\u0394 ij |)<Maxdeviation,\n if this test is met, go to step 6, \n if not, Step 5, test whether a maximum number of iterations has been reached, \n if l<l max  then iterate l=l+1 and go to step 1, if not go to step 6, \n Step 6, end of the iterations, define the position of the objects corresponding to the best estimation of the actual position of the objects obtained for each object.

Metadata:
- Claim Count in Document: 20.0
- Percentile: 99.0
- Lexical Diversity: 1.59524
- Patent Class: 455.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['11628230', '15783908', '15918653', '13502113', '14495749']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6797987619266308
- 35 USC 102 Novelty (BERT): 0.5057265158878141
- Combined Prediction Score: 0.6623915373227491
- Mean Citation Score: 215.184784
- Max Citation Score: 245.1712
- Similarity Product: 177.1972675872803

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 0
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test