1
0

ant.cpp 13 KB

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