{"id":"W2923018352","doi":"10.1109/iros40897.2019.8968150","title":"Computing a Minimal Set of t-Spanning Motion Primitives for Lattice Planners","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Motion planning; Heuristics; Lattice (music); Integer lattice; Configuration space; Mathematics; Computer science; Algorithm; Linear programming; Tree traversal; Discrete mathematics; Theoretical computer science; Combinatorics; Topology (electrical circuits); Mathematical optimization; Robot; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0008796159,0.0007324943,0.001064464,0.001067506,0.0006498679,0.001215657,0.0008934584,0.000913972,0.003882543],"category_scores_gemma":[0.004667539,0.0006113347,0.001046049,0.0009081028,0.001393126,0.002864834,0.00160719,0.001285918,0.0004348039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055801,"about_ca_system_score_gemma":0.001673242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002391353,"about_ca_topic_score_gemma":0.002792124,"domain_scores_codex":[0.9992618,0.0001699242,0.00005930522,0.0001881325,0.0002041474,0.0001166367],"domain_scores_gemma":[0.9988273,0.0007177563,0.000159758,0.000111502,0.00008797931,0.0000957044],"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.0001616945,0.0001050438,0.0007346974,0.0001871069,0.00003188277,0.0001086646,0.0001933335,0.8807668,0.004695919,0.0498914,0.001043063,0.06208036],"study_design_scores_gemma":[0.00003116011,0.00009051317,0.00009251923,0.00002011888,0.000007108204,0.00003545301,0.000097004,0.9357119,0.00244118,0.06064571,0.0008147343,0.00001256685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1227429,0.0001939616,0.8716968,0.0002768043,0.00002084098,0.000177784,0.0003058023,0.0008196704,0.003765507],"genre_scores_gemma":[0.4143977,0.0001747449,0.5830608,0.00007439154,0.00001164079,0.0002394318,0.0006408211,0.0002117977,0.00118863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003882543,"threshold_uncertainty_score":0.01298845,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06101737584296183,"score_gpt":0.3170134430720717,"score_spread":0.2559960672291099,"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."}}