{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002519101,0.001133179,0.001517066,0.0009298858,0.0008317854,0.001105081,0.002317173,0.001410644,0.00181761],"category_scores_gemma":[0.01157087,0.0006965545,0.0009789333,0.00103193,0.001326712,0.002177102,0.001997835,0.001197387,0.0004012297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049133,"about_ca_system_score_gemma":0.001986103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003512288,"about_ca_topic_score_gemma":0.002951138,"domain_scores_codex":[0.9977335,0.0005827224,0.0001358483,0.0006535474,0.0007005067,0.000193801],"domain_scores_gemma":[0.994352,0.003380179,0.0008284468,0.0007072294,0.0005890712,0.00014303],"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.0001231084,0.00002475355,0.0005535466,0.0001087113,0.00005591006,0.00008978802,0.00005432561,0.9483435,0.002845415,0.01232873,0.0007236297,0.03474858],"study_design_scores_gemma":[0.00001438979,0.0000366946,0.00009108083,0.000006482729,0.00001029372,0.00004188665,0.00001410276,0.9886629,0.001484888,0.009003654,0.0006236476,0.00001003829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009355963,0.0001758103,0.9887977,0.0001232768,0.00001806782,0.00004879564,0.00004818638,0.0004877514,0.0009444499],"genre_scores_gemma":[0.5698254,0.0002630725,0.4278302,0.00009935939,0.00003163722,0.0001731724,0.0002344948,0.0001590728,0.001383478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003512288,"threshold_uncertainty_score":0.01332241,"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."}}