{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005856878,0.0009454276,0.001529414,0.0007102039,0.0006137836,0.0009544998,0.001452918,0.001643171,0.00325764],"category_scores_gemma":[0.003604895,0.001387568,0.001425993,0.000665331,0.001447478,0.002500276,0.00259185,0.001178556,0.0006973802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005792055,"about_ca_system_score_gemma":0.0007204483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003146332,"about_ca_topic_score_gemma":0.002040306,"domain_scores_codex":[0.9995533,0.00009636399,0.00003158685,0.0001410045,0.0001128433,0.00006498846],"domain_scores_gemma":[0.9988482,0.0006520703,0.0001700939,0.000194684,0.00006564589,0.00006943884],"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.0003319991,0.00006951008,0.0005337765,0.0002406514,0.00004967235,0.0005366013,0.000343537,0.9197024,0.007214393,0.01938711,0.001217546,0.05037287],"study_design_scores_gemma":[0.00003911636,0.0001196964,0.0001848419,0.000030925,0.00001511045,0.0001379477,0.0001051079,0.9724161,0.001497455,0.02447573,0.0009535463,0.00002434438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0890577,0.0002031032,0.905346,0.0001273327,0.00001864903,0.0001070022,0.0001586562,0.0005566485,0.004424781],"genre_scores_gemma":[0.5845672,0.0002783959,0.4104846,0.00003591358,0.00001930531,0.000164602,0.0003824228,0.0002341604,0.003833473],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00325764,"threshold_uncertainty_score":0.01089787,"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."}}