{"id":"W2892094733","doi":"10.1109/icra.2018.8463199","title":"On Bisection Continuous Collision Checking Method: Spherical Joints and Minimum Distance to Obstacles","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Motion planning; Collision detection; Revolute joint; Collision; Computer science; Path (computing); Robot; Bisection method; Sampling (signal processing); Motion (physics); Collision avoidance; Trajectory; Algorithm; Computer vision; Artificial intelligence","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.001215324,0.0008914108,0.0009407552,0.001748391,0.0006114685,0.0009375897,0.002139197,0.0009326347,0.001536408],"category_scores_gemma":[0.005853359,0.0005134272,0.0005996476,0.001744758,0.001057933,0.001591305,0.001489948,0.001292289,0.0003692146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000667946,"about_ca_system_score_gemma":0.001366567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004740131,"about_ca_topic_score_gemma":0.002111106,"domain_scores_codex":[0.9985781,0.0003523096,0.00006581115,0.0003030953,0.000610208,0.00009054049],"domain_scores_gemma":[0.9967277,0.00175294,0.0003406268,0.0003808709,0.0006712417,0.0001266188],"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.0006713546,0.0001267097,0.002913737,0.0004084962,0.00010269,0.0003185218,0.0004684922,0.5139393,0.02010924,0.03688081,0.002659199,0.4214014],"study_design_scores_gemma":[0.00002273902,0.00006716924,0.0002433754,0.00001569803,0.00001139524,0.00009946918,0.00001988171,0.9890364,0.004389711,0.004721698,0.001350461,0.00002206282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004363928,0.0001490055,0.9948176,0.0000249196,0.00001466195,0.00002192434,0.00001480027,0.0003168039,0.0002763221],"genre_scores_gemma":[0.2710872,0.0002999059,0.7271989,0.00007821953,0.00003980842,0.0001474546,0.0001174831,0.0001739671,0.0008570375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004740131,"threshold_uncertainty_score":0.009425044,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03160700400843427,"score_gpt":0.3124612559127749,"score_spread":0.2808542519043407,"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."}}