{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008391912,0.0004700207,0.0006229267,0.0003651628,0.0003846533,0.0003769963,0.003212621,0.0003795365,0.000001279676],"category_scores_gemma":[0.0002491072,0.0005560974,0.0002256519,0.0002150787,0.00009040659,0.0006198476,0.003174951,0.0008006001,0.00001153268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002674213,"about_ca_system_score_gemma":0.000217916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000121088,"about_ca_topic_score_gemma":0.000006397555,"domain_scores_codex":[0.997013,0.0001319619,0.0004104131,0.0015681,0.0001370115,0.0007394523],"domain_scores_gemma":[0.9968824,0.0003125925,0.0007165683,0.001815838,0.0000955222,0.0001771152],"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.00003086609,0.00005008453,0.005731543,0.0003433237,0.00006138442,0.0009566722,0.001986294,0.983759,0.0000273684,0.004728597,0.0001086139,0.002216201],"study_design_scores_gemma":[0.0007787658,0.00005738553,0.001435958,0.0009770158,0.00002899811,0.00000920522,0.0001832071,0.9871976,0.00002113411,0.00861905,0.00007138441,0.0006202564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04913838,0.00007476261,0.9473179,0.00007148165,0.001075393,0.0006353571,0.00002972531,0.0002645283,0.001392486],"genre_scores_gemma":[0.8277619,0.00001678232,0.1713783,0.00003145161,0.0001387154,0.000008090118,0.00002875801,0.00003553423,0.0006004577],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7786235,"threshold_uncertainty_score":0.999689,"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."}}