Skip to content

Commit

Permalink
Merge branch 'feature-clean'
Browse files Browse the repository at this point in the history
  • Loading branch information
@cyang-kth
cyang-kth committed Feb 1, 2020
2 parents 520645f + 0e84bd0 commit 506ee9a
Show file tree
Hide file tree
Showing 34 changed files with 3,985 additions and 3,385 deletions.
197 changes: 101 additions & 96 deletions app/fmm.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -20,110 +20,115 @@
#include "../src/gps.hpp"
#include "../src/reader.hpp"
#include "../src/writer.hpp"
#include "../src/multilevel_debug.h"
#include "../src/debug.h"
#include "../src/config.hpp"
using namespace std;
using namespace MM;
using namespace MM::IO;
int main (int argc, char **argv)
{
std::cout<<"------------ Fast map matching (FMM) ------------"<<endl;
std::cout<<"------------ Author: Can Yang ------------"<<endl;
std::cout<<"------------ Version: 2018.03.09 ------------"<<endl;
std::cout<<"------------ Applicaton: fmm ------------"<<endl;
if (argc<2)
spdlog::set_pattern("[%s:%#] %v");
std::cout<<"------------ Fast map matching (FMM) ------------"<<endl;
std::cout<<"------------ Author: Can Yang ------------"<<endl;
std::cout<<"------------ Version: 2020.01.31 ------------"<<endl;
std::cout<<"------------ Applicaton: fmm ------------"<<endl;
if (argc<2)
{
std::cout<<"No configuration file supplied"<<endl;
std::cout<<"A configuration file is given in the example folder"<<endl;
std::cout<<"Run `fmm config.xml`"<<endl;
} else {
std::string configfile(argv[1]);
FMM_Config config(configfile);
if (!config.validate_mm())
{
std::cout<<"No configuration file supplied"<<endl;
std::cout<<"A configuration file is given in the example folder"<<endl;
std::cout<<"Run `fmm config.xml`"<<endl;
std::cout<<"Invalid configuration file, program stop"<<endl;
return 0;
};
config.print();
spdlog::set_level((spdlog::level::level_enum) config.log_level);
// clock_t begin_time = clock(); // program start time
std::chrono::steady_clock::time_point begin =
std::chrono::steady_clock::now();
Network network(
config.network_file,config.network_id,
config.network_source,config.network_target);
network.build_rtree_index();
int multiplier = network.get_node_count();
if (multiplier==0) multiplier = 50000;
UBODT *ubodt=nullptr;
if (config.binary_flag==1) {
ubodt = read_ubodt_binary(config.ubodt_file,multiplier);
} else {
std::string configfile(argv[1]);
FMM_Config config(configfile);
if (!config.validate_mm())
{
std::cout<<"Invalid configuration file, program stop"<<endl;
return 0;
};
config.print();
// clock_t begin_time = clock(); // program start time
std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();
Network network(config.network_file,config.network_id,config.network_source,config.network_target);
network.build_rtree_index();
int multiplier = network.get_node_count();
if (multiplier==0) multiplier = 50000;
UBODT *ubodt=nullptr;
if (config.binary_flag==1){
ubodt = read_ubodt_binary(config.ubodt_file,multiplier);
} else {
ubodt = read_ubodt_csv(config.ubodt_file,multiplier);
}
if (!config.delta_defined){
config.delta = ubodt->get_delta();
std::cout<<" Delta inferred from ubodt as "<< config.delta <<'\n';
}
TrajectoryReader tr_reader(config.gps_file,config.gps_id);
ResultConfig result_config = config.get_result_config();
ResultWriter rw(config.result_file,&network,result_config);
int progress=0;
int points_matched=0;
int total_points=0;
int num_trajectories = tr_reader.get_num_trajectories();
int step_size = num_trajectories/10;
if (step_size<10) step_size=10;
std::chrono::steady_clock::time_point corrected_begin = std::chrono::steady_clock::now();
std::cout<<"Start to map match trajectories with total number "<< num_trajectories <<'\n';
// The header is moved to constructor of result writer
// rw.write_header();
ubodt = read_ubodt_csv(config.ubodt_file,multiplier);
}
if (!config.delta_defined) {
config.delta = ubodt->get_delta();
std::cout<<" Delta inferred from ubodt as "<< config.delta <<'\n';
}
TrajectoryReader tr_reader(config.gps_file,config.gps_id);
ResultConfig result_config = config.get_result_config();
ResultWriter rw(config.result_file,network,result_config);
int progress=0;
int points_matched=0;
int total_points=0;
int num_trajectories = tr_reader.get_num_trajectories();
int step_size = num_trajectories/10;
if (step_size<10) step_size=10;
std::chrono::steady_clock::time_point corrected_begin =
std::chrono::steady_clock::now();
std::cout<<"Start to map match trajectories with total number "
<< num_trajectories <<'\n';
// The header is moved to constructor of result writer
// rw.write_header();

while (tr_reader.has_next_feature())
{
DEBUG(2) std::cout<<"Start of the loop"<<'\n';
Trajectory trajectory = tr_reader.read_next_trajectory();
int points_in_tr = trajectory.geom->getNumPoints();
if (progress%step_size==0) std::cout<<"Progress "<<progress << " / " << num_trajectories <<'\n';
DEBUG(1) std::cout<<"\n============================="<<'\n';
DEBUG(1) std::cout<<"Process trips with id : "<<trajectory.id<<'\n';
// Candidate search
Traj_Candidates traj_candidates = network.search_tr_cs_knn(trajectory,config.k,config.radius,config.gps_error);
TransitionGraph tg = TransitionGraph(&traj_candidates,trajectory.geom,ubodt,config.delta);
// Optimal path inference
O_Path *o_path_ptr = tg.viterbi(config.penalty_factor);
// Complete path construction as an array of indices of edges vector
T_Path *t_path_ptr = ubodt->construct_traversed_path(o_path_ptr);
// C_Path *c_path_ptr = ubodt->construct_complete_path(o_path_ptr);
if (result_config.write_mgeom) {
LineString *m_geom = network.complete_path_to_geometry(o_path_ptr,&(t_path_ptr->cpath));
rw.write_result(trajectory.id,trajectory.geom,o_path_ptr,t_path_ptr,m_geom);
delete m_geom;
} else {
rw.write_result(trajectory.id,trajectory.geom,o_path_ptr,t_path_ptr,nullptr);
}
// update statistics
total_points+=points_in_tr;
if (t_path_ptr!=nullptr) points_matched+=points_in_tr;
DEBUG(1) std::cout<<"Free memory of o_path and c_path"<<'\n';
++progress;
delete o_path_ptr;
delete t_path_ptr;
DEBUG(1) std::cout<<"============================="<<'\n';
}
std::cout<<"\n============================="<<'\n';
std::cout<<"MM process finished"<<'\n';
std::chrono::steady_clock::time_point end= std::chrono::steady_clock::now();
// clock_t end_time = clock(); // program end time
// Unit is second
// double time_spent = (double)(end_time - begin_time) / CLOCKS_PER_SEC;
double time_spent = std::chrono::duration_cast<std::chrono::milliseconds>(end - begin).count()/1000.;
double time_spent_exclude_input = std::chrono::duration_cast<std::chrono::milliseconds>(end - corrected_begin).count()/1000.;
std::cout<<"Time takes "<<time_spent<<'\n';
std::cout<<"Time takes excluding input "<<time_spent_exclude_input<<'\n';
std::cout<<"Finish map match total points "<<total_points
<<" and points matched "<<points_matched<<'\n';
std::cout<<"Matched percentage: "<<points_matched/(double)total_points<<'\n';
std::cout<<"Point match speed:"<<points_matched/time_spent<<"pt/s"<<'\n';
std::cout<<"Point match speed (excluding input): "<<points_matched/time_spent_exclude_input<<"pt/s"<<'\n';
delete ubodt;
while (tr_reader.has_next_feature())
{
Trajectory trajectory = tr_reader.read_next_trajectory();
int points_in_tr = trajectory.geom.getNumPoints();
if (progress%step_size==0)
std::cout<<"Progress "<<progress << " / " << num_trajectories <<'\n';
// Candidate search
Traj_Candidates traj_candidates = network.search_tr_cs_knn(
trajectory,config.k,config.radius,config.gps_error);
TransitionGraph tg(
&traj_candidates,trajectory.geom,*ubodt,config.delta);
// Optimal path inference
O_Path o_path = tg.viterbi(config.penalty_factor);
T_Path t_path = ubodt->construct_traversed_path(o_path,network);
LineString m_geom;
if (result_config.write_mgeom) {
m_geom = network.complete_path_to_geometry(o_path,t_path.cpath);
}
rw.write_result(trajectory.id,trajectory.geom,o_path,t_path,m_geom);
// update statistics
total_points+=points_in_tr;
if (!t_path.cpath.empty()) points_matched+=points_in_tr;
++progress;
}
std::cout<<"------------ Program finished ------------"<<endl;
return 0;
std::cout<<"\n============================="<<'\n';
std::cout<<"MM process finished"<<'\n';
std::chrono::steady_clock::time_point end= std::chrono::steady_clock::now();
// clock_t end_time = clock(); // program end time
// Unit is second
// double time_spent = (double)(end_time - begin_time) / CLOCKS_PER_SEC;
double time_spent =
std::chrono::duration_cast<std::chrono::milliseconds>
(end - begin).count()/1000.;
double time_spent_exclude_input =
std::chrono::duration_cast<std::chrono::milliseconds>
(end - corrected_begin).count()/1000.;
std::cout<<"Time takes "<<time_spent<<'\n';
std::cout<<"Time takes excluding input "<<time_spent_exclude_input<<'\n';
std::cout<<"Finish map match total points "<<total_points
<<" and points matched "<<points_matched<<'\n';
std::cout<<"Matched percentage: "
<<points_matched/(double)total_points<<'\n';
std::cout<<"Point match speed:"<<points_matched/time_spent<<"pt/s"<<'\n';
std::cout<<"Point match speed (excluding input): "
<<points_matched/time_spent_exclude_input<<"pt/s"<<'\n';
delete ubodt;
}
std::cout<<"------------ Program finished ------------"<<endl;
return 0;
};
Loading

0 comments on commit 506ee9a

Please sign in to comment.