{"id":"W2081264158","doi":"10.2316/journal.206.2010.4.206-3325","title":"REACHABLE GRASPS ON A POLYGON OF A ROBOT ARM: FINDING CONVEX ROPES WITHOUT TRIANGULATION","year":2010,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Regular polygon; Simple polygon; Vertex (graph theory); Polygon (computer graphics); Convex hull; Convex polygon; Polygon covering; Combinatorics; Mathematics; Robot; Minimum-weight triangulation; Computer science; Artificial intelligence; Delaunay triangulation; Geometry; Constrained Delaunay triangulation","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000544747,0.00007777922,0.0001470943,0.0003440016,0.00004870754,0.0001600718,0.0003354493,0.00005320402,0.00001890783],"category_scores_gemma":[0.0002223367,0.00006538662,0.00005269594,0.0001269069,0.00003388627,0.0005684965,0.00005069902,0.0001794727,0.000002708735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002461487,"about_ca_system_score_gemma":0.00006976473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009155118,"about_ca_topic_score_gemma":0.000004369291,"domain_scores_codex":[0.9988412,0.00004578142,0.0004270292,0.0001024307,0.0004955395,0.00008802796],"domain_scores_gemma":[0.9986607,0.0001066932,0.0005303363,0.0001022197,0.0005372484,0.00006277444],"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.0001460006,0.0005601953,0.006211169,0.00003526152,0.0002155683,0.00002287728,0.002243523,0.4496816,0.07801957,0.3539675,0.0003640772,0.1085327],"study_design_scores_gemma":[0.00117078,0.0002789714,0.009750361,0.0001557442,0.00001027339,0.00009372145,0.0000273256,0.973694,0.008288609,0.006225774,0.000200765,0.0001036245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1181542,0.00002174246,0.8763492,0.003763868,0.001041298,0.0001057161,0.000001987636,0.00002569186,0.0005362671],"genre_scores_gemma":[0.8985166,0.00003352696,0.1011695,0.00008320508,0.0001027152,7.968832e-7,0.000004076698,0.000005157525,0.00008443256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7803624,"threshold_uncertainty_score":0.2666389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02089287661940424,"score_gpt":0.2969573623987184,"score_spread":0.2760644857793141,"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."}}