{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005809896,0.0007351076,0.0007950625,0.0002914911,0.0001978016,0.0001937384,0.001175443,0.0005084936,0.00001358329],"category_scores_gemma":[0.0002369831,0.000735426,0.0001013717,0.0002214708,0.0003698325,0.001030389,0.0002470504,0.001262837,0.00003606385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004224837,"about_ca_system_score_gemma":0.0002261464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000425,"about_ca_topic_score_gemma":0.000006610328,"domain_scores_codex":[0.9965324,0.00008657866,0.000910641,0.001153435,0.0006295171,0.0006874456],"domain_scores_gemma":[0.9971762,0.0002713368,0.0009325193,0.001216945,0.0002872216,0.0001158273],"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.00002993379,0.00004404292,0.00006094246,0.000142973,0.00003044019,0.0001039098,0.0006676952,0.7770984,0.00006928795,0.1737556,0.000003114216,0.04799373],"study_design_scores_gemma":[0.00253359,0.0004651864,0.0007971817,0.006494337,0.00009346058,0.0002637012,0.0001153496,0.9775485,0.0009092247,0.002638367,0.005731284,0.002409778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006033442,0.0004375142,0.9804594,0.00004028351,0.001628096,0.0006661941,0.000005435396,0.0003522658,0.01635047],"genre_scores_gemma":[0.02467676,0.000149651,0.9708222,0.0001324117,0.0001416767,0.00002434098,0.00003025905,0.0001383048,0.00388443],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2004502,"threshold_uncertainty_score":0.9995097,"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."}}