{"id":"W2105687001","doi":"10.1007/978-3-642-13731-0_1","title":"Optimal Exploration of Terrains with Obstacles","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Terrain; Computer science; Point (geometry); Artificial intelligence; Computer vision; Mobile robot; Robot; Convex hull; Trajectory; Regular polygon; Algorithm; Mathematics; Geography; Geometry; Cartography","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.0005363522,0.0003152006,0.000350332,0.0006690718,0.000158759,0.0003221816,0.002066392,0.0002325827,0.00002865836],"category_scores_gemma":[0.00004744363,0.0002520262,0.0000616507,0.0005115804,0.0008885846,0.001310543,0.0005970395,0.0006833309,0.00001222388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007007673,"about_ca_system_score_gemma":0.0005677156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001040326,"about_ca_topic_score_gemma":0.00009347769,"domain_scores_codex":[0.9974043,0.00002403694,0.000388853,0.0008751907,0.0009160934,0.0003915643],"domain_scores_gemma":[0.9980212,0.0001777737,0.0002731613,0.0009977587,0.000395473,0.0001345772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001544902,0.0000712986,0.00004507376,0.00006737627,0.00001645595,0.00004604792,0.004837013,0.5266239,0.001462582,0.06027381,0.00000990364,0.4065311],"study_design_scores_gemma":[0.0004728056,0.0005731914,0.00005038755,0.0003754156,0.000006068509,0.00004028079,7.08485e-7,0.9320087,0.009324643,0.05473845,0.001725779,0.0006835468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008535238,0.00005363039,0.9954655,0.0008149571,0.0004498287,0.0003420238,0.000003309729,0.00009494692,0.002690481],"genre_scores_gemma":[0.05604016,0.00003307024,0.9431131,0.0003393538,0.0001208335,0.000008391478,0.000006457359,0.00002329865,0.0003152933],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4058475,"threshold_uncertainty_score":0.9999932,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02995620708004124,"score_gpt":0.2577156093518895,"score_spread":0.2277594022718482,"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."}}