{"id":"W2153583758","doi":"10.1109/icra.2014.6907707","title":"A language for robot path planning in discrete environments: The TSP with Boolean satisfiability constraints","year":2014,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Boolean satisfiability problem; Motion planning; Vertex (graph theory); Computer science; Satisfiability; Graph; Shortest path problem; Theoretical computer science; Path (computing); Mathematical optimization; Robot; Mathematics; Algorithm; 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.00179555,0.001275439,0.0009015417,0.001092696,0.0009293796,0.002422859,0.002493993,0.001670473,0.007872899],"category_scores_gemma":[0.006113546,0.0008370138,0.002061653,0.002754874,0.002175278,0.004550276,0.002079403,0.004840873,0.002237302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001428623,"about_ca_system_score_gemma":0.003504181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004316007,"about_ca_topic_score_gemma":0.005900702,"domain_scores_codex":[0.9978763,0.0007433379,0.0002986285,0.0003601522,0.0005917531,0.0001298797],"domain_scores_gemma":[0.996457,0.002233941,0.0003581544,0.0003847677,0.0004350651,0.0001309642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001201505,0.0001064592,0.0003283979,0.0009240992,0.00006067813,0.0004467642,0.0005745243,0.09508779,0.005728868,0.7883527,0.03025321,0.07801625],"study_design_scores_gemma":[0.0001650822,0.0001420593,0.0001718934,0.0002881412,0.00007850119,0.0006364581,0.0002842253,0.4072581,0.005858289,0.4128541,0.172178,0.0000851362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001811435,0.0002988956,0.9900509,0.0009679559,0.0001502855,0.0001269462,0.001041537,0.001298645,0.004253347],"genre_scores_gemma":[0.0459672,0.0009490849,0.9454224,0.0007203036,0.0001429256,0.0007206465,0.002012305,0.0005890637,0.003476056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007872899,"threshold_uncertainty_score":0.0263375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01104473651764194,"score_gpt":0.2488754303803556,"score_spread":0.2378306938627137,"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."}}