{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001366626,0.0009237472,0.0005384024,0.0004874174,0.0004164748,0.0007086735,0.001179156,0.0007259526,0.01008615],"category_scores_gemma":[0.0007658679,0.0005665338,0.0004709784,0.001410003,0.0004017722,0.001457203,0.001256285,0.001373459,0.003508806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005239352,"about_ca_system_score_gemma":0.0008391468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001966001,"about_ca_topic_score_gemma":0.003306384,"domain_scores_codex":[0.9998129,0.00001803732,0.00001029108,0.00005915565,0.00007382019,0.0000259204],"domain_scores_gemma":[0.9997919,0.00007246228,0.00002731032,0.00004728242,0.00004273559,0.00001830157],"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.0001421878,0.00005395073,0.0002683386,0.000653817,0.00003456553,0.0002441448,0.0001996302,0.4025095,0.01781724,0.1163942,0.02608357,0.4355988],"study_design_scores_gemma":[0.00005385471,0.0001752236,0.0007256026,0.0001938286,0.00003385391,0.0005247959,0.0001877403,0.690105,0.01532331,0.1542795,0.1383439,0.00005343642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01901301,0.001238558,0.9317943,0.0002578713,0.000187509,0.00007226082,0.0008172449,0.001421436,0.04519787],"genre_scores_gemma":[0.1665002,0.003793962,0.7265984,0.0001116935,0.00006435075,0.0002362063,0.003961445,0.0009187796,0.09781496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01008615,"threshold_uncertainty_score":0.03374153,"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."}}