An Auxiliary Graph for Clock Rigidity Analysis
Clock rigidity theory argues that a specific graph condition can guarantee the solvability of the clock parameters in a time-of-arrival (TOA) based sensor network, where the graph represents the network topology. An auxiliary graph has been proposed to establish the connection between clock rigidity...
Saved in:
Published in | 2024 American Control Conference (ACC) pp. 180 - 185 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
AACC
10.07.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Clock rigidity theory argues that a specific graph condition can guarantee the solvability of the clock parameters in a time-of-arrival (TOA) based sensor network, where the graph represents the network topology. An auxiliary graph has been proposed to establish the connection between clock rigidity and bearing rigidity, but what is lacking in the literature are methods to leverage the auxiliary graph in the analysis of clock rigidity problems. In this paper, we propose a generalized definition of the auxiliary graph and demonstrate the usage of the auxiliary graph for examining clock configuration genericity in applications. We also study a bearing-based method for examining clock rigidity of a multi graph network, where multiple edges between the same node pairs represent multiple different TOA measurements, extending the families of graphs that can be analyzed using existing clock rigidity theory. |
---|---|
ISSN: | 2378-5861 |
DOI: | 10.23919/ACC60939.2024.10644699 |