{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004320728,0.0001178232,0.0001910911,0.0002791613,0.0001687695,0.0002268212,0.003323717,0.00004859812,0.00001163285],"category_scores_gemma":[0.0004810576,0.00007109725,0.00007538258,0.0002621922,0.0003437358,0.0003031528,0.0002924378,0.0005432904,0.000009998062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001043706,"about_ca_system_score_gemma":0.0004371572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001611603,"about_ca_topic_score_gemma":5.479635e-7,"domain_scores_codex":[0.9972879,0.0001996927,0.0003935344,0.0001942921,0.001541822,0.0003827697],"domain_scores_gemma":[0.9961303,0.0009409898,0.0003135694,0.0002983107,0.00219485,0.0001219941],"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.001367832,0.0006829883,0.04047302,0.00004140087,0.00120349,0.003742157,0.01224356,0.7811383,0.0009776205,0.1233886,0.01616855,0.01857244],"study_design_scores_gemma":[0.004931234,0.004511648,0.02949622,0.000873327,0.00002810284,0.00764396,0.002218018,0.9128012,0.002761351,0.03201491,0.001939208,0.0007807828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006139626,0.0001179651,0.9889289,0.002881418,0.0006554312,0.0001689154,0.000005789417,0.0000198427,0.00108214],"genre_scores_gemma":[0.4720201,0.00001089981,0.5275713,0.00007937354,0.000195828,0.000004067541,0.000001347375,0.000009293632,0.0001078795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4658805,"threshold_uncertainty_score":0.6176348,"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."}}