{"id":"W4288408921","doi":"10.48550/arxiv.1903.10483","title":"Computing a Minimal Set of t-Spanning Motion Primitives for Lattice\\n Planners","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Motion planning; Integer programming; Heuristics; Lattice (music); Integer lattice; Configuration space; Mathematics; Computer science; Algorithm; Tree traversal; Linear programming; Discrete mathematics; Theoretical computer science; Mathematical optimization; Topology (electrical circuits); Combinatorics; Robot; Artificial intelligence","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.0005573696,0.0006418597,0.0007939009,0.0008801977,0.0005982923,0.0011025,0.0008635301,0.0008549485,0.004382281],"category_scores_gemma":[0.002914137,0.0005296072,0.0009114431,0.0007003062,0.001097406,0.002010179,0.001524767,0.001027447,0.0004527852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009980334,"about_ca_system_score_gemma":0.001602065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003319798,"about_ca_topic_score_gemma":0.004294706,"domain_scores_codex":[0.9994797,0.00009926979,0.00004116135,0.0001409315,0.0001426121,0.00009639587],"domain_scores_gemma":[0.9993895,0.0003483753,0.00008521288,0.00006687224,0.00005092134,0.00005919571],"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.0001644806,0.0001153321,0.0008881236,0.000199034,0.00002972313,0.0001184829,0.0001789818,0.8611114,0.005697569,0.0413702,0.001301552,0.08882514],"study_design_scores_gemma":[0.00002616941,0.00008242087,0.0001047227,0.00001712328,0.000006277833,0.00003191164,0.00009661649,0.9649054,0.002663601,0.03111262,0.0009434702,0.000009623279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1604111,0.0002028605,0.8308437,0.0003380655,0.00002646288,0.0001795884,0.0003528813,0.001219854,0.006425469],"genre_scores_gemma":[0.4274392,0.0001926648,0.569122,0.00008561272,0.00001286649,0.0002095181,0.0008653734,0.0002254557,0.001847331],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004382281,"threshold_uncertainty_score":0.01466018,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07567046648040808,"score_gpt":0.1960010352495608,"score_spread":0.1203305687691527,"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."}}