{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008876532,0.0001617696,0.0001854351,0.00004214123,0.0001083466,0.00009279657,0.0006465138,0.00004519107,0.000009160654],"category_scores_gemma":[0.0001165716,0.00009671122,0.00003560625,0.0001262926,0.0001768971,0.000203001,0.0001268389,0.0001552453,0.00001239431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004598356,"about_ca_system_score_gemma":0.00002966609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006856056,"about_ca_topic_score_gemma":0.000007539178,"domain_scores_codex":[0.9986038,0.0001347015,0.0002195173,0.0004306409,0.0002404395,0.000370896],"domain_scores_gemma":[0.9986999,0.0004724323,0.00008474784,0.0006605483,0.000007900468,0.00007444176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001485306,0.0004852193,0.2894308,0.0001636511,0.0001966179,0.0002292593,0.04950974,0.2517208,0.003657522,0.09928164,0.001801156,0.303375],"study_design_scores_gemma":[0.001525333,0.000365611,0.1478137,0.0001080775,0.00001118039,0.00004141729,0.001085533,0.8461848,0.0006071157,0.00125755,0.0005832684,0.0004163499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01584018,0.00002105855,0.9812049,0.000570263,0.00007327404,0.0004052005,0.000004283522,0.00007836933,0.001802422],"genre_scores_gemma":[0.7174017,2.927732e-7,0.2819856,0.0003442919,0.00002944939,0.00004761973,0.000004407643,0.000008628745,0.0001779388],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7015615,"threshold_uncertainty_score":0.3943769,"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."}}