{"id":"W2368688974","doi":"","title":"Traffic Navigation based on Dijkstra Algorithm and OpenCV","year":2013,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Simulation and Modeling Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Dijkstra's algorithm; Shortest path problem; Computer science; Pathfinding; Yen's algorithm; K shortest path routing; Path (computing); Shortest Path Faster Algorithm; Navigation system; Euclidean shortest path; Algorithm; A* search algorithm; Line (geometry); Artificial intelligence; Computer vision; Theoretical computer science; Computer network; Mathematics; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005105868,0.000978978,0.0008633026,0.002215927,0.0009106975,0.001539691,0.002286141,0.001263739,0.01123304],"category_scores_gemma":[0.002308154,0.0006312582,0.001050317,0.002030486,0.0004529328,0.001804636,0.001274105,0.001183946,0.00376335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009825011,"about_ca_system_score_gemma":0.00247194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03419076,"about_ca_topic_score_gemma":0.01635742,"domain_scores_codex":[0.999077,0.00009383202,0.0000576891,0.0002568362,0.0004051354,0.0001095581],"domain_scores_gemma":[0.9994678,0.00007014691,0.00002177332,0.00005082378,0.0003581796,0.00003131855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003643191,0.0002177246,0.002125286,0.0005466517,0.0001586475,0.00024093,0.000535499,0.1152036,0.01811793,0.03424586,0.06157015,0.7666733],"study_design_scores_gemma":[0.00009954513,0.00004899487,0.0009488855,0.00006743531,0.00006207221,0.0002481118,0.00008805412,0.8877776,0.02200551,0.01433155,0.07419762,0.0001246824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004038075,0.0001911808,0.9630365,0.00009186009,0.0001280398,0.00008542923,0.0005252174,0.02604199,0.0058617],"genre_scores_gemma":[0.1539778,0.0007578799,0.816267,0.0001391688,0.00008080522,0.0007013703,0.006403449,0.004509015,0.01716347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03419076,"threshold_uncertainty_score":0.06798345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006252946784543094,"score_gpt":0.2098688978834802,"score_spread":0.2036159510989371,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}