{"id":"W2952787620","doi":"10.48550/arxiv.1809.08898","title":"Rectilinear Shortest Paths Among Transient Obstacles","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Obstacle; Dijkstra's algorithm; Point (geometry); Transient (computer programming); Bounded function; Point location; Algorithm; Interval (graph theory); Shortest path problem; Computer science; Subdivision; Path (computing); Robot; Wavefront; Mathematics; Combinatorics; Geometry; Graph; Mathematical analysis; Artificial intelligence; Physics; Geography; Optics","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.000317928,0.0006794779,0.0006396381,0.0006638239,0.0007127037,0.0007896139,0.001373954,0.000605241,0.003220244],"category_scores_gemma":[0.002117194,0.00055952,0.0006056917,0.001041862,0.0006011798,0.001601803,0.001607075,0.000803317,0.0008467412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009943021,"about_ca_system_score_gemma":0.001563782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008256963,"about_ca_topic_score_gemma":0.01313219,"domain_scores_codex":[0.999445,0.00006976943,0.00003239645,0.0002328735,0.0001386154,0.00008131847],"domain_scores_gemma":[0.9992796,0.0002890866,0.0001351774,0.000142755,0.00009041125,0.00006301198],"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.0004541774,0.0001082924,0.001855923,0.0002780687,0.00005787874,0.0002791568,0.0004842422,0.7090675,0.01778939,0.0526474,0.008279962,0.2086979],"study_design_scores_gemma":[0.00006013894,0.0001160117,0.0005946446,0.00002335682,0.00001531497,0.00012575,0.0001741745,0.947903,0.006352053,0.0353792,0.009230379,0.00002587846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06926034,0.0003537862,0.9221272,0.0002281085,0.00003403268,0.0001529015,0.0007586317,0.001493191,0.005591864],"genre_scores_gemma":[0.326759,0.0002884852,0.6640137,0.0000556244,0.00001269879,0.0001784897,0.002130694,0.0002150825,0.006346273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008256963,"threshold_uncertainty_score":0.0164178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07599325619963257,"score_gpt":0.1918592953523858,"score_spread":0.1158660391527532,"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."}}