{"id":"W1499948104","doi":"10.1007/978-3-642-55146-8_24","title":"Optimal Multi-Robot Path Planning with LTL Constraints: Guaranteeing Correctness through Synchronization","year":2014,"lang":"en","type":"book-chapter","venue":"Springer tracts in advanced robotics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Linear temporal logic; Software deployment; Robot; Set (abstract data type); Task (project management); Synchronization (alternating current); Computer science; Supervisor; Proposition; Real-time computing; Temporal logic; Interval (graph theory); Path (computing); Distributed computing; Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Theoretical computer science; Engineering; Algorithm; Programming language","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.001348662,0.000955041,0.0009311842,0.0004920104,0.0005046389,0.001261974,0.001728134,0.0009559718,0.003854618],"category_scores_gemma":[0.006075066,0.000855866,0.0008420323,0.0007488517,0.001948288,0.00209296,0.002511336,0.002199353,0.0008019353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000819205,"about_ca_system_score_gemma":0.001960069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001804483,"about_ca_topic_score_gemma":0.002296757,"domain_scores_codex":[0.9985605,0.0003152743,0.0001117467,0.0003107193,0.0005355258,0.0001662114],"domain_scores_gemma":[0.9970484,0.001832666,0.0002567708,0.0004937858,0.0002869609,0.00008149148],"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.0002808589,0.0000680477,0.0003908323,0.0003707624,0.00004633229,0.0002109135,0.000181289,0.6882384,0.01864524,0.1894113,0.002635625,0.09952029],"study_design_scores_gemma":[0.00005245802,0.00006135375,0.00009897559,0.00003518109,0.00001572362,0.00003735704,0.00002041875,0.8794825,0.009000991,0.1091147,0.002064255,0.00001612769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00542837,0.0001456904,0.9900993,0.0001063599,0.00004219747,0.00003006924,0.0000539489,0.0006911805,0.003402937],"genre_scores_gemma":[0.6546445,0.0005107264,0.3393103,0.0001965081,0.00008080774,0.0003181105,0.0003262939,0.0006265087,0.003986165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003854618,"threshold_uncertainty_score":0.01289505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03282874829060847,"score_gpt":0.2888773550286061,"score_spread":0.2560486067379977,"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."}}