{"id":"W2594548486","doi":"10.23919/acc.2017.7963402","title":"Clustering in discrete path planning for approximating minimum length paths","year":2017,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Travelling salesman problem; Mathematical optimization; Reduction (mathematics); Computation; Motion planning; Graph; Metric (unit); Path (computing); Computer science; Mathematics; Time complexity; Algorithm; Robot; Artificial intelligence; Combinatorics","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.0007932597,0.0001800929,0.0002558144,0.00009625692,0.000461436,0.0005748807,0.001517202,0.00007411386,0.000001281518],"category_scores_gemma":[0.0004001762,0.0001615791,0.00006025322,0.00006434191,0.00003664226,0.000835543,0.000603809,0.0001571108,0.000008552339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000421438,"about_ca_system_score_gemma":0.00004117285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005810347,"about_ca_topic_score_gemma":0.000002967742,"domain_scores_codex":[0.9983838,0.00003272362,0.0003586892,0.0004989131,0.0002079953,0.0005179467],"domain_scores_gemma":[0.9984575,0.0002064534,0.0002521346,0.0009619473,0.00003275672,0.00008920889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001174323,0.0004021073,0.1862356,0.00105518,0.0001725084,0.001238532,0.04508189,0.1553373,0.005556673,0.03720448,0.004088978,0.5635093],"study_design_scores_gemma":[0.0005886459,0.00005886239,0.009948115,0.0001980474,0.00000229552,0.00001413501,0.0001567841,0.9877183,0.000187428,0.0007742191,0.000114013,0.0002391559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01196354,0.00003014863,0.9814585,0.0004445861,0.0005264734,0.0003078681,0.000002861503,0.0001707221,0.00509528],"genre_scores_gemma":[0.3660495,7.206864e-7,0.6334283,0.00006888199,0.00008155443,0.00004499266,0.000002068974,0.00001220605,0.0003118132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.832381,"threshold_uncertainty_score":0.6589006,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04723947475807791,"score_gpt":0.3176213537430856,"score_spread":0.2703818789850078,"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."}}