{"id":"W2891930168","doi":"10.1007/978-3-030-04651-4_2","title":"Rectilinear Shortest Paths Among Transient Obstacles","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Dijkstra's algorithm; Computer science; Obstacle; Point (geometry); Transient (computer programming); Bounded function; Point location; Algorithm; Shortest path problem; Robot; Interval (graph theory); Subdivision; Wavefront; Path (computing); Mathematics; Combinatorics; Artificial intelligence; Graph; Geometry; Theoretical computer science; Mathematical analysis; Physics; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001281972,0.000786389,0.0007448835,0.00092553,0.0003675659,0.0007273921,0.004801255,0.0005089176,0.0000448324],"category_scores_gemma":[0.0001710705,0.0007259396,0.0002026876,0.0008643314,0.001555481,0.0007597993,0.001036654,0.001131291,0.0001573967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003639486,"about_ca_system_score_gemma":0.0006430229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003928762,"about_ca_topic_score_gemma":0.00005350478,"domain_scores_codex":[0.9941216,0.00005976273,0.0007644221,0.002425695,0.001542323,0.001086273],"domain_scores_gemma":[0.9960794,0.0005912703,0.0003429065,0.002241759,0.0003911754,0.0003534444],"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.00000922223,0.0000974869,0.0005574616,0.00005739742,0.00004089412,0.0009321847,0.005845658,0.08601086,0.0001709753,0.00194371,0.0003179231,0.9040162],"study_design_scores_gemma":[0.000263714,0.0003806337,0.001485563,0.0007502742,0.00001541043,0.0001582262,4.350902e-7,0.9660143,0.00103237,0.02700613,0.001763041,0.001129944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004598209,0.0003558549,0.9902536,0.0002910537,0.004153745,0.0004724453,0.00000952618,0.0004225076,0.003581484],"genre_scores_gemma":[0.04373411,0.00003915889,0.9532118,0.0008637669,0.001233136,0.00001474878,0.00001017953,0.00007771821,0.000815355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9028863,"threshold_uncertainty_score":0.9995192,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0209407707531145,"score_gpt":0.2455602660863866,"score_spread":0.2246194953332721,"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."}}