{"id":"W2108990830","doi":"10.1016/j.ic.2010.09.005","title":"Optimality and competitiveness of exploring polygons by mobile robots","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Polygon (computer graphics); Simple polygon; Mobile robot; Focus (optics); Robot; Trajectory; Computer science; Boundary (topology); Metric (unit); Square (algebra); Point (geometry); Convex polygon; Computer vision; Artificial intelligence; Algorithm; Mathematics; Regular polygon; Geometry; Engineering","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.0001938507,0.00005498943,0.00007411581,0.00008222977,0.00008575377,0.0001360662,0.00008496087,0.00002786714,0.000009514292],"category_scores_gemma":[0.00001445937,0.00005429273,0.00001044234,0.0001367924,0.00004672993,0.002050376,0.00007058947,0.00007403917,0.000003647582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004243389,"about_ca_system_score_gemma":0.00002088583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002400656,"about_ca_topic_score_gemma":0.000002136951,"domain_scores_codex":[0.9994969,0.00002315059,0.0002038572,0.00007375902,0.0001257219,0.00007655099],"domain_scores_gemma":[0.9995978,0.00004833888,0.00009288069,0.00007424632,0.000128778,0.00005794855],"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.00001578651,0.00008867019,0.005527451,0.000169039,0.00001770053,4.023715e-7,0.008776342,0.06392559,0.002268106,0.1273828,0.0001425599,0.7916856],"study_design_scores_gemma":[0.0004871116,0.00007413991,0.01511791,0.00001426249,0.00000182184,0.000009573546,0.0002416765,0.9793395,0.001955971,0.0005413324,0.002101244,0.0001154176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2380356,0.00001463059,0.7608501,0.0001579902,0.00008917443,0.0001245813,0.000004515401,0.00004770486,0.0006757469],"genre_scores_gemma":[0.9599159,0.00004275713,0.0398753,0.00009446473,0.000005386328,0.00003113635,0.00002498324,0.000001620664,0.000008459363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.915414,"threshold_uncertainty_score":0.2213994,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01863673248393834,"score_gpt":0.2608629734210505,"score_spread":0.2422262409371122,"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."}}