{"id":"W1972741546","doi":"10.1115/1.1846053","title":"A Linear Programming Solution for Exact Collision Detection","year":2005,"lang":"en","type":"article","venue":"Journal of Computing and Information Science in Engineering","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Collision detection; Collision; Computer science; Robustness (evolution); Linear programming; Inter frame; Algorithm; Regular polygon; Mathematical optimization; Frame (networking); Mathematics; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.002239695,0.00006471326,0.00010584,0.0006453056,0.0001265201,0.0002163434,0.0002740645,0.00002947469,6.326812e-8],"category_scores_gemma":[0.0004604387,0.00005892244,0.00002555138,0.0007067152,0.00002210377,0.006254624,0.00005529503,0.0001334766,7.300415e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001198055,"about_ca_system_score_gemma":0.0000758593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001833101,"about_ca_topic_score_gemma":9.64535e-8,"domain_scores_codex":[0.9989632,0.000007226333,0.0004553582,0.00006956649,0.0003052744,0.0001993909],"domain_scores_gemma":[0.999245,0.000103206,0.0002652414,0.00007231989,0.0002471298,0.00006702598],"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.00000201878,0.000005072462,0.00005850215,0.00001401933,8.135958e-7,2.878849e-7,0.001213265,0.6838868,0.000787224,0.0001336675,0.000002682296,0.3138957],"study_design_scores_gemma":[0.0002772995,0.00009502497,0.002638512,0.0001095501,0.000001137676,0.0001113927,0.0000405187,0.9932171,0.002172218,0.000006875438,0.001264756,0.00006560727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1413447,0.00001998517,0.8579756,0.0001376265,0.0004032824,0.00007503295,9.320532e-8,0.0000295414,0.00001418191],"genre_scores_gemma":[0.5648758,0.000003505521,0.4350367,0.00001652196,0.00006538119,5.562068e-7,8.152723e-8,0.000001064199,3.790916e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4235311,"threshold_uncertainty_score":0.4534451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.011119744377998,"score_gpt":0.2619502733762366,"score_spread":0.2508305289982386,"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."}}