{"id":"W1537414353","doi":"10.1007/978-3-642-04128-0_23","title":"Optimality and Competitiveness of Exploring Polygons by Mobile Robots","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"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); Computer science; Robot; Trajectory; Boundary (topology); Metric (unit); Point (geometry); Square (algebra); Convex polygon; Point in polygon; Motion planning; Computer vision; Artificial intelligence; Regular polygon; Mathematics; Computer graphics (images); 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007023765,0.0003321046,0.0004753827,0.000444176,0.0001691372,0.0002755474,0.001620743,0.0001537195,0.00002560108],"category_scores_gemma":[0.00003458499,0.0003178169,0.00006808599,0.0004418434,0.0006767518,0.0007310034,0.0008789226,0.0004398567,0.000004141911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000973348,"about_ca_system_score_gemma":0.0002459193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002415593,"about_ca_topic_score_gemma":0.00001060438,"domain_scores_codex":[0.9973765,0.00004712614,0.0004312358,0.001016895,0.0006841656,0.0004440937],"domain_scores_gemma":[0.9983171,0.0002933611,0.0002062463,0.0007667764,0.0002358799,0.0001806767],"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.000004920947,0.00005730319,0.0001362949,0.00005959348,0.000008734604,0.0000201929,0.0007717269,0.2043031,0.0003083623,0.0185111,0.000006421746,0.7758123],"study_design_scores_gemma":[0.0006504444,0.0006936609,0.0006643701,0.0008847538,0.000009292326,0.00006324678,9.320592e-7,0.951264,0.007947455,0.03445644,0.00225647,0.001108935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002048004,0.0006577736,0.9960271,0.0003461206,0.0003150797,0.0003572981,0.000009878504,0.00008206518,0.001999919],"genre_scores_gemma":[0.1442689,0.0008226497,0.8532495,0.0008210047,0.0001446738,0.00004933109,0.0000126381,0.00003669229,0.0005945635],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7747033,"threshold_uncertainty_score":0.9999274,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03201215920856491,"score_gpt":0.2640694325269873,"score_spread":0.2320572733184224,"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."}}