his_location.h 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358
  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. struct mini_data
  32. {
  33. mini_data(const point &p,uint64_t t)
  34. :p(p)
  35. ,time(t)
  36. {}
  37. point p;
  38. uint64_t time;
  39. };
  40. std::queue<mini_data> m_d;
  41. void init()
  42. {
  43. m_areaid=-1;
  44. m_mapid=-1;
  45. m_timestamp=0;
  46. m_p.set(0,0);
  47. init_att();
  48. }
  49. void init_att()
  50. {
  51. m_arg=0x12345678;
  52. std::queue<mini_data> tmp;
  53. m_d.swap(tmp);
  54. }
  55. void set_invalid()
  56. {
  57. m_arg=0x12345678;
  58. }
  59. bool is_valid()
  60. {
  61. return m_arg!=0x12345678;
  62. }
  63. double make_arg(const point &pt,const point &p)
  64. {
  65. 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);
  66. return std::arg(std::complex<double>(pt.x,pt.y)-std::complex<double>(p.x,p.y));
  67. }
  68. void set(const point &pt,uint64_t time)
  69. {
  70. m_timestamp=time;
  71. m_p.set(pt);
  72. }
  73. bool line_changed(const point &pt)
  74. {
  75. if(!is_valid())
  76. return false;
  77. point p=m_d.back().p;
  78. if(point::eq(p.x,pt.x,0.2) && point::eq(p.y,pt.y,0.2)) return false;
  79. double dis1=m_p.dist(pt);
  80. if(dis1<1.5)return false;
  81. double dis = p.dist(pt);
  82. double arg = make_arg(pt,p);
  83. log_info("his_location:line_changed:%d,%f,m_arg:%f,%s,%f,%f",m_cardid,arg,m_arg, (arg-m_arg > -1e-10 && arg-m_arg<1e-10)?"same":"not same",m_arg-arg,dis);
  84. if(dis<0.5 && fabs(fabs(arg)+fabs(m_arg)-3.141593)< 0.000005)
  85. return false;
  86. return !point::eq(arg,m_arg,1e-10);
  87. }
  88. bool is_speed_changed(const point& pt,uint64_t time)
  89. {
  90. bool flag = false;
  91. double v=0.0;
  92. if(m_d.size()>=4)
  93. {
  94. mini_data d1 = m_d.front();
  95. double dist = d1.p.dist(pt);
  96. double t = time-d1.time;
  97. v = dist/t*1000;
  98. m_d.pop();
  99. }
  100. m_d.emplace(pt,time);
  101. if(v<=0.1)
  102. return flag;
  103. double dist = m_p.dist(pt);
  104. double t = time - m_timestamp;
  105. double avge_speed= dist/t*1000;
  106. 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);
  107. if(v<(1-0.3)*avge_speed && v>(1+0.3)*avge_speed)
  108. flag=true;
  109. return flag;
  110. }
  111. bool time_out(const point &p,uint64_t time)
  112. {
  113. if(time-m_timestamp>=10*60*1000 && !(p == m_p))
  114. return true;
  115. return false;
  116. }
  117. bool is_area_changed(int new_areaid)
  118. {
  119. bool flag =false;
  120. if(m_areaid != new_areaid)
  121. {
  122. m_areaid = new_areaid;
  123. flag=true;
  124. }
  125. return flag;
  126. }
  127. bool is_map_changed(int new_mapid)
  128. {
  129. bool flag =false;
  130. if(m_mapid != new_mapid)
  131. {
  132. m_mapid = new_mapid;
  133. flag=true;
  134. }
  135. return flag;
  136. }
  137. void push(uint64_t timestamp,const point & p,int32_t areaid,int32_t mapid)
  138. {
  139. if(m_p.empty() || m_timestamp==0||m_areaid<=0||m_mapid<=0)
  140. {
  141. set(p,timestamp);
  142. m_areaid=areaid;m_mapid=mapid;
  143. m_d.emplace(p,timestamp);
  144. return;
  145. }
  146. if(!is_valid())
  147. {
  148. //if(p==m_p)
  149. if(point::eq(p.x,m_p.x,0.2) && point::eq(p.y,m_p.y,0.2))
  150. {
  151. init_att();set(p,timestamp);
  152. m_d.emplace(p,timestamp);
  153. return ;
  154. }
  155. auto v=find_path(m_p,p);
  156. if(v.empty())
  157. m_arg=make_arg(p,m_p);
  158. else
  159. {
  160. log_info("his_location:more_abnormal_point....%d,(%.2f,%.2f)---(%.2f,%.2f)",m_cardid,m_p.x,m_p.y,p.x,p.y);
  161. handle_path(v,timestamp,true);
  162. return;
  163. }
  164. log_info("his_location:%d arg:%f",m_cardid,m_arg);
  165. insert();
  166. }
  167. bool flag=false;
  168. bool iflag=false;
  169. flag=handle_message(p,timestamp);
  170. //if(time_out(p,timestamp))
  171. // if(!flag)iflag=true;
  172. if(is_speed_changed(p,timestamp))
  173. if(!flag)iflag=true;
  174. if(is_area_changed(areaid))
  175. if(!flag)iflag=true;
  176. if(is_map_changed(mapid))
  177. if(!flag)iflag=true;
  178. if(iflag)
  179. {
  180. update(p,timestamp);
  181. //set_invalid();
  182. set(p,timestamp);
  183. insert();
  184. }
  185. }
  186. void insert()
  187. {
  188. //std::string tabName=getTabName();
  189. char nsql[512]={0};
  190. const char * sql = "replace into his_location (obj_id,card_type_id,ident,begin_time,map_id,area_id,begin_pt,direction)"
  191. "values(%d,%d,%d,'%s',%d,%d,'%.2f,%.2f',%f);";
  192. 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);
  193. log_info("his_location[%d]:%s",m_cardid,nsql);
  194. sDBConnPool.PushAsync(nsql);
  195. }
  196. void update(const point &p,uint64_t timestamp)
  197. {
  198. //std::string tabName=getTabName();
  199. char nsql[512]={0};
  200. 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;";
  201. double dist = m_p.dist(p);
  202. double t = timestamp - m_timestamp;
  203. double avge_speed= dist/t*1000;
  204. if(std::isnan(avge_speed)|| std::isinf(avge_speed))avge_speed=0;
  205. 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());
  206. log_info("his_location[%d]:%s",m_cardid,nsql);
  207. sDBConnPool.PushAsync(nsql);
  208. }
  209. std::vector<point> find_path(const point &p1,const point &p2)
  210. {
  211. std::vector<point> rc=card_path::inst().find_path(point(p1.x,-p1.y),point(p2.x,-p2.y));
  212. return std::move(rc);
  213. }
  214. //virtual bool handle_message(const point &p,uint64_t timestamp)=0;
  215. bool handle_message(const point &p,uint64_t timestamp)
  216. {
  217. bool flag = false;
  218. if(line_changed(p))
  219. {
  220. flag = true;
  221. std::vector<point> rc=find_path(m_d.back().p,p);
  222. if(rc.empty())
  223. {
  224. log_info("his_location:line_changed rc.empty() %d",m_cardid);
  225. update(m_d.back().p,m_d.back().time);
  226. set(m_d.back().p,m_d.back().time);
  227. }
  228. else
  229. {
  230. if(handle_path(rc,timestamp,false))
  231. return true;
  232. }
  233. //置m_arg非法
  234. init_att();
  235. }
  236. return flag;
  237. }
  238. bool handle_path(std::vector<point> &rc,uint64_t timestamp,bool flag)
  239. {
  240. double dis=0;point _p=m_p;
  241. std::for_each(rc.begin(),rc.end(),[&dis,&_p](point &pt){
  242. pt.y=-pt.y;dis+=_p.dist(pt);_p=pt;
  243. });
  244. uint64_t t=timestamp - m_timestamp;
  245. if(t==0)return true;
  246. double avge_speed= dis/t*1000;
  247. for(const point & pp:rc)
  248. {
  249. if(flag){
  250. m_arg=make_arg(pp,m_p);insert();
  251. }
  252. 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);
  253. double dist=m_p.dist(pp);uint64_t tt=dist/avge_speed*1000;
  254. uint64_t etime=m_timestamp+tt;
  255. update(pp,etime);set(pp,etime);
  256. flag=true;
  257. }
  258. return false;
  259. }
  260. };
  261. #if 0
  262. struct location_staff:location_card
  263. {
  264. location_staff(uint32_t id,uint64_t type,uint32_t objid)
  265. :location_card(id,type,objid)
  266. {}
  267. virtual std::string getTabName(){return std::string{"his_location_staff_"};}
  268. //人员如果运行方向发生变化的话,需要求的拐点。如果有拐点,入拐点。时间大与120s则不做处理。没有拐点,则不求
  269. virtual bool handle_message(const point &p,uint64_t timestamp)
  270. {
  271. bool flag = false;
  272. if(line_changed(p))
  273. {
  274. log_info("his_location:line_changed %d",m_cardid);
  275. flag=true;
  276. if(timestamp-m_timestamp>120*1000)
  277. {
  278. log_info("his_location:line_changed_timeout %d",m_cardid);
  279. update(m_d.back().p,m_d.back().time);
  280. set(p,timestamp);
  281. }
  282. else
  283. {
  284. log_info("his_location:line_changed_find_path %d,(%.2f,%.2f)-->(%.2f,%.2f)-->(%.2f,%.2f)",m_cardid,m_p.x,m_p.y,m_d.back().p.x,m_d.back().p.y,p.x,p.y);
  285. if(rc.empty())
  286. {
  287. log_info("his_location:line_changed rc.empty() %d",m_cardid);
  288. update(m_d.back().p,m_d.back().time);
  289. set(m_d.back().p,m_d.back().time);
  290. }
  291. else
  292. {
  293. for(uint32_t i=0;i<rc.size();i++)
  294. log_info("his_location:find_path..x=%.3lf,y=%.3lf\n",rc[i].x,rc[i].y);
  295. if(rc.size()==1)
  296. {
  297. log_info("his_location:line_changed %d circle point(%.2f,%.2f)",m_cardid,rc[0].x,rc[0].y);
  298. point tmp(rc[0].x,-rc[0].y);
  299. update(tmp,m_d.back().time);
  300. set(tmp,m_d.back().time);
  301. }
  302. else if(rc.size()==2)
  303. {
  304. point tmp(rc[0].x,-rc[0].y);
  305. update(tmp,m_d.back().time);
  306. set(tmp,m_d.back().time);
  307. //
  308. tmp.set(rc[1].x,-rc[1].y);
  309. m_arg=make_arg(tmp,m_p);
  310. insert();
  311. //
  312. update(tmp,timestamp);
  313. set(tmp,timestamp);
  314. }
  315. else//更多的拐点
  316. {
  317. point tmp(rc[0].x,-rc[0].y);
  318. update(tmp,m_d.back().time);
  319. tmp.set(rc.back().x,-rc.back().y);
  320. set(tmp,timestamp);
  321. }
  322. }
  323. }
  324. init_att();
  325. }
  326. return flag;
  327. }
  328. };
  329. struct location_vehicle:location_card
  330. {
  331. location_vehicle(uint32_t id,uint64_t type,uint32_t objid)
  332. :location_card(id,type,objid)
  333. {}
  334. virtual std::string getTabName(){return std::string{"his_location_vehicle_"};}
  335. //车辆是有推送拐点的,所以不需要求拐点。如果运行方向发生变化的话,直接更新数据库即可,使用上一个点的时间。同时生成这一次的历史。
  336. virtual bool handle_message(const point &p,uint64_t timestamp)
  337. {
  338. bool flag =false;
  339. if(line_changed(p))
  340. {
  341. flag=true;
  342. //如果有拐点,说明是丢失信号后,飞跃得过程
  343. // std::vector<point> rc=card_path::inst().find_path(point(m_d.back().p.x,-m_d.back().p.y),point(p.x,-p.y));
  344. log_info("his_location:line_changed %d ",m_cardid);
  345. update(m_d.back().p,m_d.back().time);
  346. set(m_d.back().p,m_d.back().time);init_att();
  347. }
  348. return flag;
  349. }
  350. };
  351. #endif
  352. #endif