his_location.h 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309
  1. #ifndef __INCLUDE_HIS_LOCATION_HPP
  2. #define __INCLUDE_HIS_LOCATION_HPP
  3. #include <complex>
  4. #include <queue>
  5. #include "point.h"
  6. #include "log.h"
  7. #include "tool_time.h"
  8. #include "card_path.h"
  9. #include "db_api/CDBSingletonDefine.h"
  10. //速度
  11. //区域 地图变换
  12. //运动方向
  13. //路径变换
  14. struct location_card
  15. {
  16. location_card(uint32_t id,uint64_t type,uint32_t objid)
  17. :m_cardid(id)
  18. ,m_type(type)
  19. ,m_objid(objid)
  20. {
  21. init();
  22. }
  23. uint32_t m_cardid;//卡id
  24. uint16_t m_type;//卡类型
  25. uint32_t m_objid;
  26. double m_arg;//运动方向角度值
  27. int m_areaid;//区域
  28. int m_mapid;//地图
  29. uint64_t m_timestamp;//入库后的时间
  30. point m_p;//入库后的点
  31. int m_direct_index;
  32. uint64_t last_timestamp;
  33. struct mini_data
  34. {
  35. mini_data(const point &p,uint64_t t)
  36. :p(p)
  37. ,time(t)
  38. {}
  39. point p;
  40. uint64_t time;
  41. };
  42. std::queue<mini_data> m_d;
  43. void init()
  44. {
  45. m_areaid=-1;
  46. m_mapid=-1;
  47. m_timestamp=0;
  48. m_p.set(0,0);
  49. std::queue<mini_data> tmp;
  50. m_d.swap(tmp);
  51. m_direct_index=0;
  52. last_timestamp=0;
  53. }
  54. void init_att(const point &pt,uint64_t time)
  55. {
  56. std::queue<mini_data> tmp;
  57. m_d.swap(tmp);
  58. m_d.emplace(pt,time);
  59. }
  60. void set_invalid()
  61. {
  62. m_arg=0x12345678;
  63. }
  64. bool is_valid()
  65. {
  66. return m_arg!=0x12345678;
  67. }
  68. double make_arg(const point &pt,const point &p)
  69. {
  70. log_info("his_location arg[%d],(%.2f,%.2f)--->(%.2f,%.2f)---->(%.2f,%.2f)",m_cardid,m_p.x,m_p.y,p.x,p.y,pt.x,pt.y);
  71. return std::arg(std::complex<double>(pt.x,pt.y)-std::complex<double>(p.x,p.y));
  72. }
  73. void set(const point &pt,uint64_t time)
  74. {
  75. m_timestamp=time;
  76. m_p.set(pt);
  77. init_att(pt,time);
  78. }
  79. bool line_changed(const point &pt)//,int &df)
  80. {
  81. if(!is_valid())
  82. return false;
  83. point p;
  84. if(m_d.empty())p=m_p; else p=m_d.back().p;
  85. if(point::eq(p.x,pt.x,0.2) && point::eq(p.y,pt.y,0.2)) return false;
  86. double dis1=m_p.dist(pt);
  87. if(dis1<2)return false;
  88. //double dis = p.dist(pt);
  89. double dis = m_p.dist(pt);
  90. double arg = make_arg(pt,m_p);
  91. //查看路径方向是否改变
  92. bool change_flag=(arg-m_arg > -1e-10 && arg-m_arg<1e-10);
  93. //change_flag为true,标识没有发生变化
  94. // if(change_flag)m_direct_index=0;
  95. log_info("his_location:line_changed:%d,%f,m_arg:%f,%s,%f,%f",m_cardid,arg,m_arg, change_flag?"same":"not same",m_arg-arg,dis);
  96. //if(dis<0.5 && fabs(fabs(arg)+fabs(m_arg)-3.141593)< 0.000005)
  97. // return false;
  98. //判断10次反向才做下一步动作
  99. // if(fabs(fabs(arg)+fabs(m_arg)-3.141593)< 0.000005)
  100. // {
  101. // if(++m_direct_index<=10)
  102. // {
  103. // df=1;return false;
  104. // }
  105. // }
  106. return !point::eq(arg,m_arg,1e-10);
  107. }
  108. bool is_speed_changed(const point& pt,uint64_t time)
  109. {
  110. bool flag = false;
  111. double v=0.0;
  112. point ps=m_d.back().p;
  113. if(ps.dist(pt)<0.1)return flag;
  114. if(m_d.size()>=4)
  115. {
  116. mini_data d1 = m_d.front();
  117. double dist = d1.p.dist(pt);
  118. double t = time-d1.time;
  119. v = dist/t*1000;
  120. m_d.pop();
  121. }
  122. m_d.emplace(pt,time);
  123. if(v<=0.1)
  124. return flag;
  125. double dist = m_p.dist(pt);
  126. double t = time - m_timestamp;
  127. double avge_speed= dist/t*1000;
  128. log_info("his_location cardid:%d:v:%.2f,avge_v:%.2f,(%.2f--%.2f)",m_cardid,v,avge_speed,0.7*avge_speed,1.3*avge_speed);
  129. if(v<(1-0.3)*avge_speed || v>(1+0.3)*avge_speed)
  130. flag=true;
  131. return flag;
  132. }
  133. bool time_out(const point &p,uint64_t time)
  134. {
  135. uint64_t t=last_timestamp==0?m_timestamp:last_timestamp;
  136. if(time-t>=30*1000 && m_p.dist(p)>0.1)
  137. return true;
  138. return false;
  139. }
  140. bool is_area_changed(int new_areaid)
  141. {
  142. bool flag =false;
  143. if(m_areaid != new_areaid)
  144. {
  145. m_areaid = new_areaid;
  146. flag=true;
  147. }
  148. return flag;
  149. }
  150. bool is_map_changed(int new_mapid)
  151. {
  152. bool flag =false;
  153. if(m_mapid != new_mapid)
  154. {
  155. m_mapid = new_mapid;
  156. flag=true;
  157. }
  158. return flag;
  159. }
  160. void push(uint64_t timestamp,const point & p,int32_t areaid,int32_t mapid)
  161. {
  162. if(m_p.empty() || m_timestamp==0||m_areaid<0||m_mapid<0)
  163. {
  164. set(p,timestamp);
  165. m_areaid=areaid;m_mapid=mapid;
  166. m_d.emplace(p,timestamp);
  167. return;
  168. }
  169. if(!is_valid())
  170. {
  171. //if(p==m_p)
  172. if(point::eq(p.x,m_p.x,0.2) && point::eq(p.y,m_p.y,0.2))
  173. {
  174. set(p,timestamp);
  175. return ;
  176. }
  177. auto v=find_path(m_p,p);
  178. if(v.empty())
  179. m_arg=make_arg(p,m_p);
  180. else
  181. {
  182. log_info("his_location:more_abnormal_point....%d,(%.2f,%.2f)---(%.2f,%.2f)",m_cardid,m_p.x,m_p.y,p.x,p.y);
  183. handle_path(v,timestamp,true);
  184. set_invalid();
  185. return;
  186. }
  187. log_info("his_location:%d arg:%f",m_cardid,m_arg);
  188. insert();
  189. return;
  190. }
  191. bool flag=false;
  192. int iflag=0;
  193. //判断是否路径发生了变化
  194. //这里现在又判断,如果反向了也会返回true.但是不运作,依然走下面的逻辑就会有问题
  195. //比如速度
  196. flag=handle_message(p,timestamp);
  197. if(time_out(p,timestamp))
  198. if(!flag)iflag=1;
  199. if(is_speed_changed(p,timestamp))
  200. if(!flag)iflag=2;
  201. if(is_area_changed(areaid))
  202. if(!flag)iflag=3;
  203. if(is_map_changed(mapid))
  204. if(!flag)iflag=4;
  205. log_info("his_location cardid:%d:%d",m_cardid,iflag);
  206. if(iflag)
  207. {
  208. update(p,timestamp,iflag);
  209. //set_invalid();
  210. if(iflag>1){
  211. set(p,timestamp);
  212. insert();
  213. }
  214. }
  215. }
  216. void insert()
  217. {
  218. //std::string tabName=getTabName();
  219. char nsql[512]={0};
  220. const char * sql = "replace into his_location (obj_id,card_type_id,ident,begin_time,map_id,area_id,begin_pt,direction)"
  221. "values(%d,%d,%d,'%s',%d,%d,'%.2f,%.2f',%f);";
  222. snprintf(nsql,512,sql,m_objid,m_type,m_cardid,tool_time::to_str(m_timestamp/1000).c_str(),m_mapid,m_areaid,m_p.x,m_p.y,m_arg);
  223. log_info("his_location[%d,%lu]:%s",m_cardid,m_timestamp,nsql);
  224. sDBConnPool.PushAsync(nsql);
  225. }
  226. void update(const point &p,uint64_t timestamp,int flag=0)
  227. {
  228. //std::string tabName=getTabName();
  229. char nsql[512]={0};
  230. const char * sql = "update his_location set last_time='%s',speed=%.2f where obj_id=%d and begin_time='%s' and last_time is null;";
  231. double dist = m_p.dist(p);
  232. double t = (timestamp - m_timestamp)/1000;
  233. double avge_speed= dist/t;
  234. if(std::isnan(avge_speed)|| std::isinf(avge_speed))avge_speed=0;
  235. log_info("his_location_time[%d]:%d[%lu,%lu,%lu]",m_cardid,flag,last_timestamp,timestamp,m_timestamp);
  236. if(last_timestamp != 0)
  237. {
  238. const char * ss = "update his_location set last_time='%s',speed=%.2f where obj_id=%d and begin_time='%s' and last_time = '%s';";
  239. snprintf(nsql,512,ss,tool_time::to_str(timestamp/1000).c_str(),avge_speed,m_objid,tool_time::to_str(m_timestamp/1000).c_str(),tool_time::to_str(last_timestamp/1000).c_str());
  240. }
  241. else
  242. snprintf(nsql,512,sql,tool_time::to_str(timestamp/1000).c_str(),avge_speed,m_objid,tool_time::to_str(m_timestamp/1000).c_str());
  243. if(flag==1) last_timestamp=timestamp;
  244. else last_timestamp=0;
  245. log_info("his_location[%d]:%s[%lu,%lu]",m_cardid,nsql,timestamp,m_timestamp);
  246. sDBConnPool.PushAsync(nsql);
  247. }
  248. std::vector<point> find_path(const point &p1,const point &p2)
  249. {
  250. std::vector<point> rc=card_path::inst().find_path(point(p1.x,-p1.y),point(p2.x,-p2.y));
  251. return std::move(rc);
  252. }
  253. //virtual bool handle_message(const point &p,uint64_t timestamp)=0;
  254. bool handle_message(const point &p,uint64_t timestamp)
  255. {
  256. bool flag = false;
  257. //int df=0;
  258. if(line_changed(p))//,df))
  259. {
  260. flag = true;
  261. std::vector<point> rc=find_path(m_d.back().p,p);
  262. if(rc.empty())
  263. {
  264. log_info("his_location:line_changed rc.empty() %d",m_cardid);
  265. update(m_d.back().p,m_d.back().time);
  266. set(m_d.back().p,m_d.back().time);
  267. }
  268. else
  269. {
  270. if(handle_path(rc,timestamp,false))
  271. return true;
  272. }
  273. //置m_arg非法
  274. set_invalid();
  275. }
  276. //if(df==1)flag=true;
  277. return flag;
  278. }
  279. bool handle_path(std::vector<point> &rc,uint64_t timestamp,bool flag)
  280. {
  281. double dis=0;point _p=m_p;
  282. std::for_each(rc.begin(),rc.end(),[&dis,&_p](point &pt){
  283. pt.y=-pt.y;dis+=_p.dist(pt);_p=pt;
  284. });
  285. uint64_t t=timestamp/1000 - m_timestamp/1000;
  286. if(t==0||dis<0.1)return true;
  287. double avge_speed= dis/t;
  288. for(const point & pp:rc)
  289. {
  290. if(flag){
  291. m_arg=make_arg(pp,m_p);insert();
  292. }
  293. log_info("his_location:line_changed_x %d point(%.2f,%.2f)--circle point(%.2f,%.2f),speed:%.2f",m_cardid,m_p.x,m_p.y,pp.x,pp.y,avge_speed);
  294. double dist=m_p.dist(pp);uint64_t tt=dist/avge_speed*1000;
  295. uint64_t etime=m_timestamp+tt;
  296. update(pp,etime);set(pp,etime);
  297. flag=true;
  298. }
  299. return false;
  300. }
  301. };
  302. #endif