{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002751399,0.0001123129,0.0001517414,0.0001387791,0.0001599356,0.0002674645,0.0007102635,0.00004457142,0.00006981796],"category_scores_gemma":[0.0001043673,0.0001095403,0.00007126374,0.0009185506,0.0000122855,0.0003315584,0.0003558716,0.0000821455,0.002724261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004694134,"about_ca_system_score_gemma":0.00006051762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003097807,"about_ca_topic_score_gemma":0.000002753847,"domain_scores_codex":[0.9986461,0.00006375729,0.0002109305,0.0003323946,0.0003894264,0.0003574366],"domain_scores_gemma":[0.9991044,0.0001534929,0.00003603037,0.000500645,0.00002956462,0.0001758223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007910748,0.0003116824,0.003805508,0.0000925191,0.0004225268,0.0009043776,0.05516904,0.2917891,0.007141291,0.1836124,0.03072688,0.4260168],"study_design_scores_gemma":[0.0002281014,0.00004660172,0.002979048,0.00008201332,0.000004741443,0.000001242012,0.00006750764,0.9774966,0.0002079595,0.0176934,0.0009862998,0.0002064575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03928122,0.00001797025,0.9381037,0.01233475,0.0007057132,0.000327689,0.000001741658,0.002327549,0.006899705],"genre_scores_gemma":[0.7308745,0.000004299539,0.2676892,0.001017425,0.00009725313,0.00003923986,0.0000102592,0.00001890861,0.0002488638],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6915933,"threshold_uncertainty_score":0.9980522,"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."}}