{"id":"W2930266512","doi":"10.1109/tro.2019.2896401","title":"An SMT-Based Approach to Motion Planning for Multiple Robots With Complex Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Motion planning; Computer science; Robot; Mathematical optimization; Travelling salesman problem; Routing (electronic design automation); Correctness; Boolean satisfiability problem; Path (computing); Task (project management); Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002568124,0.0003095041,0.0003304977,0.000298276,0.0002759825,0.0001797555,0.0007112196,0.000110586,0.000006077336],"category_scores_gemma":[0.000007532698,0.0002941749,0.00009171781,0.0004891219,0.00007430263,0.0003516572,0.000002379659,0.000261998,0.00005694802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001250414,"about_ca_system_score_gemma":0.0001317201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001667768,"about_ca_topic_score_gemma":0.000002270591,"domain_scores_codex":[0.9979199,0.00008288762,0.0003067813,0.0007457645,0.0004150524,0.0005296041],"domain_scores_gemma":[0.9982739,0.0002921961,0.0001065606,0.0008715219,0.0001692543,0.0002865495],"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.00005861222,0.0004525764,0.0002061543,0.0000360602,0.00003109685,0.000004230345,0.0004258182,0.9921136,0.0008079727,0.0002411804,0.00005688893,0.005565742],"study_design_scores_gemma":[0.001560538,0.0008124739,0.0009721899,0.00007513907,0.00002646373,0.00002716401,0.0001058882,0.9938141,0.002164458,0.00002351604,0.00002051485,0.0003975143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001429674,0.000002119345,0.9958165,0.0003064355,0.0006100348,0.001136487,0.0000488515,0.0004305039,0.0002194191],"genre_scores_gemma":[0.4664736,7.731791e-8,0.5329316,0.0004424544,0.0000213437,0.00005055544,0.00001893043,0.00002403458,0.00003744423],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4650439,"threshold_uncertainty_score":0.9999511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0494575595978199,"score_gpt":0.2779375566126992,"score_spread":0.2284799970148793,"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."}}