{"id":"W3037357983","doi":"10.1609/icaps.v30i1.6642","title":"Probabilistic Robust Multi-Agent Path Finding","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Probabilistic logic; Path (computing); Set (abstract data type); Computer science; Task (project management); Mathematical optimization; Algorithm; Robustness (evolution); Mathematics; Artificial intelligence; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.0003132073,0.0001850125,0.000200894,0.00008694497,0.000162156,0.0003270749,0.00126333,0.00007366062,0.000004856915],"category_scores_gemma":[0.0006678925,0.0001430025,0.00005268632,0.0002412955,0.00005854556,0.0002839997,0.0003839126,0.0003119369,0.000008175066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003950682,"about_ca_system_score_gemma":0.00006474894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006134092,"about_ca_topic_score_gemma":3.840891e-8,"domain_scores_codex":[0.9985362,0.00001174963,0.0003264266,0.0004282193,0.0004747273,0.0002226496],"domain_scores_gemma":[0.9991184,0.00007641086,0.0003093169,0.0000958517,0.000283676,0.000116362],"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.0001856268,0.0004089832,0.06775259,0.0006870925,0.0005012836,0.0000702962,0.03043225,0.5243023,0.1053153,0.2622953,0.00236042,0.005688581],"study_design_scores_gemma":[0.0003139567,0.00006725419,0.003692623,0.0006063921,0.000008805446,0.0000210786,0.0003318003,0.9922652,0.002200295,0.0003139537,0.00001886972,0.0001598141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8955045,0.0001115355,0.08442745,0.01212872,0.001065936,0.0004597089,0.00001916458,0.001537177,0.004745851],"genre_scores_gemma":[0.8560405,0.000004225851,0.1435046,0.0003403588,0.00004857689,0.000008431319,0.000001906914,0.000009485329,0.00004189668],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4679629,"threshold_uncertainty_score":0.583147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1100361008003602,"score_gpt":0.2997737098215403,"score_spread":0.1897376090211801,"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."}}