{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001245004,0.00151404,0.00121392,0.0008994387,0.0006374695,0.001675022,0.001252265,0.001882817,0.01012501],"category_scores_gemma":[0.004942573,0.0008994782,0.001104599,0.00112669,0.000773957,0.00115881,0.001655273,0.002848601,0.002708799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008146247,"about_ca_system_score_gemma":0.002144599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004150114,"about_ca_topic_score_gemma":0.002854358,"domain_scores_codex":[0.9991207,0.0002425698,0.00004046011,0.0002020655,0.0002983335,0.000095833],"domain_scores_gemma":[0.9986275,0.0009736326,0.00007546723,0.00004273568,0.0002438153,0.00003678892],"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.00005604604,0.0001052366,0.0001864232,0.0003227024,0.00003224644,0.0001224981,0.0001195152,0.8001702,0.001321693,0.06997062,0.006263886,0.1213288],"study_design_scores_gemma":[0.00001188991,0.0000251596,0.00002082139,0.0000158954,0.000004730271,0.00002699947,0.0000171886,0.9824892,0.0002756407,0.01459013,0.002515728,0.000006630324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005865335,0.00007382016,0.9967991,0.00009418297,0.00003160823,0.00002667828,0.00002432054,0.00009746761,0.00226615],"genre_scores_gemma":[0.0681994,0.0004150729,0.9197032,0.0001847586,0.0001207498,0.0005917017,0.0001945732,0.0002325037,0.010358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01012501,"threshold_uncertainty_score":0.03387153,"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."}}