{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001960346,0.001183991,0.001693195,0.0009539566,0.001074263,0.001219571,0.002537272,0.001279536,0.003978742],"category_scores_gemma":[0.00356258,0.0005842912,0.0007074802,0.001038519,0.001030212,0.001713749,0.001813525,0.0009732043,0.0004823272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001631269,"about_ca_system_score_gemma":0.001979169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007296686,"about_ca_topic_score_gemma":0.008735626,"domain_scores_codex":[0.998971,0.0003997831,0.00004761927,0.0001458902,0.000286879,0.0001487892],"domain_scores_gemma":[0.9986712,0.0007634884,0.00006992356,0.00006345676,0.0003452475,0.00008681752],"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.0001863528,0.0001049346,0.0002620471,0.0001305576,0.00005580209,0.00006890901,0.00009151625,0.906148,0.002416461,0.02265884,0.002736789,0.0651398],"study_design_scores_gemma":[0.00001007177,0.00001802336,0.00002483128,0.000002954736,0.000006443947,0.00001164239,0.000008374551,0.9964086,0.0001344297,0.003168677,0.0002004732,0.000005432094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00686551,0.0002083538,0.9898379,0.0001433484,0.00008075292,0.0000776528,0.00001945922,0.0001351171,0.002631886],"genre_scores_gemma":[0.7529734,0.0003859997,0.2359961,0.0002801699,0.0001467919,0.0004449439,0.00007882969,0.0001171657,0.009576543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007296686,"threshold_uncertainty_score":0.01450843,"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."}}