{"id":"W2953216510","doi":"10.48550/arxiv.1702.08410","title":"Clustering in Discrete Path Planning for Approximating Minimum Length Paths","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Travelling salesman problem; Mathematical optimization; Reduction (mathematics); Mathematics; Computation; Graph; Metric (unit); Constant (computer programming); Time complexity; Path (computing); Computer science; Algorithm; Combinatorics; Statistics","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.001085367,0.001145341,0.001008685,0.001396361,0.0007838293,0.0009875365,0.001678396,0.001108149,0.003635446],"category_scores_gemma":[0.006567509,0.0007237784,0.0007876934,0.002050616,0.001036589,0.001594456,0.001161003,0.001786544,0.0007112456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002490743,"about_ca_system_score_gemma":0.00145795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009432831,"about_ca_topic_score_gemma":0.008135641,"domain_scores_codex":[0.9991704,0.0002893987,0.00003138714,0.0002267276,0.0002173669,0.00006467618],"domain_scores_gemma":[0.9982186,0.001162976,0.0001500826,0.0001779819,0.0002111931,0.00007915452],"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.00005141824,0.00002484983,0.0002938589,0.00009770588,0.00002095085,0.00002723078,0.00005980717,0.9484704,0.0008431912,0.02350775,0.001108103,0.02549467],"study_design_scores_gemma":[0.000008196938,0.00001908068,0.00006142243,0.000009103797,0.00000450702,0.00001527556,0.00001840939,0.9766145,0.0004858712,0.0216772,0.001080722,0.000005687809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01369383,0.0003207483,0.9827744,0.0002034378,0.00002881838,0.00007783197,0.0001013321,0.0003784149,0.002421097],"genre_scores_gemma":[0.2731892,0.0004622634,0.7223325,0.0001045748,0.00004023645,0.0002830217,0.0004840623,0.0002449419,0.00285907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009432831,"threshold_uncertainty_score":0.01875585,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1129322569622119,"score_gpt":0.2366889479462754,"score_spread":0.1237566909840635,"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."}}