EP3610280A1 - Device and method for relative location of at least three nodes - Google Patents
Device and method for relative location of at least three nodesInfo
- Publication number
- EP3610280A1 EP3610280A1 EP17722846.7A EP17722846A EP3610280A1 EP 3610280 A1 EP3610280 A1 EP 3610280A1 EP 17722846 A EP17722846 A EP 17722846A EP 3610280 A1 EP3610280 A1 EP 3610280A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- node
- message
- time
- unit
- instant
- 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.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/0284—Relative positioning
- G01S5/0289—Relative positioning of multiple transceivers, e.g. in ad hoc networks
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/0009—Transmission of position information to remote stations
- G01S5/0072—Transmission between mobile stations, e.g. anti-collision systems
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
- G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
- G01S5/14—Determining absolute distances from a plurality of spaced points of known location
Definitions
- the invention relates to a device and a method for locating at least one node with respect to two other nodes.
- a field of application of the invention relates to devices comprising a plurality of telecommunication nodes exchanging messages with each other, in order to obtain position information from at least one of the nodes.
- the aim of the invention is to provide a device for positioning a third node with respect to a first and a second node by taking only the first node as a position reference.
- a first node is able to calculate its distance from a second node by exchanging with the second node a message and measuring the time of 'go and return the message.
- N the number of messages exchanged between the nodes to make it possible to calculate all the distances between these varies in N 2 .
- a device of this type is known, for example, from the document WO 2015/101 674, in which a beacon transmits a first message, a relay transmits a second message following reception of the first message, a sensor measures the instants of arrival of the messages from the beacon and the relay, and a position calculator determines the position of one of the beacon, the relay and the sensor, from the arrival time information and positions, known by the calculator , others among the beacon, the relay and the sensor.
- This system therefore requires knowing in advance the position of two of the nodes to know the position of a third node.
- US-B-6,300,903 and US-A-6,801,782 disclose systems for locating a mobile from four reference radios of known positions.
- Document FR-A-2 924 818 describes a radio localization system from an ad hoc network comprising at least a first master node, a plurality of second reference nodes, said plurality being greater than or equal to two if the network is plane and greater than or equal to three if the network is three-dimensional, the radiolocation system being adapted to determine the position of at least one transmitter, said free node , the master node being able to:
- This system requires during the localization phase an exchange of messages between the master node and each reference node and another exchange of messages to identify the distances between the pairs of reference nodes.
- WO 2005/081012 A1 describes a similar system in which an ad hoc network of four base stations is created. Each base station sends a UWB signal to the other three base stations and measures the arrival time of their responses, to calculate the distances between the four stations. The position of a target node is calculated by the fact that the target first sends a signal to the base stations and then that each base station sends a response signal to the target after a known delay of the target.
- a first object of the invention is a relative location device, comprising at least a first node, at least a second node and at least a third node, distant from each other,
- the first node (A) comprises a first unit (AER) for transmitting and receiving messages, able to trigger an exchange of first messages (M1, M2) to and from a second unit ( BER) for transmitting and receiving messages, present in the second node (B), the first node (A) comprising a first unit (AC) for calculating a first time (Tab) of the path of the first message (Ml). , M2) to go or return between the first node (A) and the second node (B), the first unit (AER) for transmitting and receiving being also able to transmit a third message (M5) containing a first information (INF1) indicating at least the first travel time (Tab).
- the third node (C) comprises a third unit (CER) for transmitting and receiving messages, the third or first unit (AER, CER) for transmitting and receiving messages being able to trigger an exchange of second messages (M3, M4) for going and returning with the first or third unit (CER, AER) of transmission and reception, the third node (C) or the first node (A) comprising a third calculating unit (CC) or the first calculating unit (CA), able to calculate a second path time (Tac) of the second message (M3, M4) to go or return between the third node (C) and the first node (A).
- CER third unit
- AER first unit
- CA first calculating unit
- the third unit (CER) for transmitting and receiving messages is able to receive the first messages of go and return (Ml, M2) and the third message (M5), the third node ( C) comprising a third time measuring unit (CMT) capable of measuring a first reception instant (Tl) of the first message (M1) to go and a second reception instant (T2) of the first message (M2) of return.
- CMT third time measuring unit
- the third computing unit (CC) is able to calculate a third path time (Tbc) of the first message (M2) returning from the second node (B) to the third node (C) from the first and second moments (T1, T2), the second path time (Tac) and the first information (INF1) indicating the first travel time (Tab), contained in the third message (M5).
- Tbc third path time of the first message (M2) returning from the second node (B) to the third node (C) from the first and second moments (T1, T2), the second path time (Tac) and the first information (INF1) indicating the first travel time (Tab), contained in the third message (M5).
- the first calculation unit (AC) and / or the third calculation unit (CC) is able to calculate a first distance (Dab) between the first node (A) and the second node (B) to from the first travel time (Tab) and / or the third calculation unit (CC) is able to calculate a second distance (Dac) between the first node (A) and the third node (C) from the second time ( Path Tac) and / or the first calculating unit (AC) is adapted to calculate a second distance (Dac) between the first node (A) and the third node (C) from the second path time (Tac) and or the third calculation unit (CC) is able to calculate a third distance (Dbc) between the second node (B) and the third node (C) from the third path time (Tbc).
- the number of messages transmitted in the device is proportional to the number of nodes.
- the invention makes use of the fact that the third node uses the exchange of forward and backward messages between the first and second nodes and initiates itself an exchange of messages with the first node to make it possible to know the three distances between the three nodes. nodes.
- the invention therefore implements collaborative messages as indicated above, in order to reduce the number of messages transmitted in the device.
- obtaining the three distances (Dab, Dac, Dbc) between the three nodes (A, B, C) requires only the exchange of five messages (Ml, M2, M3, M4 and M5).
- the relative location device comprises at least a fourth node (D),
- the first unit (AER) for transmitting and receiving messages of the first node (A) being able to trigger an exchange of fourth messages (M10, M20) to go and return with a fourth unit (DER) of transmission and receiving messages, present in the fourth node (D),
- the first calculation unit (AC) of the first node (A) being able to calculate a fourth travel time (Tad) of the fourth message (M10, M20) to go or return between the first node (A) and the fourth node (D), the first unit (AER) transmission and reception being able to transmit a fifth message (M50) containing a second information (INF2) indicating the fourth time (Tad) of the journey
- the third unit (CER) for transmitting and receiving messages being able to receive the fourth messages (M10, M20) to go and return and the fifth message (M50),
- the third time measurement unit (CMT) of the third node (C) being able to measure a third instant (T3) of reception of the fourth message (M10) to go and a fourth instant (T4) of reception of the fourth message (M20) ) back,
- the third calculation unit (CC) being able to calculate a fifth path time (Tdc) of the fourth message (M20) returning from the fourth node (D) to the third node (C) from the third and fourth instants (T3, T4), the second path time (Tac) and the second information (INF2) indicating the fourth path time (Tad) contained in the fifth message (M50).
- the first calculation unit (AC) and / or the third calculation unit (CC) is able to calculate a fourth distance (Dad) between the first node (A) and the fourth node (D) to starting from the fourth path time (Tad) and / or the third computing unit (CC) is able to calculate a fifth distance (Dde) between the third node (C) and the fourth node (D) from the fifth beat ( Tdc) of journey.
- the fifth message (M50) coincides with the third message (M5) and contains both the first information (INF1) indicating the first travel time (Tab) and the second information (INF2) indicating the fourth time (Tad) of journey.
- the first or third unit (AER, CER) for transmitting and receiving messages is capable of transmitting, after a second known delay (TRA) following the reception of the second message (M3) to go , the second message (M4) back, the second unit (BER) for transmitting and receiving messages of the second node (B) is able to transmit, after a first known delay (TRB) following the reception of the first message (M1) to go, the first message (M2) return, the first node (A) having a first time measurement unit (AMT) for measuring a fifth instant (T5) of transmission of the first message (Ml) to go through the first node (A) and a sixth instant (T6) of reception of the first message (M2) of return by the first node (A),
- TRA second known delay
- M3 second message
- M4 back
- the second unit (BER) for transmitting and receiving messages of the second node (B) is able to transmit, after a first known delay (TRB) following the reception of the first message (M1) to go
- the first calculation unit (AC) being able to calculate, from the fifth transmission instant (T5), the sixth reception instant (T6) and the first known delay (TRB), the first travel time (Tab) from the first message (M1) to go from the first node (A) to the second node (B) or from the first message (M2) back from the second node (B) to the first node (A),
- the third or first time measurement unit (CMT, AMT) being able to measure a seventh instant (T7) of transmission of the second message (M3) to go through the third or first node (C, A) and an eighth instant (T8) receiving the second message (M4) back by the third or first node (C, A),
- the third or first unit (CC, AC) for calculating the third or first node (C, A) being able to calculate, from the seventh instant (T7) of transmission, the eighth instant (T8) of reception and the second known delay (TRA), the second travel time (Tac) of the second message (M3) to go or the second message (M4) back between the first node (A) and the third node (C),
- the third calculation unit (CC) being able to calculate the third travel time (Tbc), starting from the second travel time (Tac), the first reception time (Tl), the second reception time (T2), the first known delay (TRB) and the first information (INF1) indicating the first travel time
- the fourth unit (DER) for transmitting and receiving messages of the fourth node (D) is capable of transmitting, after a fourth known delay (TRD) following the reception of the fourth message (M 10). to go, the fourth message (M20) back, the first time measurement unit (AMT) of the first node (A) being able to measure a ninth instant (T9) of transmission of the fourth message (M 10) to go through the first node (A) and a tenth instant ( T10) receiving the fourth message (M20) return by the first node (A), the first unit (AC) calculation being able to calculate, from the ninth instant (T9) issue, the tenth instant (T10 ) and the fourth known delay (TRD), the fourth path time (Tad) of the fourth message (M 10) to go from the first node (A) to the fourth node (D) or the fourth message (M20) of return of the fourth node (D) to the first node (A),
- the third calculation unit (CC) being able to calculate the fifth travel time (Tdc), starting from the third and fourth instants (T3, T4), of the second travel time (Tac), of the fourth known delay (TRD) and the second information (INF2) indicating the fourth path time (Tad) contained in the fifth message (M50).
- the second message to go (M3) is merged with the first message to go (M1) and / or the fourth message to go (M10) is merged with the first message to go ( ml).
- T6 is the sixth time of receipt
- T5 is the fifth transmission time and TRB is the first known delay.
- Tac is the second travel time
- T8 is the eighth instant of receipt
- T7 is the seventh time of issue
- TRA is the second known time
- T2 is the second reception instant
- Tl is the first reception instant
- Tab is the first travel time obtained from the first information (INF1) contained in the third message (M5)
- TRB is the first known delay
- Tac is the second journey time.
- T10 is the tenth instant of reception
- T9 is the ninth transmission instant
- TRD is the fourth known delay
- the fifth path time (Tdc) is equal to
- Tdc T4 - T3 - Tad - TRD + Tac
- Tdc is the fifth travel time
- T4 is the fourth receive time
- T3 is the third receive time
- Tad is the fourth travel time obtained from the second information (INF2) contained in the fifth message (M50, M5)
- TRD is the fourth known delay.
- the number of messages transmitted in the device following the addition of a fourth node (D) is only seven messages (M1, M2, M3, M4, M10, M20 and M5 or M50) for allow the exchange of five distances (Dab, Dac, Dbc, Dad and Dde). This confirms the linear growth of the number of messages with the number of nodes.
- a second object of the invention is a method for the relative location of at least one third node with respect to at least one first node and at least one second node, the first, second and third nodes being distant from one another.
- the first node (A) transmits a first message (Ml) to go, to which the second node (B) responds with a first message (M2) of return,
- the first node (A) calculates a first travel time (Tab) of the first departure message (Ml) or the first return message (M2) between the first node (A) and the second node (B),
- the first node (A) transmits a third message (M5) containing a first information (INF1) indicating at least the first travel time (Tab), the third or first node (C, A) transmits a second message (M3) d to go, to which the first or third node (A, C) responds with a second message (M4) back, the third or first node (C, A) calculates a second path time (Tac) of the second message (M3) to go or the second message (M4) of return between the third node (C) and the first node (A )
- the third node (C) receives the first message (M1) to go, the first message (M2) return and the third message (M5),
- the third node (C) measures a first reception instant (Tl) of the first message (Ml) to go and a second reception instant (T2) of the first message (M2) of return,
- the third node (C) calculates a third path time (Tbc) of the first message (M2) returning from the second node (B) to the third node (C) from the first and second instants (T1, T2) of the second travel time (Tac) and first information (INF1) indicating the first travel time (Tab), contained in the third message (M5).
- Tbc third path time of the first message (M2) returning from the second node (B) to the third node (C) from the first and second instants (T1, T2) of the second travel time (Tac) and first information (INF1) indicating the first travel time (Tab), contained in the third message (M5).
- FIG. 1 schematically represents a localization device comprising three nodes, according to one embodiment of the invention
- FIG. 2 is a diagram of the locating device comprising four nodes, according to another embodiment of the invention.
- FIG. 3 is a diagram of the locating device comprising four nodes, according to another embodiment of the invention.
- FIG. 4 diagrammatically represents a variant of the location device of FIG. 1,
- FIG. 5 diagrammatically represents a variant of the location device of FIG. 3.
- the nodes A, B, C and / or D and / or other nodes E, F are telecommunication nodes.
- Each node A, B, C, D or others comprises respectively at least one antenna ANTA, ANTB, ANTC, ANTD, transmission and reception of messages to and from the other nodes.
- the nodes are separated from each other in a medium, which is for example air.
- communication between nodes or between the antennas of the nodes is wireless, for example radio.
- the messages sent between the nodes can be for example messages of the pulse type or ultra-wide band.
- Each node is distinct from the other nodes and is located at a non-zero distance from the other nodes, distances that must be calculated for at least some.
- Each node may be for example a communicating terminal or a communicating object.
- Each node can be for example a positioning terminal, for positioning (calculate coordinates) or calculate one or more distances with respect to one or more other nodes.
- Each node may be or include a message transceiver.
- Each node may be contained in a housing or an envelope or container, which may be fixed by any suitable attachment means to an object, fixed or mobile, or be part of this object, fixed or mobile.
- Messages are sent in an omnidirectional way. Each message sent by a node is able to be received by the other nodes. Each message sent by one node can be addressed to all other nodes. Thus, a message sent by one node can be sent simultaneously to several other nodes.
- the transmission of the same message by one node to several other nodes is symbolized by a point and the reception of a message by one of the other nodes is symbolized by the tip of an arrow, the message being symbolized by a segment.
- Locating device and method of locating at least three nodes Firstly, reference is made below with reference to FIG. 1, the relative positioning device 1 in which three distinct nodes A, B, C are provided.
- a first message exchange M1, M2 is performed between the nodes A and B, making it possible to calculate the first tab travel time between them, and a second message exchange M3, M4 between the nodes C and A, making it possible to calculate the second travel time Tac between them.
- the first node A sends by its first message sending and receiving unit AER the first message M1 to go to the second node B and the third node C.
- the second node B receives, by its second message transmission and reception unit BER, the first message M1 to go and sends the first message M2 back to the first node A and the third node C.
- the first node A calculates by its first calculating unit AC the first path time Tab of the first message M1 to go from the first node A to the second node B or the first return message from the second node B to the first node A.
- the third node C receives by its third message sending and receiving unit CER the first message Ml of go, having been sent by the first node A, and the first message M2 of return having been sent by the second node B.
- the third node C measures, by its third time measurement unit CMT, a first instant T1 of receipt of the first message M1 to go and a second instant T2 of receipt of the first message M2 return.
- the third node C transmits, by its third unit CER of sending and receiving messages, the second message M3 to go.
- the second message M3 to go is received by the first transmitting and receiving AER unit of the first node A, which returns in response a second message M4 of return, which is received by the third unit CER of transmission and reception of the third node C.
- the third node C calculates, by its third calculation unit CC, the second path time Tac of the second message M3 to go from the third node C to the first node A or the second message M4 from the first node A to the first node. third node C.
- the first node A transmits, by its first transmitting and receiving AER unit, a third message M5 containing a first information INF1 indicating the first tab travel time.
- This third message M5 is received by the third transmission unit CER of transmission and reception of the third node C.
- This first information INF1 can be or comprise the first travel time Tab and / or a first distance Dab calculated from the first time of way Tab.
- the third node C calculates, by its third calculation unit CC, a third path time Tbc of the first message M2 returning from the second node B to the third node C from the first instant T1, the second instant T2, the second time Tac path and the first information INF1 indicating the first travel time Tab, contained in the third message M5.
- the first path time Tab makes it possible to calculate, in the first calculation unit AC and / or in the third calculation unit CC, a first distance Dab present between the first node A and the second node B. for example by multiplying this first path time Tab by the known propagation speed of the messages in the medium present between the nodes.
- the first AER unit for transmitting and receiving messages from the first node A sends the second message M4 back after a second known delay TRA after receiving the second message M3 to go through this first unit.
- EAR the first AER unit for transmitting and receiving messages from the first node A
- the second message sending and receiving unit BER of the second node B sends the first message M2 return after a first known delay TRB following receipt of the first message M1 to go through. this second BER unit.
- the first node A may comprise a first memory MEMA in which is pre-recorded the first known delay TRB and / or the second known delay TRA.
- the third node C comprises a third memory MEMC in which is pre-recorded the first known delay TRB and / or the second known delay TRA.
- the first node A comprises a first time measurement unit AMT for measuring a fifth transmission instant T5 of the first message M1 to go through the first node A and a sixth instant T6 of receiving the first message M2 back by the first node A.
- the first computing unit AC of the first node A calculates, from the fifth transmission instant T5, the sixth reception time T6 and the first known delay TRB, the first travel time Tab of the first message Ml to go from the first node A to the second node B or the first tab travel time of the first message M2 return from the second node B to the first node A.
- the third time measurement unit CMT of the third node C measures a seventh transmission instant T7 of the second message M3 to go through the third node C and an eighth instant T8 of reception of the second message M4 return by the third node C.
- the third computing unit CC of the third node C calculates, from the seventh transmission instant T7, the eighth instant T8 of reception and the second known delay TRA, the second time of travel Tac of the second message M3 to go from the third node C to the first node A or the second travel time Tac of the second message M4 back from the first node A to the third node C.
- the third calculation unit CC of the third node C calculates the third path time Tbc from the second path time Tac, the first reception time T1, the second reception time T2, the first known delay TRB and the first information INF1 indicating the first time Tab path, contained in the third message M5.
- the second path time Tac makes it possible to calculate, in the third calculation unit CC, the second distance Dac present between the first node A and the third node C, for example by multiplying this second path time Tac. by the known propagation speed of the messages in the medium present between the nodes.
- the third path time Tbc makes it possible to calculate, in the third calculation unit CC, the third distance Dbc present between the second node B and the third node C, for example by multiplying this third path time Tbc. by the known propagation speed of the messages in the medium present between the nodes.
- the calculation of the three travel times Tab, Tac, Tbc and / or the three distances Dab, Dac, Dbc between the three nodes A, B, C only requires the transmission of five messages M1, M2, M3, M4, M5.
- These travel times and / or distances can be used to calculate the position (or coordinates along one or more dimensions of the third node C and / or the second node B with respect to the first node A, which can serve as a reference position.
- location according to the invention can be part of a device for calculating the position of one or more of the nodes A, B, C.
- the position of A will be known as the origin of coordinates (0; 0)
- the invention may relate to three or more nodes of three nodes, such as also the node D, and / or the node E and / or the node F and / or others, with which the node A and / or B and / or C can exchange messages.
- Locating device and method of locating at least four nodes Below is described with reference to Figure 2, an embodiment of the relative locating device in which four distinct nodes A, B, C and D are provided.
- FIG. 2 The process described in Figure 1 for the third node C is performed in Figure 2 not only for the third node C, but also for the fourth node D.
- the first node A sends, by the first message transmission and reception unit AER, a fourth message M 10 to go, which message is received by a fourth unit DER for sending and receiving messages. of the fourth node D.
- the fourth node D transmits by its fourth message sending and receiving unit DER a fourth message M20 return.
- the first node A receives, by its first message transmission and reception AER unit, the fourth message M20 of return and calculates by its first calculation unit AC a fourth time Tad of the fourth message M 10 to go from the first node A at the fourth node D or a fourth path time Tad of the fourth message M20 returning from the fourth node D to the first node A.
- the fourth travel time Tad makes it possible to calculate, in the first calculation unit AC and / or in the third calculation unit CC, a fourth distance Dad present between the first node A and the fourth node B. for example by multiplying this fourth path time Tad by the known propagation speed of the messages in the medium present between the nodes.
- the first node A transmits by its first message transmission and reception AER unit a fifth message M50 containing a second information INF2 indicating the fourth path time Tad.
- This second information INF2 may be or comprise the fourth travel time Tad and / or the fourth distance Dad calculated.
- the fourth message M 10 to go and the fourth message M20 to return, as well as the fifth message M50, are received by the third message transmission and reception unit CER of the third node C.
- the third node C measuring by its third time measuring unit CMT a third instant T3 of receiving the fourth message M 10 to go and a fourth instant T4 of receiving the fourth message M20 of return.
- the third node C calculates, by its third calculation unit CC, a fifth path time Tdc of the fourth message M20 returning from the fourth node D to the third node C from the third instant T3 of reception, the fourth reception time T4, the second path time Tac and the second information INF2 indicating the fourth path time Tad, contained in the fifth message M50.
- the fifth travel time Tdc makes it possible to calculate, in the third calculation unit CC, a fifth distance Dde present between the third node C and the fourth node D, for example by multiplying this fifth time Tdc of the path by the known propagation speed of the messages in the medium present between the nodes.
- the fourth node D transmits, by its fourth transmission and reception unit DER messages, the fourth message M20 return after a fourth known delay TRD following the receipt of the fourth message M 10 to go by this fourth DER unit.
- the first node A may comprise a first memory MEMA in which is pre-recorded the fourth known delay TRD.
- the third node C comprises a third memory MEMC in which is pre-recorded the fourth known delay TRD.
- the first node A measures by its first time measurement unit AMT a ninth transmission time T9 of the fourth message M10 to go through the first node A and a tenth instant T10 of reception of the fourth message M20 back by the first node A.
- the first node A calculates by its first calculation unit AC, from the ninth transmission instant T9, the tenth reception time T10 and the fourth known delay TRD, the fourth travel time Tad of the fourth message M 10 to go from the first node A to the fourth node D or the fourth path time Tad of the fourth message M20 back from the fourth node D to the first node A.
- the third node C calculates, by its third calculation unit CC, the fifth path time Tdc from the third reception time T3, the fourth reception time T4, the second path time Tac, the fourth known delay TRD and the second information INF2 indicating the fourth path time Tad, contained in the fifth message M50.
- Tdc and / or five distances Dab, Dac, Dad, Dbc and Dde between the four nodes A, B, C, D only requires the transmission of eight messages M1, M2, M3, M4, M5, M50, MIO and M20.
- the invention may relate to four or more nodes of four nodes, such as also the node E and / or the node F and / or others, with which the node A and / or the node B and / or the node C and / or node D can exchange messages.
- FIG. 3 represents a four node localization device 1 conforming to that described above with reference to FIG. 2, but in which, according to a preferred embodiment, the third message M5 is replaced by the fifth message M50 or is confused with this one.
- the message M5 or M50 therefore contains both the first information INF1 indicating the first path time Tab and the second information INF2 indicating the fourth path time Tad.
- FIG. 4 represents a variant of the locating device 1 described above with reference to FIG. 1. What has been described above with reference to FIG. 1.
- FIG. 4 the role of the first node A and the third node C is exchanged with regard to the second message M3 to go, the second message M4 to return, the second time Tac to the path, the second known delay TRA, the seventh transmission T7 T7, the eighth T8 reception time. It is thus the first node A which sends by its unit AER the second message M3 to go to the third node C.
- the third node C responds to the second message M3 to go by sending the second message M4 back to the first node A.
- the AC unit of the first node A calculates the second path time Tac of the second message M3 to go from the first node A to the third node C or the second path time Tac of the second message M4 of the third node C at the first node A.
- the third message transmission and reception unit CER is able to transmit, after a second known delay TRA following the reception of the second message M3 to go, the second message M4 to return.
- the first time measurement unit AMT is able to measure a seventh instant T7 of transmission of the second message M3 to go through the first node A and an eighth instant T8 of reception of the second message M4 of return by the first node A.
- the first calculation unit AC of the first node A is able to calculate, from the seventh instant T7 of emission, the eighth instant T8 of reception and the second known delay TRA, the second time of travel Tac of the second message M3 to go from the first node A to the third node C or the second message M4 back from the third node C to the first node.
- the first transmitting and receiving AER unit is able to transmit the third message M5 containing a first information item INF1 indicating at least the first tab travel time and the second travel time Tac.
- the second message to go M3 is merged with the first message to go M1 and the first known delay TRB is chosen different from the second known delay TRA so that that the second return message M4 is sent by the third node C at a time different from the transmission of the first return message M2 by the second node B.
- the second known delay TRA is chosen to be greater than or equal to the first known delay TRB plus the maximum travel time corresponding to the largest distance allowed between two nodes.
- FIG. 5 represents a variant of the location device 1 described above with reference to FIG. 3. What has been described above with reference to FIG. 3 is valid for FIG. 5 and is modified by the variant described herein. -Dessous.
- the role of the first node A and the third node C is exchanged with regard to the second message M3 to go, the second message M4 to return, the second time Tac to the path, the second known delay TRA, the seventh transmission time T7, the eighth reception time T8. It is thus the first node A which sends by its unit AER the second message M3 to go to the third node C.
- the third node C responds to the second message M3 to go by sending the second message M4 back to the first node A.
- the AC unit of the first node A calculates the second path time Tac of the second message M3 to go from the first node A to the third node C or the second path time Tac of the second message M4 of the third node C at the first node A.
- the first transmitting and receiving AER unit is able to transmit the third message M5 containing a first information INF1 indicating at least the first travel time Tab and the second travel time Tac.
- the third message M5 contains both the first information INF1 indicating at least the first path time Tab and the second path time Tac and the second information INF2 indicating the fourth path time Tad.
- the third message transmission and reception unit CER is able to transmit, after a second known delay TRA following the reception of the second message M3 to go, the second message M4 to return.
- the first time measurement unit AMT is able to measure a seventh transmission instant T7 of the second message M3. to go through the first node A and an eighth instant T8 of receiving the second message M4 return by the first node A.
- the first calculation unit AC of the first node A is able to calculate, from the seventh instant T7 of sending, the eighth reception time T8 and the second known delay TRA, the second travel time Tac of the second message M3 to go from the first node A to the third node C or the second message M4 back from the third node C to the first node AT.
- the first transmitting and receiving AER unit is capable of transmitting the third M5 message containing the first information INFl indicating at least the first path time Tab and the second path time Tac, and the message M50, distinct from the message M5 and containing the second information INF2 indicating the fourth path time Tad.
- the second message to go M3 and / or the fourth message to go M 10 is confused with the first message to go M1 and the second known delay TRA and / or the fourth known delay TRD is chosen different from the first known delay TRB so that the second return message M4 and / or the fourth return message M20 is sent by the third node C and / or the fourth node D at a different time from the transmission of the first return message M2 by the second node B and / or the fourth return message M20 being sent by the fourth node D at a different time from the transmission of the second return message. M4 by the third node C.
- the second known delay TRA is chosen to be equal to the first known delay TRB plus the maximum travel time corresponding to the largest distance allowed between two nodes and the fourth lai known will be chosen as being greater than or equal to the first known time TRB plus twice the maximum travel time corresponding to the greatest permissible distance between two nodes.
- first node A it can be provided as first node A several first nodes;
- second node B it can be provided as second node B several second nodes;
- third node C it can be provided as third node C several third nodes;
- the fourth node D can comprise means making it possible to calculate a travel time Tbd between the nodes B and D and / or a distance Dbd between the nodes B and D, and / or a travel time Tdc between the nodes C and D and / or a distance Dde between the nodes C and D, these means being similar to what has been described above for the node C;
- the node D and the nodes E, F or others may each be analogous to the node C;
- the third node C and / or the second node B and / or the fourth node D can also send in one or more other messages the travel time Tbc and / or the distance Dbc and / or the travel time Tab and / or the distance Tab and / or the travel time Tac and / or the distance Dac and / or a travel time Tbd between the nodes B and D and / or a distance Dbd between the nodes B and D, and / or a time of path Tdc between the nodes C and D and / or a distance Dde between the nodes C and D and / or the travel time Tad and / or the distance Dad, to communicate them to the other nodes.
- all the nodes have this information.
- the node B can calculate by its calculation unit the distance Dab from the travel time Tab received in the message M5;
- the node B can calculate by its calculation unit the distance Dbc,
- the node B can calculate by its calculation unit the distance Dbd.
- the first node A, the second node B, the third node C and / or the fourth node D is able to calculate, by its first calculation unit AC and / or its second calculation unit BC and / or its third calculation unit CC and / or its fourth calculation CD unit, at least one arrival angle of the message M1, M2, M3, M4, M10 and / or M20.
- each node is able to determine a relative orientation angle relative to the other nodes.
- the third node C obtains an orientation angle with respect to the first node A, the second node B and the fourth node D.
- one or more of the messages indicated above, received by one of the nodes A, B, C, D or others can be used to measure, by a unit of measure of angle that includes this node, an arrival angle of this message received by this node.
- the invention also relates to a locating method comprising one or more of the steps described above and / or the first node A, and / or the second node B and / or the third node C and / or the fourth node D.
- the location method is implemented using the location device.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
Claims
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/FR2017/050884 WO2018189430A1 (en) | 2017-04-13 | 2017-04-13 | Device and method for relative location of at least three nodes |
Publications (1)
Publication Number | Publication Date |
---|---|
EP3610280A1 true EP3610280A1 (en) | 2020-02-19 |
Family
ID=58699177
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP17722846.7A Withdrawn EP3610280A1 (en) | 2017-04-13 | 2017-04-13 | Device and method for relative location of at least three nodes |
Country Status (3)
Country | Link |
---|---|
US (1) | US20200389866A1 (en) |
EP (1) | EP3610280A1 (en) |
WO (1) | WO2018189430A1 (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102021101180A1 (en) * | 2021-01-21 | 2022-07-21 | Sick Ag | security system |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100946984B1 (en) * | 2007-12-10 | 2010-03-10 | 한국전자통신연구원 | System and method for chasing location |
US8509809B2 (en) * | 2011-06-10 | 2013-08-13 | Qualcomm Incorporated | Third party device location estimation in wireless communication networks |
US8982935B2 (en) * | 2013-07-25 | 2015-03-17 | Qualcomm Incorporated | Apparatus and method for ranging using round-trip time by broadcasting in a network |
-
2017
- 2017-04-13 WO PCT/FR2017/050884 patent/WO2018189430A1/en unknown
- 2017-04-13 EP EP17722846.7A patent/EP3610280A1/en not_active Withdrawn
- 2017-04-13 US US16/604,922 patent/US20200389866A1/en not_active Abandoned
Also Published As
Publication number | Publication date |
---|---|
WO2018189430A1 (en) | 2018-10-18 |
US20200389866A1 (en) | 2020-12-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3425813B1 (en) | Pulse shaping interoperability protocol for ultra wideband systems | |
Tahat et al. | A look at the recent wireless positioning techniques with a focus on algorithms for moving receivers | |
EP2867691B1 (en) | Device and method for locating an rfid transmitter | |
US7847734B2 (en) | System and method for multilaterating a position of a target using mobile remote receiving units | |
Wang et al. | Sensor localization under limited measurement capabilities | |
JP2020509368A (en) | Enhanced object position detection | |
KR100842019B1 (en) | Position detection with frequency smoothing | |
JP2010160132A (en) | Method and system for locating position of transceiver | |
CN110636606A (en) | Method and system for determining node location | |
US20220342031A1 (en) | Location determination based on phase differences | |
JP2006080681A (en) | System and method for position detection | |
Perez-Cruz et al. | BLADE: A universal, blind learning algorithm for ToA localization in NLOS channels | |
CN107843910B (en) | Virtual multi-station TDOA (time difference of arrival) positioning method and device suitable for complex environment | |
Pelka et al. | S-TDoA—Sequential time difference of arrival—A scalable and synchronization free approach forl positioning | |
WO2020211119A1 (en) | Uwb-based terminal positioning scheduling method | |
JP2021524590A (en) | Positioning method and positioning system for locating at least one object using wave-based signals | |
DK3146356T3 (en) | DIRECT GEOLOCALIZATION OF TDOA, FDOA AND AGL | |
Hanna et al. | Destination-feedback free distributed transmit beamforming using guided directionality | |
Piontek et al. | Improving the accuracy of ultrasound-based localisation systems | |
EP2587691A1 (en) | Method for the coordinated processing of signals transmitted by beacons | |
Amundson et al. | RF angle of arrival-based node localisation | |
EP3610280A1 (en) | Device and method for relative location of at least three nodes | |
CN102226844A (en) | Inter-satellite ranging method for formation small satellites based on two-way forwarding measurement system and carrier phase smoothed pseudo code | |
KR20090092586A (en) | TDOA based localization system, localization method in port logistics environment | |
Dalce et al. | Comparison of indoor localization systems based on wireless communications |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: UNKNOWN |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20191010 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
INTG | Intention to grant announced |
Effective date: 20201214 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20210427 |