{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003067807,0.0002838802,0.0003075361,0.000252207,0.0001706364,0.0002514775,0.0003459362,0.0001629156,0.000008039052],"category_scores_gemma":[0.000009947233,0.00026467,0.00003727512,0.000122813,0.000361041,0.0001167324,0.0001830022,0.0004115711,0.00004349744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008827211,"about_ca_system_score_gemma":0.00008903403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008147951,"about_ca_topic_score_gemma":0.000004284681,"domain_scores_codex":[0.9981727,0.00001139852,0.0004943972,0.0007891176,0.0002249427,0.0003074445],"domain_scores_gemma":[0.9992099,0.00006256052,0.0001924161,0.0003597802,0.00003892262,0.0001364566],"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.000003512021,0.00004570757,0.0001906641,0.00008158422,0.00006690309,0.0001057297,0.00136513,0.001077175,0.00005378228,0.3716285,0.0003958847,0.6249854],"study_design_scores_gemma":[0.00009656011,0.0001934083,0.00007079198,0.001325744,0.0001334024,0.0001284162,0.001530965,0.6004975,0.000459734,0.3670453,0.02713183,0.001386308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00000891563,0.0009252242,0.9902492,0.0002687662,0.0002682157,0.000631668,0.00003600891,0.00008974956,0.00752223],"genre_scores_gemma":[0.02960179,0.0007051072,0.9428843,0.0001704662,0.0002478718,0.0003979676,0.00005671466,0.00007379994,0.02586195],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6235991,"threshold_uncertainty_score":0.9999806,"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."}}