{"id":"W4403487305","doi":"10.3233/faia240913","title":"Multi-Agent Path Finding with Task Assignment and Supporting Constraints","year":2024,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Task (project management); Path (computing); Computer science; Distributed computing; Computer network; Engineering; Systems 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.0006262073,0.001265659,0.0008546404,0.0006713859,0.0007173554,0.0009809074,0.001642085,0.001199046,0.002657022],"category_scores_gemma":[0.002498918,0.0004683403,0.0006551632,0.001401633,0.0005592651,0.001396278,0.001160737,0.001005834,0.0003069724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008400544,"about_ca_system_score_gemma":0.002223549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009233095,"about_ca_topic_score_gemma":0.007790743,"domain_scores_codex":[0.9993095,0.0002073318,0.00003843044,0.0001482479,0.0001595765,0.0001367148],"domain_scores_gemma":[0.9990605,0.0005155433,0.0001332002,0.0000930629,0.0001130907,0.00008471236],"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.0001086364,0.0001100898,0.0004530386,0.0001514923,0.00003513164,0.0001507562,0.00005878854,0.9421552,0.001876127,0.01055297,0.002068625,0.04227919],"study_design_scores_gemma":[0.00004254005,0.00004736611,0.0001295217,0.000006155214,0.000009429272,0.00005953689,0.00003217974,0.9920098,0.000765094,0.005274757,0.001617471,0.000006204117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0765496,0.0004565605,0.91458,0.0004134938,0.00008288735,0.0002753479,0.0003699659,0.0008648554,0.006407295],"genre_scores_gemma":[0.4950461,0.000193079,0.5008938,0.00007337195,0.00003120836,0.0003303453,0.0003879984,0.00008906331,0.002955104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009233095,"threshold_uncertainty_score":0.01835871,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04882733459633935,"score_gpt":0.2906728951649754,"score_spread":0.2418455605686361,"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."}}