{"id":"W4414860631","doi":"10.1016/j.engappai.2025.112548","title":"A cost-effective nash-based allocation method for task distribution of multiple robots in distributed robotic networks","year":2025,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Robot; Task (project management); Nash equilibrium; Matching (statistics); Path (computing); Constant (computer programming); Efficient energy use; Distributed algorithm; Energy (signal processing)","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.000526666,0.0001295293,0.0002293711,0.0001875722,0.00006699857,0.00002928935,0.0004770333,0.00008422937,1.709109e-7],"category_scores_gemma":[0.0003348562,0.000150272,0.00007873933,0.001513158,0.00003394267,0.00009614995,0.0000733835,0.0001241527,9.784469e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001310432,"about_ca_system_score_gemma":0.00006366181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008620865,"about_ca_topic_score_gemma":0.00001150946,"domain_scores_codex":[0.9988121,0.00003623368,0.00052148,0.0003059228,0.00009795134,0.0002263116],"domain_scores_gemma":[0.9980795,0.00108896,0.0001463588,0.0003881395,0.0002618387,0.00003513676],"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.000009913922,0.00009608662,0.00007576185,0.00006014443,0.000009926703,6.713398e-8,0.00005392867,0.8393034,0.001991416,0.02284298,0.00002505842,0.1355313],"study_design_scores_gemma":[0.00005148676,0.00002799192,0.0009057078,0.00009339963,0.00001034994,2.051546e-7,0.00001082014,0.9324538,0.06435627,0.001674526,0.0003102932,0.0001051944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006413867,0.00007917155,0.9968062,0.000172027,0.0005001528,0.001707397,0.000007532865,0.00008286853,0.000003275251],"genre_scores_gemma":[0.8155472,0.000002072749,0.1832405,0.000007997512,0.00007022923,0.001009481,0.0001147361,0.00000618949,0.000001619297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8149058,"threshold_uncertainty_score":0.6127915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02187186261611766,"score_gpt":0.3059747609094866,"score_spread":0.2841028982933689,"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."}}