1
0

ant.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576
  1. #include <stdio.h>
  2. #include <string.h>
  3. #include <math.h>
  4. #include "ant.h"
  5. #include "db_api/CDBSingletonDefine.h"
  6. #include "event.h"
  7. #include "tool_time.h"
  8. #include "area.h"
  9. #include "card_path.h"
  10. //template<> std::shared_ptr<sit_list> single_base<sit_list, int, std::shared_ptr<site>>::m_instance=std::make_shared<sit_list>();
  11. int site::index()const
  12. {
  13. return m_algo+(m_num_dims<<1);
  14. }
  15. site::site(int id)
  16. :m_algo(0)
  17. ,m_num_dims(0)
  18. ,m_id(id)
  19. ,m_path_empty(true)
  20. {
  21. m_time=time(0);
  22. for(uint32_t i=0;i<m_timeoff_count.size();i++)
  23. m_timeoff_count[i]=0;
  24. }
  25. const algo_config&site::config()const
  26. {
  27. return g_config[index()];
  28. }
  29. void ant::set_path(const std::vector<line_v>&v_line,std::vector<line_v>::const_iterator itm)
  30. {
  31. auto it=itm;
  32. for(int i=0;i<2 && it!=v_line.end();++it,++i)
  33. m_path[0][i]=*it;
  34. it=itm-1;
  35. for(int i=0;i<2 && it>=v_line.begin();--it,++i)
  36. {
  37. m_path[1][i]=*it;
  38. m_path[1][i].swap_point();
  39. }
  40. for(int i=0;i<2;i++)
  41. {
  42. point _p=m_path[i][0].line::projection(*this);
  43. m_path[i][0].set_point(0,_p);
  44. }
  45. for(const auto&p:m_path)
  46. {
  47. log_info("site-path: %s",p.to_str().c_str());
  48. }
  49. }
  50. void ant::set_path(const std::vector<line_v>&v_line_)
  51. {
  52. std::vector<line_v> vl(v_line_);
  53. vl.reserve(vl.size()+2);
  54. //找到距离天线最近的端点
  55. auto min_it=vl.begin();
  56. double dist=10;
  57. for(auto it=vl.begin();it!=vl.end();it++)
  58. {
  59. double d=it->as_line().dist(*this);
  60. if(d<dist)
  61. {
  62. dist=d;
  63. min_it=it;
  64. }
  65. }
  66. if(min_it==vl.end())
  67. {
  68. log_error("分站路径距离分站太远site_id=%d",m_id);
  69. return;
  70. }
  71. if(abs(min_it->v[0].dist(*this)-dist)<1)
  72. {
  73. set_path(vl,min_it);
  74. }
  75. else if(abs(min_it->v[1].dist(*this)-dist)<1)
  76. {
  77. set_path(vl,min_it+1);
  78. }
  79. else
  80. {
  81. point proj=min_it->projection(*this);
  82. vl.insert(min_it+1,line_v(proj,min_it->v[1]));
  83. min_it->set_point(1,proj);
  84. if(min_it->v[0].z)//slope ..555
  85. {
  86. double slope=min_it->v[0].z;
  87. double len_a=min_it->v[0].dist((min_it+1)->v[1]);
  88. double len_0=slope*min_it->length()/len_a;
  89. double len_1=slope-len_0;
  90. min_it->v[0].z=min_it->v[1].z=len_0;
  91. (min_it+1)->v[0].z=(min_it+1)->v[1].z=len_1;
  92. }
  93. set_path(vl,min_it+1);
  94. }
  95. }
  96. void site::set_path(const std::vector<line_v>&v_line)
  97. {
  98. if(v_line.empty())
  99. return;
  100. const auto&find_line=[](const point&pt,int first,std::vector<line_v>&vl){
  101. for(auto it=vl.begin();it!=vl.end();it++)
  102. {
  103. if(it->v[first].dist(pt)<1)
  104. return it;
  105. if(it->v[first?0:1].dist(pt)<1)
  106. {
  107. point p=it->v[0];
  108. it->v[0]=it->v[1];
  109. it->v[1]=p;
  110. return it;
  111. }
  112. }
  113. return vl.end();
  114. };
  115. //构造一个首尾相连的结构
  116. std::vector<line_v> vl(v_line.begin()+1,v_line.end());
  117. std::vector<line_v> target(v_line.begin(),v_line.begin()+1);
  118. #if 0
  119. target[0][0].z=target[0][1].z=slope[0];
  120. for(int i=0,c=vl.size();i<c;i++)
  121. vl[i][0].z=vl[i][1].z=slope[i+1];
  122. #endif
  123. for(;;)
  124. {
  125. auto it=find_line(target.back().v[1],0,vl);
  126. if(it==vl.end())
  127. break;
  128. target.insert(target.end(),it,it+1);
  129. vl.erase(it);
  130. }
  131. for(;;)
  132. {
  133. auto it=find_line(target.front().v[0],1,vl);
  134. if(it==vl.end())
  135. break;
  136. target.insert(target.begin(),it,it+1);
  137. vl.erase(it);
  138. }
  139. log_info("初始化分站路径:site_id=%d",m_id);
  140. for(auto&a:m_ant)
  141. {
  142. a.set_path(target);
  143. }
  144. m_path_empty= !m_ant[0][0].valid() && !m_ant[0][1].valid() ;
  145. }
  146. std::vector<point> ant::getsol(const double &dist) const
  147. {
  148. std::vector<point> v;
  149. for(const auto & p : m_path)
  150. {
  151. if(!p.valid())
  152. continue;
  153. point pt;
  154. double d = dist;
  155. if(dist <= p.m_line[0].length())
  156. {
  157. d += d*p.m_line[0][0].z;
  158. pt = point(p.m_line[0][0].x + d*p.m_line[0].cos() , p.m_line[0][0].y + d*p.m_line[0].sin());
  159. }
  160. else if(p.m_line[1].length()>0)
  161. {
  162. d -= p.m_line[0].length()*(1-d*p.m_line[0][1].z);
  163. d += d*p.m_line[1][0].z;
  164. pt = point(p.m_line[1][0].x+d*p.m_line[1].cos(),p.m_line[1][0].y+d*p.m_line[1].sin());
  165. }
  166. else
  167. {
  168. continue;
  169. }
  170. v.push_back(pt);
  171. }
  172. return std::move(v);
  173. }
  174. bool visit_site_status::visit(std::shared_ptr<site> s)
  175. {
  176. time_t now=time(0);
  177. int diff = now-s->m_time;
  178. event_tool::instance()->handle_event(OT_DEVICE_READER,ET_READER_ERROR,s->m_id,READER_TIMEOUT,diff,diff>READER_TIMEOUT);
  179. return true;
  180. }
  181. static void test_find_path(card_path&cp,const point&p1,const point&p2)
  182. {
  183. printf("\nfind-path: from=(%.3lf,%.3lf),to=(%.3lf,%.3lf)\n",p1.x,p1.y,p2.x,p2.y);
  184. std::vector<point> rc=cp.find_path(p1,p2);
  185. for(uint32_t i=0;i<rc.size();i++)
  186. printf("x=%.3lf,y=%.3lf\n",rc[i].x,rc[i].y);
  187. }
  188. //static void test_find_poss_path(const card_path&cp ,const point&from)
  189. //{
  190. // log_info("\nfind-poss_path: from=(%.3lf,%.3lf)\n",from.x,from.y);
  191. // std::vector<line_v> rc=cp.find_possible_path(from,3);
  192. // for(uint32_t i=0;i<rc.size();i++)
  193. // {
  194. // log_info("poss path from=(%.3lf,%.3lf) to=(%.3lf,%.3lf)\n", rc[i][0].x,rc[i][0].y, rc[i][1].x,rc[i][1].y);
  195. // }
  196. //}
  197. void sit_list::read_ant_path(int id)
  198. {
  199. std::string sql = "SELECT reader_id,tof_flag,b_x,b_y,b_z,e_x,e_y,e_z,spacing_ratio FROM dat_reader_path_tof_n";
  200. std::map<int,std::vector<line_v>> map_path;
  201. if(-1 == id)
  202. {
  203. sql.append(";");
  204. }
  205. else
  206. {
  207. sql.append(" where reader_id=");
  208. sql.append(std::to_string(id));
  209. sql.append(";");
  210. std_debug("修改path sql=%s", sql.c_str());
  211. log_info("修改path sql=%s", sql.c_str());
  212. }
  213. std::string Error;
  214. YADB::CDBResultSet DBRes;
  215. sDBConnPool.Query(sql.c_str(),DBRes,Error);
  216. int nCount = DBRes.GetRecordCount( Error );
  217. if (nCount < 1)
  218. {
  219. log_error("修改path失败,数据库中找不到(dat_reader_path_tof_n): 分站id=%d", id);
  220. return ;
  221. }
  222. log_info( "read_ant_path. The record count=%ld\n", nCount );
  223. while ( DBRes.GetNextRecod(Error) )
  224. {
  225. int reader_id = 0;
  226. DBRes.GetField( "reader_id",reader_id, Error );
  227. auto site_ptr=sit_list::instance()->get(reader_id);
  228. if(nullptr==site_ptr)
  229. continue;
  230. int pid=0;
  231. DBRes.GetField( "tof_flag",pid, Error );
  232. double b_x= 0;
  233. DBRes.GetField( "b_x",b_x, Error );
  234. double b_y= 0;
  235. DBRes.GetField( "b_y",b_y, Error );
  236. double b_z= 0;
  237. DBRes.GetField( "b_z",b_z, Error );
  238. double e_x= 0;
  239. DBRes.GetField( "e_x",e_x, Error );
  240. double e_y= 0;
  241. DBRes.GetField( "e_y",e_y, Error );
  242. double e_z= 0;
  243. DBRes.GetField( "e_z",e_z, Error );
  244. double spacing_ratio = 0;
  245. DBRes.GetField( "spacing_ratio",spacing_ratio, Error );
  246. log_info("ant_path:%d,%.2f,%.2f,%.2f,%.2f",reader_id,b_x,b_y,e_x,e_y);
  247. point p1(b_x,-b_y, spacing_ratio);
  248. point p2(e_x,-e_y, spacing_ratio);
  249. map_path.insert(std::make_pair(reader_id,std::vector<line_v>()));
  250. map_path.find(reader_id)->second.push_back(line_v(p1,p2));
  251. #if 0
  252. auto &sit_ = *site_ptr;
  253. if(-1!=id)//清空path
  254. {
  255. sit_.clear_path();
  256. log_info( "修改path 清空path,分站id=%d\n", id );
  257. }
  258. if(pid == 0)
  259. {
  260. line_v l(p1,p2);
  261. {
  262. point px = l.line::projection(sit_);
  263. sit_.set(px);
  264. for(int i=0;i<2;i++)
  265. {
  266. path p;
  267. p.m_slope[0] = spacing_ratio;
  268. p.m_line[0] = line_v(px,l[i]);
  269. sit_.m_ant[i].m_path.push_back(p);
  270. }
  271. }
  272. }
  273. else
  274. {
  275. ant &a = pid<0?sit_.m_ant[0]:sit_.m_ant[1];
  276. if(a.m_path.size()!=0)
  277. {
  278. path &p = a.m_path[0];
  279. p.m_line[abs(pid)-1] = line_v(p1,p2);
  280. p.m_slope[abs(pid)-1] = spacing_ratio;
  281. }
  282. else
  283. {
  284. path p;
  285. p.m_line[abs(pid)-1] = line_v(p1,p2);
  286. p.m_slope[abs(pid)-1] = spacing_ratio;
  287. a.m_path.push_back(p);
  288. }
  289. if(abs(pid)==1)
  290. sit_.set(p1);
  291. }
  292. #endif
  293. }
  294. #if 0
  295. if(-1==id)
  296. {
  297. for(auto&_s:sit_list::instance()->m_map)
  298. {
  299. _s.second->deal_path();
  300. }
  301. }
  302. else
  303. {
  304. auto sit_ptr=sit_list::instance()->get(id);
  305. if(sit_ptr)
  306. {
  307. sit_ptr->deal_path();
  308. log_info( "修改path成功,分站id=%d\n", id );
  309. }
  310. }
  311. #endif
  312. for(auto&vl:map_path)
  313. {
  314. auto sit_ptr=sit_list::instance()->get(vl.first);
  315. if(!sit_ptr)
  316. {
  317. log_error("定义了分站路径,但是没有定义分站:%d",vl.first);
  318. continue;
  319. }
  320. sit_ptr->set_path(vl.second);
  321. }
  322. card_path::init();
  323. test_find_path(card_path::inst(),point(4714.70,-8.06),point(5427.04,-304.02));
  324. }
  325. void sit_list::init_site(int id)
  326. {
  327. std::string sql = "SELECT reader_id, reader_type_id, dat_reader.map_id, \
  328. area_id, device_type_id, dimension, dat_map.scale,need_power_alarm\
  329. FROM dat_reader, dat_map where \
  330. dat_reader.map_id=dat_map.map_id and state=0";
  331. if(-1 == id)
  332. {
  333. sql.append(";");
  334. }
  335. else
  336. {
  337. sql.append(" AND reader_id=");
  338. sql.append(std::to_string(id));
  339. sql.append(";");
  340. std_debug("增加或修改分站 sql=%s", sql.c_str());
  341. log_info("增加或修改分站 sql=%s", sql.c_str());
  342. }
  343. std::string Error;
  344. YADB::CDBResultSet DBRes;
  345. sDBConnPool.Query(sql.c_str(),DBRes,Error);
  346. int nCount = DBRes.GetRecordCount( Error );
  347. if (nCount < 1)
  348. {
  349. log_error("增加或修改失败,数据库中找不到: 分站id=%d", id);
  350. return ;
  351. }
  352. log_info( "init_site. The record count=%ld\n", nCount );
  353. while ( DBRes.GetNextRecod(Error) )
  354. {
  355. int reader_id = 0;
  356. DBRes.GetField( "reader_id",reader_id, Error );
  357. auto site_ptr=sit_list::instance()->get(reader_id);
  358. if(nullptr==site_ptr)
  359. {
  360. site_ptr = std::make_shared<site>(reader_id);
  361. sit_list::instance()->add(reader_id,site_ptr);
  362. }
  363. int reader_type_id = 0;
  364. DBRes.GetField( "reader_type_id",reader_type_id, Error );
  365. int map_id = 0;
  366. DBRes.GetField( "map_id",map_id, Error );
  367. int area_id = 0;
  368. DBRes.GetField( "area_id",area_id, Error );
  369. int device_type_id = 0;
  370. DBRes.GetField( "device_type_id",device_type_id, Error );
  371. int dimension = 0;
  372. DBRes.GetField( "dimension",dimension, Error );
  373. double scale= 0;
  374. DBRes.GetField( "scale",scale, Error );
  375. int power_alarm = 0;
  376. DBRes.GetField( "need_power_alarm",power_alarm, Error );
  377. site_ptr->m_reader_type_id = reader_type_id;
  378. site_ptr->m_map_id = map_id;
  379. site_ptr->m_area_id = area_id;
  380. site_ptr->m_power_check_enable=power_alarm;
  381. site_ptr->m_device_type_id = device_type_id;
  382. site_ptr->m_dimension = dimension;
  383. site_ptr->m_scale = scale;
  384. site_ptr->create_area();
  385. }
  386. }
  387. void sit_list::read_sit_list(int id)
  388. {
  389. std::string sql = "SELECT antenna_id, a.reader_id, idx, a.x, a.y, a.z, a.angle \
  390. FROM dat_antenna a, dat_reader r \
  391. WHERE a.reader_id = r.reader_id";
  392. if(-1 == id)
  393. {
  394. sql.append(";");
  395. }
  396. else
  397. {
  398. sql.append(" AND antenna_id=");
  399. sql.append(std::to_string(id));
  400. sql.append(";");
  401. log_info("基础数据 增加或修改天线 sql=%s", sql.c_str());
  402. }
  403. std::string Error;
  404. YADB::CDBResultSet DBRes;
  405. sDBConnPool.Query(sql.c_str(),DBRes,Error);
  406. int nCount = DBRes.GetRecordCount( Error );
  407. if (nCount < 1)
  408. {
  409. log_error("基础数据 增加或修改失败,数据库中找不到: 天线id=%d", id);
  410. return ;
  411. }
  412. log_info( "init_antenna. The record count=%ld\n", nCount );
  413. while ( DBRes.GetNextRecod(Error) )
  414. {
  415. int antenna_id = 0;
  416. DBRes.GetField( "antenna_id",antenna_id, Error );
  417. int reader_id = 0;
  418. DBRes.GetField( "reader_id",reader_id, Error );
  419. int idx=0;
  420. DBRes.GetField( "idx",idx, Error );
  421. int antid = idx-1;
  422. if(antid >= 2)
  423. continue;
  424. double x= 0;
  425. DBRes.GetField( "x",x, Error );
  426. double y= 0;
  427. DBRes.GetField( "y",y, Error );
  428. double z= 0;
  429. DBRes.GetField( "z",z, Error );
  430. if(-1 == id)
  431. {
  432. std::shared_ptr<site> site_ptr=nullptr;
  433. site_ptr = sit_list::instance()->get(reader_id);
  434. if(!site_ptr)
  435. continue;
  436. site_ptr->m_ant[antid].m_id = antenna_id;
  437. site_ptr->m_ant[antid].set(x,-y);
  438. site_ptr->set_ex();
  439. log_info("reand_ant..%d,%d,%.2f,%.2f",reader_id,antid,x,y);
  440. }
  441. else
  442. {
  443. auto site_ptr = sit_list::instance()->get(reader_id);
  444. if(site_ptr)
  445. {
  446. site_ptr->m_ant[antid].set(x,-y);
  447. site_ptr->set_ex();
  448. }
  449. log_info("基础数据 增加或修改天线成功:天线id:%d,分站id:%d",id,reader_id);
  450. }
  451. }
  452. }
  453. void site::create_area()
  454. {
  455. m_area=std::make_shared<area>(-m_id,0,0,m_scale,m_map_id,1<<7);
  456. }
  457. /*
  458. 处理分站供电状态,交流供电时,ac_down=false,直流供电时,ac_down=true
  459. 目前只有大分站实现了这个功能,并且井下安装时是否接入了该电信号也不确定
  460. ,所以需要有张表定义某个ID是否需要告警
  461. */
  462. void site::on_power_status(bool ac_down)//电源状态
  463. {
  464. if(!m_power_check_enable || ac_down == m_power_ac_down)
  465. {
  466. return;
  467. }
  468. m_power_ac_down=ac_down;
  469. event_tool::instance()->handle_event(OT_DEVICE_READER,ET_READER_POWER_BY_BATTERY,id(),tool_time::now_to_seconds(),ac_down,m_power_ac_down);
  470. log_info("[event warning: reader power supply by battery] reader_id: Power %d->%d.",id(),!m_power_ac_down,m_power_ac_down);
  471. }
  472. algo_config site::g_config[]=
  473. {
  474. { "tof-1", 1, 2, 0.1, 1 },
  475. { "tdoa-1", 2, 2, 0.1, 1 },
  476. { "tof-2", 2, 3, 0.1, 1 },
  477. { "tdoa-2", 3, 3, 0.1, 1 },
  478. { "tof-3", 3, 4, 0.1, 1 },
  479. { "tdoa-3", 4, 4, 0.1, 1 }
  480. };
  481. #ifdef _TEST
  482. int main()
  483. {
  484. log_init("./log.ini");
  485. //sit_list *sl = sit_list::instance();
  486. sit_list::instance()->load("data_reader_antenna.txt","path_tof.txt");
  487. sit_list::instance()->get(209)->solving(0,100);
  488. sit_list::instance()->get(209)->solving(1,100.5);
  489. //std_info("---%d",(*sl)[209].m_ant[0].m_path.size());
  490. //std_info("---%d",(*sl)[209][0].size());
  491. //std_info("---%s",(*sl)[209][0][0][0].to_string().c_str());
  492. }
  493. #endif