{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007805222,0.001134884,0.0008817288,0.0007769235,0.0007944151,0.0008461153,0.001914277,0.001174487,0.007651103],"category_scores_gemma":[0.002454915,0.0008036057,0.001912935,0.001227661,0.0009805323,0.001353818,0.001649982,0.002028499,0.0008860378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001207302,"about_ca_system_score_gemma":0.002096491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007456379,"about_ca_topic_score_gemma":0.01308035,"domain_scores_codex":[0.9993564,0.0001799917,0.00003860004,0.0001395814,0.000228548,0.0000568537],"domain_scores_gemma":[0.9989906,0.0006601799,0.00008284512,0.0001020661,0.0001274236,0.00003686805],"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.00003654402,0.00003859259,0.0002427644,0.0001859538,0.00005319315,0.0001027313,0.00006972544,0.8914672,0.002130844,0.03298947,0.002525297,0.07015765],"study_design_scores_gemma":[0.00001292587,0.00001452628,0.00003037828,0.000008452494,0.00000618002,0.00001890423,0.00001416376,0.9845503,0.0005350129,0.0129431,0.001861693,0.000004310114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001679917,0.00006140923,0.9958326,0.0001127049,0.0000250667,0.00004992983,0.00007562965,0.0003494663,0.001813333],"genre_scores_gemma":[0.0642271,0.0001185263,0.9328986,0.0001136228,0.00003476784,0.0003264946,0.0002873965,0.000187387,0.001806054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007651103,"threshold_uncertainty_score":0.02559543,"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."}}