{"id":"W2117927826","doi":"10.1177/0278364911417911","title":"Optimal path planning for surveillance with temporal-logic constraints","year":2011,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Linear temporal logic; Automaton; Computer science; Robot; Motion planning; Path (computing); Temporal logic; Graph; Function (biology); Upload; Finite-state machine; Mathematical optimization; Real-time computing; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Programming language","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.0008021138,0.0007820048,0.0005137295,0.0006017063,0.0005771071,0.0007248047,0.0009614162,0.0006226903,0.004591838],"category_scores_gemma":[0.003160236,0.000537249,0.0009739427,0.0005809363,0.001106645,0.001299885,0.0008584526,0.001040925,0.0003775042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315082,"about_ca_system_score_gemma":0.001930846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00667076,"about_ca_topic_score_gemma":0.01171731,"domain_scores_codex":[0.9993356,0.0001843499,0.00003899048,0.0001849286,0.000185861,0.00007025257],"domain_scores_gemma":[0.9983274,0.001305601,0.0001189518,0.00008234083,0.0001321033,0.00003347014],"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.0001567525,0.00006198839,0.000614783,0.0002864912,0.00004548327,0.000176683,0.0002058042,0.8593838,0.005090354,0.05939827,0.001735694,0.07284407],"study_design_scores_gemma":[0.0000301035,0.00003270719,0.00007394166,0.00001627494,0.00001349399,0.00003713906,0.00003466874,0.9451054,0.002870519,0.05014404,0.001631166,0.00001050809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01234103,0.00008333012,0.9848598,0.0001082579,0.00001178173,0.00007142458,0.0001832713,0.0008758833,0.001465182],"genre_scores_gemma":[0.2494761,0.0001577947,0.7472664,0.00008579665,0.0000135647,0.0002657895,0.0006475842,0.0003208261,0.001766117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00667076,"threshold_uncertainty_score":0.01536125,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1889076740863805,"score_gpt":0.390127368633142,"score_spread":0.2012196945467614,"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."}}