1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
extern crate nalgebra as na;
use self::na::allocator::Allocator;
use self::na::{DefaultAllocator, DimName, VectorN, U3};
const REL_ERR_THRESH: f64 = 0.1;
pub trait ErrorCtrl
where
Self: Copy,
{
fn estimate<N: DimName>(error_est: &VectorN<f64, N>, candidate: &VectorN<f64, N>, cur_state: &VectorN<f64, N>) -> f64
where
DefaultAllocator: Allocator<f64, N>;
}
#[derive(Clone, Copy)]
pub struct LargestError;
impl ErrorCtrl for LargestError {
fn estimate<N: DimName>(error_est: &VectorN<f64, N>, candidate: &VectorN<f64, N>, cur_state: &VectorN<f64, N>) -> f64
where
DefaultAllocator: Allocator<f64, N>,
{
let state_delta = candidate - cur_state;
let mut max_err = 0.0;
for (i, prop_err_i) in error_est.iter().enumerate() {
let err = if state_delta[i] > REL_ERR_THRESH {
(prop_err_i / state_delta[i]).abs()
} else {
prop_err_i.abs()
};
if err > max_err {
max_err = err;
}
}
max_err
}
}
#[derive(Clone, Copy)]
pub struct LargestStep;
impl ErrorCtrl for LargestStep {
fn estimate<N: DimName>(error_est: &VectorN<f64, N>, candidate: &VectorN<f64, N>, cur_state: &VectorN<f64, N>) -> f64
where
DefaultAllocator: Allocator<f64, N>,
{
let state_delta = candidate - cur_state;
let mut mag = 0.0f64;
let mut err = 0.0f64;
for i in 0..N::dim() {
mag += state_delta[i].abs();
err += error_est[i].abs();
}
if mag > REL_ERR_THRESH {
err / mag
} else {
err
}
}
}
#[derive(Clone, Copy)]
pub struct LargestState;
impl ErrorCtrl for LargestState {
fn estimate<N: DimName>(error_est: &VectorN<f64, N>, candidate: &VectorN<f64, N>, cur_state: &VectorN<f64, N>) -> f64
where
DefaultAllocator: Allocator<f64, N>,
{
let sum_state = candidate + cur_state;
let mut mag = 0.0f64;
let mut err = 0.0f64;
for i in 0..N::dim() {
mag += 0.5 * sum_state[i].abs();
err += error_est[i].abs();
}
if mag > REL_ERR_THRESH {
err / mag
} else {
err
}
}
}
#[derive(Clone, Copy)]
pub struct RSSStep;
impl ErrorCtrl for RSSStep {
fn estimate<N: DimName>(error_est: &VectorN<f64, N>, candidate: &VectorN<f64, N>, cur_state: &VectorN<f64, N>) -> f64
where
DefaultAllocator: Allocator<f64, N>,
{
let mag = (candidate - cur_state).norm();
let err = error_est.norm();
if mag > REL_ERR_THRESH {
err / mag
} else {
err
}
}
}
#[derive(Clone, Copy)]
pub struct RSSState;
impl ErrorCtrl for RSSState {
fn estimate<N: DimName>(error_est: &VectorN<f64, N>, candidate: &VectorN<f64, N>, cur_state: &VectorN<f64, N>) -> f64
where
DefaultAllocator: Allocator<f64, N>,
{
let mag = 0.5 * (candidate + cur_state).norm();
let err = error_est.norm();
if mag > REL_ERR_THRESH {
err / mag
} else {
err
}
}
}
#[derive(Clone, Copy)]
pub struct RSSStatePV;
impl ErrorCtrl for RSSStatePV {
fn estimate<N: DimName>(error_est: &VectorN<f64, N>, candidate: &VectorN<f64, N>, cur_state: &VectorN<f64, N>) -> f64
where
DefaultAllocator: Allocator<f64, N>,
{
let err_radius = RSSState::estimate::<U3>(
&error_est.fixed_rows::<U3>(0).into_owned(),
&candidate.fixed_rows::<U3>(0).into_owned(),
&cur_state.fixed_rows::<U3>(0).into_owned(),
);
let err_velocity = RSSState::estimate::<U3>(
&error_est.fixed_rows::<U3>(3).into_owned(),
&candidate.fixed_rows::<U3>(3).into_owned(),
&cur_state.fixed_rows::<U3>(3).into_owned(),
);
if err_radius > err_velocity {
err_radius
} else {
err_velocity
}
}
}
#[derive(Clone, Copy)]
pub struct RSSStepPV;
impl ErrorCtrl for RSSStepPV {
fn estimate<N: DimName>(error_est: &VectorN<f64, N>, candidate: &VectorN<f64, N>, cur_state: &VectorN<f64, N>) -> f64
where
DefaultAllocator: Allocator<f64, N>,
{
let err_radius = RSSStep::estimate::<U3>(
&error_est.fixed_rows::<U3>(0).into_owned(),
&candidate.fixed_rows::<U3>(0).into_owned(),
&cur_state.fixed_rows::<U3>(0).into_owned(),
);
let err_velocity = RSSStep::estimate::<U3>(
&error_est.fixed_rows::<U3>(3).into_owned(),
&candidate.fixed_rows::<U3>(3).into_owned(),
&cur_state.fixed_rows::<U3>(3).into_owned(),
);
if err_radius > err_velocity {
err_radius
} else {
err_velocity
}
}
}