🐻
berkeley
  • #Despair
  • 16A/B
    • Thevenin and Norton Equivalence
    • Resistive Touchscreen
    • Trilateration and Correlation
    • RC Circuits & Transient Analysis
  • 61B
    • Testing
    • References in Java
    • Linked Lists in Java
    • Implementation Inheritance
    • Comparables and Iterators
    • Casting
    • Lists and Sets
    • Asymptotics
    • Trees
    • Hashing
    • PriorityQueue and Heap
    • Graphs, Tree Traversals
    • Tries
    • Sorting
  • Discrete Mathematics
    • Sets + Mathematical Notation
    • Logic and Proofs
    • Induction
    • Cryptography/RSA
    • Modular Arithmetic
    • Discrete Probability
  • Linear Algebra
    • Linear Equations
    • Matrix Algebra
    • Determinants
    • Vector Spaces
    • Eigenvectors and Eigenvalues
    • Projections and Orthogonality
    • SVD/PCA
  • Math 275 — Ordinary Differential Equations
    • Math 275 — Overview
    • Modeling via Differential Equations
    • Linear Systems
  • INTEGBI 35AC
    • Humans Came From Fish
    • Evolution's History
    • Typology
    • The Human Diaspora
  • 170
    • Basics
    • Divide and Conquer
    • Fast Fourier Transform
    • Graphs
    • Greedy
  • 61C
    • Pointers and Memory
    • Floating Point
    • Compliation, Assembly, Linking, Loading
    • RISC-V, Assembly
Powered by GitBook
On this page
  • Trilateration

Was this helpful?

  1. 16A/B

Trilateration and Correlation

Adapted from UC Berkeley's EECS 16A notes.

PreviousResistive TouchscreenNextRC Circuits & Transient Analysis

Last updated 4 years ago

Was this helpful?

Trilateration

Trilateration is a technique that involves using the geometry of circles to find an approximate or exact location of an object.

Geometrically, this means that if you know the position of three points and each of their distances to a point that you want to find, you can create three circles, the intersection of which is the location that you want to find.

Here's how it works mathematically. Let's take the distances and points below, and assume that we know the positions of the points and the distances to our desired object.

We can write the distances as a set of vector equations.

We can use distance formula with the components.

∣∣x⃗−a⃗1∣∣2=d12∣∣x⃗−a⃗2∣∣2=d22∣∣x⃗−a⃗3∣∣2=d32||\vec{x} - \vec{a}_1||^2 = d_1^2\\ ||\vec{x} - \vec{a}_2||^2 = d_2^2\\ ||\vec{x} - \vec{a}_3||^2 = d_3^2∣∣x−a1​∣∣2=d12​∣∣x−a2​∣∣2=d22​∣∣x−a3​∣∣2=d32​
Source: https://www.researchgate.net/figure/The-Trilateration-algorithm_fig4_224144937
Credit: EECS 16A course staff