EUVIMEDEUVIMED entdecken
Crossref

Rapid distributed task allocation for large-scale redundant agents: a confidence proxy-driven posterior correction and greedy swapping method

Pei Chi, Chen Liu, Jiang Zhao, Xuyang Gao, Yingxun Wang

Robotica · 2026-05 · 44 (5) · 1673-1702

DOI: 10.1017/s0263574726103750 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Robotica, online erschienen am 13.07.2026. Verfasst von Pei Chi und 4 weiteren Autor:innen. Die Arbeit nennt 37 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For large-scale problems, efficiently optimizing task allocation with local communication and computing resources is challenging. Existing algorithms often fall short in task allocation computation time. Inspired by Bayesian estimation, we propose a parametric heuristic algorithm for redundant agents that can effectively perform dynamic task allocation in distributed architectures. Firstly, the method includes a confidence proxy-driven posterior correction algorithm (CPPCA), which can iteratively satisfy the constraint of the number of agents for each task based on local communication. We also prove that CPPCA can strictly converge after the number of neighbors is larger than a certain value. Then, we design a greedy swapping algorithm (GSA) to reduce the total cost while satisfying the constraints. It is also proved that the algorithm can converge in a finite number of steps under the condition that the communication graph is connected. Finally, the feasibility of the method is verified by simulation experiments. It shows that the confidence proxy-driven posterior correction and greedy swapping (CPPC-GS) method has significant advantages over the baseline algorithms in solving large-scale problems under the premise of redundant agents. It also has good results in the face of dynamic task allocation. Furthermore, the virtual-real fusion experiment bridges the “modeling gap” by validating the algorithm’s resilience to real-world engineering constraints, such as non-ideal communication and hardware heterogeneity, ensuring a seamless transition from theoretical frameworks to robust practical deployment.

Zitieren

APA

Chi, P., Liu, C., Zhao, J., Gao, X., & Wang, Y. (2026). Rapid distributed task allocation for large-scale redundant agents: a confidence proxy-driven posterior correction and greedy swapping method. Robotica, 44(5), 1673-1702. https://doi.org/10.1017/s0263574726103750

Vancouver

Chi P, Liu C, Zhao J, Gao X, Wang Y. Rapid distributed task allocation for large-scale redundant agents: a confidence proxy-driven posterior correction and greedy swapping method. Robotica. 2026;44(5):1673-1702. doi:10.1017/s0263574726103750

BibTeX
@article{Chi2026,
  author = {Chi, Pei and Liu, Chen and Zhao, Jiang and Gao, Xuyang and Wang, Yingxun},
  title = {Rapid distributed task allocation for large-scale redundant agents: a confidence proxy-driven posterior correction and greedy swapping method},
  journal = {Robotica},
  year = {2026},
  volume = {44},
  number = {5},
  pages = {1673--1702},
  doi = {10.1017/s0263574726103750}
}
Kostenlos starten →