Distributed Trajectory Estimation with Privacy and Communication - - PowerPoint PPT Presentation

distributed trajectory estimation with privacy and
SMART_READER_LITE
LIVE PREVIEW

Distributed Trajectory Estimation with Privacy and Communication - - PowerPoint PPT Presentation

Distributed Trajectory Estimation with Privacy and Communication Constraints: a Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary 1 , Luca Carlone 2 , Carlos Nieto 1 , John Rogers 3 , Henrik I. Christensen 1 , Frank Dellaert 1 1


slide-1
SLIDE 1

Distributed Trajectory Estimation with Privacy and Communication Constraints: a Two-Stage Distributed Gauss-Seidel Approach

Siddharth Choudhary1, Luca Carlone2, Carlos Nieto1, John Rogers3, Henrik I. Christensen1, Frank Dellaert1

1 Institute for Robotics and Intelligent Machines, Georgia Tech 2 Laboratory for Information and Decision Systems, MIT 3 Army Research Lab

slide-2
SLIDE 2

Motivation

Related work:

  • distributed SLAM

[Dong et al., Paull et al., Bailey et al.]

  • multi robot localization

[Roumeliotis et al., Tron and Vidal]

  • distributed optimization

[Cunningham et al., Nerurkar et al., Franceschelli and Gasparri, Aragues etl al.]

  • State of the art: DDF-SAM requires

communication cost quadratic in the number of rendezvous.

  • Goal: distributed estimation of 


trajectories of robots in a team

  • why distributed: avoid exchange

  • f large amount of data
  • small flying robots
  • underwater vehicles
  • Applications:
  • mapping
  • exploration
slide-3
SLIDE 3

Cooperative estimation of 3D robot trajectories from relative pose measurements, with the following constraints:

  • 1. Communication only occurs during rendezvous.
  • 2. Data exchange must be minimal (due to limited bandwidth and privacy).

Problem Statement

Example application of Privacy Constraint: Optimization of Multiple trajectories collected through Google Project Tango

(courtesy: Simon Lynen)

Communication only occurs when two robots are close enough.

slide-4
SLIDE 4
  • Each phase requires solving a linear system
  • We use the Gauss-Seidel algorithm as distributed

linear solver

Contribution

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

Trajectory estimation as Pose Graph Optimization: Related work: iterative optimization Our approach: 2 stage [Carlone et al. (ICRA 2015)]

Estimate Optimum

SLAM - TORO - Sphere Optimization courtesy: Cyril Stachniss

slide-5
SLIDE 5

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

robot β

robot α

yβ1

yβ2

yβ3 yα1 yα2 yα3 yα4

Hessian Matrix

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

Distributed Gauss-Seidel Approach

min

Ri∈SO(3)

X

(i,j)∈E

ω2

RkRj Ri ¯

Rj

ik2 F

min

Ri

X

(i,j)∈E

ω2

RkRj Ri ¯

Rj

ik2 F

quadratic relaxation

min

y

kAy bk2

rewrite

  • AT A
  • y = AT b

normal equation Hessian (H)

}

}

g solve in a distributed manner

Hy = g

slide-6
SLIDE 6

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix Iterate

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

Distributed Gauss-Seidel Approach

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

slide-7
SLIDE 7

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • distributed

Jacobi error iteration centralized

yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • Distributed Gauss-Seidel Approach
slide-8
SLIDE 8

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • distributed

Gauss-Seidel error iteration centralized

Distributed Gauss-Seidel Approach

slide-9
SLIDE 9

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • distributed

Gauss-Seidel error iteration centralized

yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • Distributed Gauss-Seidel Approach
slide-10
SLIDE 10

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • distributed

Gauss-Seidel error iteration centralized

Distributed Gauss-Seidel Approach

slide-11
SLIDE 11

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • distributed

Gauss-Seidel error iteration centralized

yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • Distributed Gauss-Seidel Approach
slide-12
SLIDE 12

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • distributed

Gauss-Seidel error iteration centralized

Distributed Gauss-Seidel Approach

slide-13
SLIDE 13

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • distributed

Gauss-Seidel error iteration centralized

yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • Distributed Gauss-Seidel Approach
slide-14
SLIDE 14

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • distributed

Gauss-Seidel error iteration centralized

Distributed Gauss-Seidel Approach

slide-15
SLIDE 15

robot β

robot α

α1 α2 α3 α4 β1 β2 β3 α1 α2 α3 α4 β1 β2 β3

Hαα

Hαβ

Hββ

Hβα

yβ1 yβ2 yβ3 yα1 yα2 yα3 yα4

Trajectory Estimation Problem Hessian Matrix

yk+1

α

= H−1

αα

  • −Hαβ yk

β + gα

  • distributed

Gauss-Seidel error iteration centralized

yk+1

β

= H−1

ββ

  • −Hβα yk

α + gβ

  • Distributed Gauss-Seidel Approach
slide-16
SLIDE 16

The approach has the following merits:

  • 1. Proven convergence to 

  • centralized. Fast convergence


with smart initialization

  • 2. Communication is linear in

number of rendezvous

  • 3. Scalability in the number of

robots

  • 4. Resilience to noise

Without Flagged Initialization With Flagged Initialization

Simulation Results

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

slide-17
SLIDE 17

#rendezvous

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

Simulation Results

The approach has the following merits:

  • 1. Proven convergence to 

  • centralized. Fast convergence


with smart initialization

  • 2. Communication is linear in

number of rendezvous

  • 3. Scalability in the number of

robots

  • 4. Resilience to noise
slide-18
SLIDE 18

Increasing
 number of
 robots Increasing
 measurement noise

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

Simulation Results

The approach has the following merits:

  • 1. Proven convergence to 

  • centralized. Fast convergence


with smart initialization

  • 2. Communication is linear in

number of rendezvous

  • 3. Scalability in the number of

robots

  • 4. Resilience to noise
slide-19
SLIDE 19

We tested the proposed approach on field data collected by two to four Jackal robots, moving in a military test facility. We use the estimated trajectories to reconstruct a 3D map of the facility.

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

Field Experiments

slide-20
SLIDE 20

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

Field Experiments (4 Robots)

slide-21
SLIDE 21

Thank you! For further information, please come to the interactive session: 1.4 (Balcony)

Distributed Trajectory Estimation with Privacy and Communication Constraints: A Two-Stage Distributed Gauss-Seidel Approach Siddharth Choudhary, Luca Carlone, Carlos Nieto, John Rogers, Henrik I. Christensen, Frank Dellaert

Point Cloud Distributed Centralized Occupancy Grid

slide-22
SLIDE 22