English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This manuscript is a preliminary pre-print version of a journal submission bythe authors, revisiting the problem of range measurement based localization ofa signal source or a sensor. The major geometric difficulty of the problemcomes from the non-convex structure of optimization tasks associated with rangemeasurements, noting that the set of source locations corresponding to acertain distance measurement by a fixed point sensor is non-convex both in twoand three dimensions. Differently from various recent approaches to thislocalization problem, all starting with a non-convex geometric minimizationproblem and attempting to devise methods to compensate the non-convexityeffects, we suggest a geometric strategy to compose a convex minimizationproblem first, that is equivalent to the initial non-convex problem, at leastin noise-free measurement cases. Once the convex equivalent problem is formed,a wide variety of convex minimization algorithms can be applied. The paper alsosuggests a gradient based localization algorithm utilizing the introducedconvex cost function for localization. Furthermore, the effects of measurementnoises are briefly discussed. The design, analysis, and discussions aresupported by a set of numerical simulations.

On Convexification of Range Measurement Based Sensor and Source Localization Problems