{"id":"W1606450834","doi":"10.5555/1838206.1838451","title":"Multi-robot area coverage with limited visibility","year":2010,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Delaunay triangulation; Robot; Visibility; Computer science; Constrained Delaunay triangulation; Graph; Cover (algebra); Set cover problem; Set (abstract data type); Spanning tree; Artificial intelligence; Euclidean minimum spanning tree; Theoretical computer science; Algorithm; Mathematics; Engineering; Geography; Connected dominating set; Combinatorics","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.0003119212,0.0001638782,0.0001649407,0.00006883496,0.0001030946,0.0001688634,0.0008425094,0.00008270479,0.00006413218],"category_scores_gemma":[0.0001083407,0.0001165771,0.00003641776,0.0003510735,0.00006605281,0.0004056578,0.0001801114,0.0003396774,0.0001294297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001750603,"about_ca_system_score_gemma":0.00007930486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007949141,"about_ca_topic_score_gemma":0.00003093362,"domain_scores_codex":[0.9986528,0.00003623636,0.0001736475,0.0005282399,0.0002845526,0.0003245063],"domain_scores_gemma":[0.998402,0.0001388342,0.00006466808,0.001121028,0.0001084752,0.0001649809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001400428,0.00407881,0.5095538,0.0001184088,0.0003320863,0.001721371,0.006350791,0.05914425,0.168749,0.03543964,0.007388338,0.2069834],"study_design_scores_gemma":[0.000704222,0.0001146528,0.1831379,0.00001048456,0.000004098586,0.00006132555,0.000007076328,0.8128212,0.002402776,0.0002355858,0.0002308353,0.0002698239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06497904,0.000003481603,0.9305628,0.0003921974,0.0004135607,0.0001556083,0.000001669918,0.0004973519,0.002994268],"genre_scores_gemma":[0.4455137,3.478315e-7,0.553754,0.0002515535,0.00002143336,0.000005191042,0.000001860036,0.000005772225,0.0004461477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.753677,"threshold_uncertainty_score":0.4753876,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02440351808762073,"score_gpt":0.2527861148472048,"score_spread":0.2283825967595841,"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."}}