{"id":"W1516838788","doi":"10.1007/978-3-642-10684-2_72","title":"A Markov Model for Multiagent Patrolling in Continuous Time","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Patrolling; Computer science; Asynchronous communication; Multi-agent system; Markov chain; Artificial intelligence; Markov decision process; Distributed computing; Markov process; Machine learning; Computer network; Mathematics","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.00124302,0.0004265612,0.0005564381,0.0009051024,0.000165146,0.000494252,0.002382235,0.0002814858,0.00001475092],"category_scores_gemma":[0.0001020167,0.000403898,0.0001462667,0.0004152677,0.0002128945,0.0004781053,0.0005603106,0.0005638539,0.00002418255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002746109,"about_ca_system_score_gemma":0.000515069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000824734,"about_ca_topic_score_gemma":0.00004484425,"domain_scores_codex":[0.996538,0.00003324548,0.000590305,0.001350686,0.0007136057,0.0007741352],"domain_scores_gemma":[0.9981218,0.0003606738,0.0002087266,0.0008669745,0.0002677014,0.0001741189],"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.000006652062,0.00002557768,0.000004659124,0.00001329804,0.000002523762,0.00001574904,0.0004574268,0.5578098,0.00004059427,0.001721213,0.00001906845,0.4398835],"study_design_scores_gemma":[0.0005838983,0.0001333975,0.00000770509,0.0002143312,0.000002520547,0.000008848671,4.89494e-8,0.9419571,0.00007193031,0.05622305,0.0003720332,0.0004251217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001246375,0.0001951314,0.9957147,0.0009917092,0.0003088711,0.00103622,0.000007280214,0.0001281474,0.001605507],"genre_scores_gemma":[0.01197179,0.00005191248,0.9835032,0.001990044,0.000135705,0.00002877461,0.00001014737,0.00003037721,0.002278064],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4394583,"threshold_uncertainty_score":0.9998413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0205201065021685,"score_gpt":0.2563511251970211,"score_spread":0.2358310186948526,"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."}}