{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004089183,0.0004723003,0.0004691332,0.0003148216,0.0002273808,0.0001980719,0.002765464,0.0004501991,0.00002632525],"category_scores_gemma":[0.00006944913,0.0005446896,0.0002794874,0.0006963001,0.0002917644,0.0004195374,0.001425323,0.0008110079,0.0002008035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002427955,"about_ca_system_score_gemma":0.0002636365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002346636,"about_ca_topic_score_gemma":0.00002704261,"domain_scores_codex":[0.996954,0.0002035215,0.0003076584,0.001741657,0.0001924552,0.0006006628],"domain_scores_gemma":[0.9970011,0.000157347,0.0002743036,0.001993426,0.0002549794,0.0003188359],"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.00004883079,0.0005102876,0.04351851,0.0001732752,0.0004180587,0.005023409,0.00328897,0.9243172,0.0000790868,0.01303403,0.004631851,0.004956488],"study_design_scores_gemma":[0.0003194817,0.000108525,0.02112774,0.0002122927,0.00007457579,0.00001318915,0.00006508341,0.9719521,0.000173485,0.004721614,0.0005321323,0.0006997859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2927299,0.0000548481,0.7017612,0.00004835446,0.001696347,0.0002997329,0.00002106602,0.0005820638,0.00280641],"genre_scores_gemma":[0.9707013,0.00007069006,0.02759499,0.00006275871,0.0002263397,0.000001533135,0.00002312438,0.00003349541,0.001285792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6779714,"threshold_uncertainty_score":0.9997005,"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."}}