{"id":"W2967250176","doi":"10.1613/jair.1.11635","title":"Autonomous Target Search with Multiple Coordinated UAVs","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Holloway, University of London; Engineering and Physical Sciences Research Council; Massachusetts Institute of Technology","keywords":"Submodular set function; Computer science; Greedy algorithm; Exploit; Scalability; Mathematical optimization; Constraint (computer-aided design); Heuristic; Limit (mathematics); Greedy randomized adaptive search procedure; Property (philosophy); Artificial intelligence; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.002753524,0.0001098946,0.0002161561,0.0006690923,0.0001801228,0.0003589926,0.000834075,0.00007615716,0.0005217493],"category_scores_gemma":[0.00026288,0.00008522745,0.00007486944,0.001340373,0.000169016,0.0007856794,0.0001437471,0.0007797609,0.0004091375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001676789,"about_ca_system_score_gemma":0.0007050504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005541185,"about_ca_topic_score_gemma":0.00002679294,"domain_scores_codex":[0.9974034,0.0003074999,0.0005214972,0.0002519199,0.001059183,0.0004564479],"domain_scores_gemma":[0.9969968,0.0005175643,0.0001538703,0.0003379511,0.001778834,0.0002150116],"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.0006385602,0.0005488784,0.0216779,0.00005898705,0.0001310989,0.0003263823,0.003772867,0.178437,0.0226751,0.08387392,0.0006072379,0.687252],"study_design_scores_gemma":[0.0001819902,0.001559273,0.001902835,0.0001044262,0.000003954784,0.0002956347,0.001967546,0.890277,0.09623256,0.005524621,0.001699718,0.0002504796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114991,0.00004916711,0.8843252,0.002064326,0.0003457493,0.0002661953,0.000001230695,0.00003265559,0.001416417],"genre_scores_gemma":[0.9498043,0.00003141215,0.04973138,0.00003171542,0.00008780883,0.000002084409,7.27435e-7,0.00001014538,0.0003004262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8383052,"threshold_uncertainty_score":0.5712789,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07474897448577872,"score_gpt":0.3541518828374389,"score_spread":0.2794029083516602,"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."}}