{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001694166,0.0008551173,0.002505892,0.001524149,0.001294959,0.003564651,0.001837321,0.001933365,0.007170592],"category_scores_gemma":[0.01356604,0.000868505,0.001369539,0.001865106,0.003431983,0.003601913,0.002627467,0.00171161,0.0006105569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001444381,"about_ca_system_score_gemma":0.001626303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005262135,"about_ca_topic_score_gemma":0.004626542,"domain_scores_codex":[0.9986039,0.0005096594,0.00006025301,0.0002163981,0.0002701171,0.0003397589],"domain_scores_gemma":[0.9912556,0.006370353,0.0007130066,0.0004308606,0.0004100103,0.0008200374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001647371,0.0002457825,0.008892687,0.0003572546,0.0001137459,0.0003201381,0.0006232712,0.537872,0.00502136,0.4017516,0.005250765,0.03790394],"study_design_scores_gemma":[0.0002038267,0.0003182142,0.003857065,0.00005531053,0.00007120534,0.0002300645,0.0004526738,0.5919722,0.002590138,0.397096,0.003115172,0.00003801912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7789997,0.001419608,0.1714725,0.001700754,0.0001006717,0.0001190898,0.000585934,0.000250555,0.04535124],"genre_scores_gemma":[0.9503621,0.0005534561,0.04274348,0.00009158396,0.00009606836,0.0001158104,0.000451106,0.0002416893,0.005344614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007170592,"threshold_uncertainty_score":0.02398801,"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."}}