Recurrent twin-delayed deep deterministic policy gradient algorithm for multi-agent path planning in partially observable and communication-restricted environments
Information Sciences · 2027-02 · 762 · 124209
DOI: 10.1016/j.ins.2026.124209 ↗Kurz gefasst
Fachartikel in der Zeitschrift Information Sciences, 2027-02. Verfasst von Ping Liu und 6 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Liu, P., Yang, J., Liu, W., Ma, X., Wang, J., Alfarraj, O., & Tolba, A. (2027). Recurrent twin-delayed deep deterministic policy gradient algorithm for multi-agent path planning in partially observable and communication-restricted environments. Information Sciences, 762, 124209. https://doi.org/10.1016/j.ins.2026.124209
Vancouver
Liu P, Yang J, Liu W, Ma X, Wang J, Alfarraj O, et al. Recurrent twin-delayed deep deterministic policy gradient algorithm for multi-agent path planning in partially observable and communication-restricted environments. Information Sciences. 2027;762:124209. doi:10.1016/j.ins.2026.124209
BibTeX
@article{Liu2027,
author = {Liu, Ping and Yang, Jinhao and Liu, Wei and Ma, Xiangyu and Wang, Jin and Alfarraj, Osama and Tolba, Amr},
title = {Recurrent twin-delayed deep deterministic policy gradient algorithm for multi-agent path planning in partially observable and communication-restricted environments},
journal = {Information Sciences},
year = {2027},
volume = {762},
pages = {124209},
doi = {10.1016/j.ins.2026.124209}
}
EUVIMED