Home
last modified time | relevance | path

Searched refs:phi_point (Results 1 – 13 of 13) sorted by relevance

/dports/cad/sumo/sumo-1.2.0/tools/contributed/sumopy/plugins/mapmatching/
H A Dmapmatching-02-allprint.py403 phi_point = np.arctan2(delta_point[1], delta_point[0])
408 ids_point[ind_point], dist_interpoint, length_gps, phi_point/np.pi*180)
459 … cost_edge = self._get_cost_birgil(point, id_edge, phi_point, get_dist_point_to_edge)
471 … cost_edge = self._get_cost_birgil(point, id_edge, phi_point, get_dist_point_to_edge)
482 … cost += self._get_cost_birgil(point, id_edge_last, phi_point, get_dist_point_to_edge)
555 def _get_cost_birgil(self, p, id_edge, phi_point, get_dist_point_to_edge): argument
575 …print ' phi_point,phi_seg,phi_point-phi_seg, delta_phi', phi_point/np.pi*180, phi_seg/np.pi *…
576 … 180, (phi_point-phi_seg)/np.pi*180, np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)/np.pi*180
578 cost = dist_ps*np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-04-improveok.py429 phi_point = np.arctan2(delta_point[1], delta_point[0])
434 ids_point[ind_point], dist_interpoint, length_gps, phi_point/np.pi*180)
491 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
510 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
523 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
606 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
627 …dist, phi_point/np.pi*180, phi_seg/np.pi*180, (phi_point-phi_seg)/np.pi*180, np.clip(phi_point-phi…
629 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-03-birgil-ok.py418 phi_point = np.arctan2(delta_point[1], delta_point[0])
423 ids_point[ind_point], dist_interpoint, length_gps, phi_point/np.pi*180)
480 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
499 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
512 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
586 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
608 cost_angle = dist_ps*np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-05-ok-preinter.py441 phi_point = np.arctan2(delta_point[1], delta_point[0])
498 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
517 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
530 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
616 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
638 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-08-save_failed.py441 phi_point = np.arctan2(delta_point[1], delta_point[0])
498 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
517 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
530 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
616 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
638 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-07-shortestpathok.py441 phi_point = np.arctan2(delta_point[1], delta_point[0])
498 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
517 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
530 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
616 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
638 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-06-resultchaos.py461 phi_point = np.arctan2(delta_point[1], delta_point[0])
518 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
537 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
550 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
636 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
658 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-09-result_desaster.py467 phi_point = np.arctan2(delta_point[1], delta_point[0])
524 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
543 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
556 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
642 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
664 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-10-preresults.py462 phi_point = np.arctan2(delta_point[1], delta_point[0])
520 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
540 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
554 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
642 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
664 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-11-shortestproblem.py473 phi_point = np.arctan2(delta_point[1], delta_point[0])
531 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
551 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
565 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
653 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
675 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-12-oldpointassign.py476 phi_point = np.arctan2(delta_point[1], delta_point[0])
534 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
554 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
568 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
656 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
678 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching-13-prespeedchange.py477 phi_point = np.arctan2(delta_point[1], delta_point[0])
535 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
555 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
569 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
657 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
679 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))
H A Dmapmatching.py488 phi_point = np.arctan2(delta_point[1], delta_point[0])
546 cost_edge = self._get_cost_birgil(point, id_edge, phi_point,
566 point, id_edge, phi_point, accesslevel, get_dist_point_to_edge)
580 cost += self._get_cost_birgil(point, id_edge_last, phi_point,
668 def _get_cost_birgil(self, p, id_edge, phi_point, accesslevel, get_dist_point_to_edge): argument
690 cost_angle = np.abs(np.sin(np.clip(phi_point-phi_seg, -np.pi/2, np.pi/2)))