Sentence examples for cooperative positioning from inspiring English sources

In recent years, convex optimizations, including semidefinite programming (SDP)[22 25], sum of squares (SOS) relaxation[26, 27], and distributed gradient algorithm, also found their place in cooperative positioning.

This paper proposed two cooperative positioning algorithms: Direct Multi-Radio Fusion (DMRF) reorganizes the information in a transformed space, and a Cooperative Eigen-Radio Positioning (CERP) uses the spatial discrimination property.

Cooperative positioning can overcome the traditional restriction.

Some common cooperative positioning algorithms also considered the node selection [7].

A comparison between non-cooperative and cooperative positioning was done, and several positioning algorithms were tested in both cases.

For a certain number of CNs, the geometry plays a vital part in the performance of the cooperative positioning system.

For non-cooperative positioning with positively biased range measurements, POCS converges to a point in the convex feasible set (i.e., the intersection of a number of discs).

This paper deals with cooperative position estimation in terms of pure relative localisation, which is based only on mutual observations among the robots.

Moreover, we study a method based on outer approximation (OA) to solve the positioning problem for positive measurement errors and propose a new OA method for cooperative networks positioning.

As shown in Fig. 1, a typical cellular-based cooperative localization system consists of five fundamental components including general nodes (GNs), landmark nodes (LNs), cooperative nodes (CNs), positioning targets (PTs), and info-station (IS).

The results of extensive experiments have shown that the proposed cooperative AOA positioning approach is more accurate.