{"id":"W2993575088","doi":"10.22215/etd/2019-13533","title":"Shortest Paths Among Dynamic Obstacles","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Tangent; Obstacle; Point (geometry); Pathfinding; Path (computing); Line segment; Algorithm; Computer science; Line (geometry); Time complexity; Motion planning; Point location; Computational geometry; Preprocessor; Euclidean shortest path; Start point; Mathematics; K shortest path routing; Combinatorics; Geometry; Robot; Artificial intelligence; Geography; Graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001750879,0.0005863312,0.000408054,0.0007850931,0.0006823419,0.00103405,0.0006578188,0.0005369326,0.003373693],"category_scores_gemma":[0.001380876,0.0003819308,0.0004182627,0.001023722,0.0005400005,0.001000516,0.001313476,0.0007676712,0.0006909753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006667338,"about_ca_system_score_gemma":0.0008415169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002389766,"about_ca_topic_score_gemma":0.001919489,"domain_scores_codex":[0.9996929,0.00004669416,0.00001277283,0.00009104371,0.000112975,0.00004359374],"domain_scores_gemma":[0.9996897,0.0001708768,0.00003194578,0.00002552493,0.0000546104,0.00002736956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007188805,0.00003454527,0.0004980977,0.0003436033,0.00005020386,0.00017872,0.000352144,0.6144645,0.005411089,0.2305354,0.007863528,0.1401963],"study_design_scores_gemma":[0.00003816359,0.00006609722,0.0006353687,0.0000938157,0.00002514672,0.0001776308,0.0002397276,0.6111369,0.003009376,0.3396324,0.04491541,0.00002995529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08051459,0.00386996,0.8821296,0.0006940815,0.0001499956,0.00009806978,0.0008832419,0.0004172569,0.03124318],"genre_scores_gemma":[0.6033077,0.007357067,0.3487234,0.00009380318,0.0001247013,0.0002983451,0.003264284,0.00028769,0.03654309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003373693,"threshold_uncertainty_score":0.01128608,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006687352231645865,"score_gpt":0.2439189887306061,"score_spread":0.2372316364989602,"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."}}