{"id":"W4206404584","doi":"10.1109/smc52423.2021.9659071","title":"RRT-Rope: A deterministic shortening approach for fast near-optimal path planning in large-scale uncluttered 3D environments","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Random tree; Path (computing); Computation; Computer science; Rope; Motion planning; Probabilistic logic; Mathematical optimization; Scale (ratio); Tree (set theory); Distributed computing; Algorithm; Artificial intelligence; Mathematics; Computer network; Robot","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.0005057098,0.0009687089,0.0007841857,0.0008592869,0.0005710577,0.0005678093,0.00154449,0.0008679413,0.003075186],"category_scores_gemma":[0.001816357,0.0005129231,0.0009402542,0.0008049288,0.0005147235,0.0009474263,0.001413129,0.001107027,0.0006483714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000499898,"about_ca_system_score_gemma":0.001401319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006186214,"about_ca_topic_score_gemma":0.01019959,"domain_scores_codex":[0.999626,0.00007129819,0.00001634199,0.00007865617,0.0001675068,0.00004009942],"domain_scores_gemma":[0.9994071,0.0002773079,0.0000747352,0.0001102082,0.00009013841,0.00004049113],"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.0001134649,0.00005817237,0.0006313242,0.0001767176,0.00006618602,0.000105584,0.0001242327,0.8094193,0.006282371,0.01026947,0.0041622,0.1685909],"study_design_scores_gemma":[0.00001854162,0.00005929461,0.0001105746,0.000009138545,0.000009350354,0.00005671101,0.00001757799,0.9922568,0.001471143,0.002547237,0.003431637,0.00001204051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007792953,0.0002299356,0.9884197,0.00007202174,0.00003573549,0.00007089142,0.00009299574,0.001780476,0.001505355],"genre_scores_gemma":[0.1314129,0.0002763483,0.8653358,0.00006769838,0.00002411642,0.0002381854,0.0003992685,0.0003770979,0.001868434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006186214,"threshold_uncertainty_score":0.01230043,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05086619524788937,"score_gpt":0.2878771164581375,"score_spread":0.2370109212102481,"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."}}