-
Notifications
You must be signed in to change notification settings - Fork 1
/
PrimitiveAdapter.cpp
216 lines (175 loc) · 7.28 KB
/
PrimitiveAdapter.cpp
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
212
213
214
215
216
#include "PrimitivesCollection.cpp"
#include <boost/math/constants/constants.hpp>
#include "SimpleTrajectory.h"
#include "PrimitiveCollusionPoints.cpp"
#include <math.h>
#pragma once
class PrimitiveAdapter
{
private:
PrimitivesCollection m_collection;
PrimitiveCollusionPointsCollection m_collusionPoints;
public:
PrimitiveAdapter(/* args */) = default;
PrimitiveAdapter(const PrimitivesCollection&);
/* Find the primitive from the database */
Primitive findPrimitive(Primitive) const;
/*Shift the primitives from the databse to real coordinates */
Primitive shiftPrimitive(Primitive, StateSpace to) const;
~PrimitiveAdapter() = default;
// From a stataspace trajectory find the corresponding primitive trajectory in the database
SimpleTrajectory<Primitive> decryptTrajectory(SimpleTrajectory<StateSpace>);
PrimitiveAdapter& operator=(const PrimitiveAdapter&);
// Load the all collusion points to memory
void loadCollusionPoints();
// Load the collusion point of the primitive with given id
CollusionPoints getCollusionPoints(unsigned int, int, int) const;
bool hasCollusionPoints() const;
};
PrimitiveAdapter::PrimitiveAdapter(const PrimitivesCollection &collection){
m_collection = collection;
}
Primitive PrimitiveAdapter::findPrimitive(Primitive candidatePrimitive)const {
StateSpace init = candidatePrimitive[0];
StateSpace fin = candidatePrimitive[1];
// Move the initial state to origin
double x0_n = 0;
double y0_n = 0;
// Move the final state with it
double xf_n = fin[0] - init[0];
double yf_n = fin[1] - init[1];
// ShiftVector shift(candidatePrimitive);
// auto [xf_n, yf_n] = shift.get();
double pi = boost::math::constants::pi<double>();
// orientation
auto theta_pos = init[2];
// if(theta_pos < 0)
// theta_pos = theta_pos + 2*pi;
theta_pos = fmod(theta_pos, 2*pi);
//If in first quadrant
if((theta_pos>=0) & (theta_pos<= pi/2) ){
StateSpace initNormalized(x0_n, y0_n, init[2], init[3]);
StateSpace finNormalized(xf_n, yf_n, fin[2], fin[3]);
Primitive primm(initNormalized,finNormalized);
return m_collection.findPrimitive(primm);
}
else if((theta_pos>=pi/2) & (theta_pos<= pi )){
StateSpace initNormalized(x0_n, y0_n, pi-init[2], init[3]);
StateSpace finNormalized(-xf_n, yf_n, pi-fin[2], fin[3]);
Primitive primm(initNormalized,finNormalized);
return m_collection.findPrimitive(primm);
}
else if((theta_pos>=pi) & (theta_pos<= 3*pi/2) ){
StateSpace initNormalized(x0_n, y0_n, init[2]-pi, init[3]);
StateSpace finNormalized(-xf_n, -yf_n, fin[2]-pi, fin[3]);
Primitive primm(initNormalized,finNormalized);
return m_collection.findPrimitive(primm);
}
else{
StateSpace initNormalized(x0_n, y0_n, 2*pi-init[2], init[3]);
StateSpace finNormalized(xf_n, -yf_n, 2*pi-fin[2], fin[3]);
Primitive primm(initNormalized,finNormalized);
return m_collection.findPrimitive(primm);
}
}
Primitive PrimitiveAdapter::shiftPrimitive(Primitive primitive, StateSpace to)const{
//move only the x and y components
StateSpace too(to[0], to[1],0,0);
SimpleTrajectory<StateSpace> shiftTrajectory;
for(int i =0; i < primitive.m_numberIntermStateSpaces+1 ; i ++)
shiftTrajectory.add(too);
// Move the whole trajectory
//primitive.m_stateSpaceTrajectory = primitive.m_stateSpaceTrajectory + shiftTrajectory;
double pi = boost::math::constants::pi<double>();
// auto normalized_inital_state = primitive[0];
// auto theta_pos = normalized_inital_state[2];
auto theta_pos = to[2];
//if(theta_pos < 0)
//theta_pos = theta_pos + 2*pi;
theta_pos = fmod(theta_pos, 2*pi);
// first quadrant
if((theta_pos>=0) & (theta_pos<= pi/2)) {
primitive.m_stateSpaceTrajectory = primitive.m_stateSpaceTrajectory + shiftTrajectory;
return primitive;
}
// If in the second quadrant
else if((theta_pos>=pi/2) & (theta_pos<= pi )){
auto traj = primitive.m_stateSpaceTrajectory.getData();
SimpleTrajectory<StateSpace> newTraj;
// If don't iterate over reference states you'd create copies of it hence not changing the trajectory
for (auto &state : traj){
//state.setTheta(fmod(pi - state[2],2*pi));
// state.setX(-state[0]);
newTraj.add(StateSpace(-state[0], state[1], fmod(pi-state[2],2*pi), state[3]));
}
primitive.m_stateSpaceTrajectory.setData(newTraj.getData());
// not sure about this though
primitive.m_stateSpaceTrajectory = primitive.m_stateSpaceTrajectory + shiftTrajectory;
return primitive;
}
// third quadrant
else if((theta_pos>=pi) & (theta_pos<= 3*pi/2) ){
auto traj = primitive.m_stateSpaceTrajectory.getData();
SimpleTrajectory<StateSpace> newTraj;
for (auto &state : traj){
//state.setTheta(fmod( state[2]-pi,2*pi));
// state.setX(-state[0]);
//state.setY(-state[1]);
newTraj.add(StateSpace(-state[0], -state[1], fmod(state[2]-pi,2*pi), state[3]));
}
primitive.m_stateSpaceTrajectory.setData(newTraj.getData());
primitive.m_stateSpaceTrajectory = primitive.m_stateSpaceTrajectory + shiftTrajectory;
return primitive;
}
// forth quadrant
else{
auto traj = primitive.m_stateSpaceTrajectory.getData();
SimpleTrajectory<StateSpace> newTraj;
for (auto &state : traj){
//state.setTheta(fmod(2*pi - state[2],2*pi));
//state.setY(-state[1]);
newTraj.add(StateSpace(state[0],-state[1],fmod(2*pi - state[2],2*pi), state[3]));
}
primitive.m_stateSpaceTrajectory.setData(newTraj.getData());
primitive.m_stateSpaceTrajectory = primitive.m_stateSpaceTrajectory + shiftTrajectory;
return primitive;
}
}
SimpleTrajectory<Primitive> PrimitiveAdapter::decryptTrajectory(SimpleTrajectory<StateSpace> trajectory){
std::vector<StateSpace> traj = trajectory.getData();
SimpleTrajectory<Primitive> primitiveTrajectory;
StateSpace init, fin;
for(auto it = traj.begin(); it!= traj.end()-1; it++){
init = *it;
fin = *std::next(it);
Primitive prim(init,fin);
Primitive primim = findPrimitive(prim);
// shift if a primitive found
if(primim.m_flag != 0){
auto newprim = shiftPrimitive(primim, prim[0]);
primitiveTrajectory.add(newprim);
}
// if not found return the candidate
else{
primitiveTrajectory.add(prim);
}
}
return primitiveTrajectory;
}
PrimitiveAdapter& PrimitiveAdapter::operator=(const PrimitiveAdapter & adapter){
m_collection = adapter.m_collection;
return *this;
}
void PrimitiveAdapter::loadCollusionPoints(){
m_collusionPoints.loadCollusionPoints();
}
CollusionPoints PrimitiveAdapter::getCollusionPoints(unsigned int id, int x, int y) const{
auto mk = m_collusionPoints.getCollusionPoints(id,x,y);
return mk;
}
// bool PrimitiveAdapter::hasCollusionPoints() const{
// if(m_collusionPoints != nullptr)
// return true;
// else
// return false;
// }