{"id":"W4320085883","doi":"10.1016/j.automatica.2023.110873","title":"From drinking philosophers to asynchronous path-following robots","year":2023,"lang":"en","type":"article","venue":"Automatica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Office of Naval Research; National Sleep Foundation; Defense Advanced Research Projects Agency; University of Southern California; National Aeronautics and Space Administration; Simon Fraser University; National Science Foundation","keywords":"Asynchronous communication; Robot; Asynchrony (computer programming); Deadlock; Computer science; Distributed computing; Path (computing); State (computer science); Deadlock prevention algorithms; Motion planning; Resource allocation; Collision avoidance; Resource (disambiguation); Control (management); Mathematical optimization; Collision; Artificial intelligence; Algorithm; Computer security; Computer network; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001143921,0.0004929745,0.0005775493,0.000571166,0.001308751,0.002191834,0.001375374,0.002176822,0.0107646],"category_scores_gemma":[0.006760738,0.000684951,0.0007667223,0.000793308,0.004116266,0.005293977,0.003016468,0.003071533,0.0008035298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009538306,"about_ca_system_score_gemma":0.0009972132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002211142,"about_ca_topic_score_gemma":0.002659405,"domain_scores_codex":[0.9993267,0.0003177762,0.00002844237,0.0001691001,0.00009931765,0.00005864991],"domain_scores_gemma":[0.9976014,0.001636881,0.0001527018,0.0002786748,0.0001579732,0.0001723584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004148391,0.00002362314,0.0002392944,0.00005264422,0.00001054426,0.00004014781,0.0002530518,0.01968105,0.0004212847,0.9674356,0.001284116,0.01051718],"study_design_scores_gemma":[0.000019294,0.00001752148,0.00008598224,0.00001212733,0.000008039339,0.00002009619,0.00009524085,0.06095779,0.0002373935,0.9354262,0.003111638,0.000008716082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06443761,0.001240564,0.8774003,0.00533389,0.0003258044,0.0000515203,0.0001279565,0.0003474814,0.05073505],"genre_scores_gemma":[0.764716,0.001275843,0.1918897,0.001064964,0.0003677307,0.0001518471,0.0001573606,0.0002558864,0.04012069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0107646,"threshold_uncertainty_score":0.03601116,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02461861265299646,"score_gpt":0.2831257260662722,"score_spread":0.2585071134132758,"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."}}