{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009910956,0.001061465,0.0009489544,0.001328202,0.0007434665,0.0008746927,0.001571861,0.0009791217,0.003283404],"category_scores_gemma":[0.005785387,0.0006952606,0.0007508143,0.001792336,0.0009499703,0.001446448,0.001013276,0.001584696,0.0006374776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002426864,"about_ca_system_score_gemma":0.001470732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01062,"about_ca_topic_score_gemma":0.008738178,"domain_scores_codex":[0.9992725,0.0002460099,0.000027573,0.0001940922,0.0002031211,0.00005670673],"domain_scores_gemma":[0.9984244,0.001022328,0.0001390768,0.000156098,0.0001896359,0.00006845682],"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.00003963281,0.00001924472,0.0002171774,0.00008153852,0.0000153748,0.00002143761,0.00004433075,0.9596261,0.0008204058,0.01727096,0.0007435327,0.02110033],"study_design_scores_gemma":[0.00000720179,0.00001857842,0.00005628525,0.000008005894,0.000003727811,0.00001304891,0.00001577055,0.9835674,0.0005109584,0.01483857,0.0009551237,0.00000530645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01213312,0.0002566889,0.9848856,0.0001534867,0.00002272565,0.00007192477,0.00008156877,0.00036186,0.002033],"genre_scores_gemma":[0.2608597,0.0004052829,0.7353229,0.00008145469,0.00002821936,0.0002702265,0.0004078009,0.0002132387,0.002411239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01062,"threshold_uncertainty_score":0.02111638,"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."}}