[{"language":[{"iso":"eng"}],"ddc":["004"],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"relation":"main_file","content_type":"application/pdf","file_size":1803186,"access_level":"open_access","file_name":"C4-Chapter-SFB-Buch-Final.pdf","file_id":"45896","date_updated":"2023-07-07T11:16:52Z","date_created":"2023-07-07T08:24:20Z","creator":"florida"}],"date_created":"2023-07-07T08:24:28Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","title":"On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers","year":"2023","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","department":[{"_id":"7"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"grant_number":"160364472","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16"}],"_id":"45895","file_date_updated":"2023-07-07T11:16:52Z","type":"book_chapter","status":"public","editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"author":[{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"first_name":"Marten","last_name":"Maack","id":"88252","full_name":"Maack, Marten"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Pukrop","id":"44428","full_name":"Pukrop, Simon","first_name":"Simon"},{"orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder","full_name":"Redder, Adrian","id":"52265","first_name":"Adrian"}],"volume":412,"oa":"1","date_updated":"2023-07-07T11:16:53Z","doi":"10.5281/zenodo.8068664","has_accepted_license":"1","citation":{"ieee":"H. Karl, M. Maack, F. Meyer auf der Heide, S. Pukrop, and A. Redder, “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 183–202.","chicago":"Karl, Holger, Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop, and Adrian Redder. “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:183–202. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068664\">https://doi.org/10.5281/zenodo.8068664</a>.","ama":"Karl H, Maack M, Meyer auf der Heide F, Pukrop S, Redder A. On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:183-202. doi:<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>","apa":"Karl, H., Maack, M., Meyer auf der Heide, F., Pukrop, S., &#38; Redder, A. (2023). On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 183–202). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068664\">https://doi.org/10.5281/zenodo.8068664</a>","mla":"Karl, Holger, et al. “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 183–202, doi:<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>.","bibtex":"@inbook{Karl_Maack_Meyer auf der Heide_Pukrop_Redder_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Karl, Holger and Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon and Redder, Adrian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={183–202}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","short":"H. Karl, M. Maack, F. Meyer auf der Heide, S. Pukrop, A. Redder, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 183–202."},"page":"183-202","intvolume":"       412","place":"Paderborn"},{"_id":"32811","project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"department":[{"_id":"75"}],"user_id":"477","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 58th Allerton Conference on Communication, Control, and Computing","type":"conference","abstract":[{"lang":"eng","text":"The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\\Delta(n)$ is reset to one; otherwise, $\\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\\Delta(n)$ is itself $\\alpha$-mixing from which we conclude a strong law of large numbers for $\\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times."}],"status":"public","date_updated":"2022-11-18T09:31:19Z","author":[{"first_name":"Adrian","full_name":"Redder, Adrian","id":"52265","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688"},{"first_name":"Arunselvan","id":"66937","full_name":"Ramaswamy, Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2022-08-15T09:59:17Z","title":"Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law","conference":{"name":"58th Allerton Conference on Communication, Control, and Computing"},"has_accepted_license":"1","year":"2022","citation":{"short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 58th Allerton Conference on Communication, Control, and Computing, 2022.","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law}, booktitle={Proceedings of the 58th Allerton Conference on Communication, Control, and Computing}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. 58th Allerton Conference on Communication, Control, and Computing.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.” In <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law,” presented at the 58th Allerton Conference on Communication, Control, and Computing, 2022.","ama":"Redder A, Ramaswamy A, Karl H. Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law. In: <i>Proceedings of the 58th Allerton Conference on Communication, Control, and Computing</i>. ; 2022."}},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2022-08-31T07:10:13Z","creator":"aredder","date_updated":"2022-08-31T07:10:13Z","file_id":"33237","file_name":"ICCART2022.pdf","access_level":"closed","file_size":298926}],"status":"public","type":"conference","publication":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","ddc":["006"],"language":[{"iso":"eng"}],"file_date_updated":"2022-08-31T07:10:13Z","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"NICCI-CN: Netzgewahre Regelung & regelungsgewahre Netze","_id":"24"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"_id":"30793","user_id":"477","department":[{"_id":"75"}],"year":"2022","citation":{"apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>","bibtex":"@inproceedings{Redder_Ramaswamy_Karl_2022, title={Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication}, DOI={<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>}, booktitle={Proceedings of the 14th International Conference on Agents and Artificial Intelligence}, publisher={SCITEPRESS - Science and Technology Publications}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","short":"A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 14th International Conference on Agents and Artificial Intelligence, SCITEPRESS - Science and Technology Publications, 2022.","mla":"Redder, Adrian, et al. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>, SCITEPRESS - Science and Technology Publications, 2022, doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>.","ama":"Redder A, Ramaswamy A, Karl H. Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication. In: <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications; 2022. doi:<a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” In <i>Proceedings of the 14th International Conference on Agents and Artificial Intelligence</i>. SCITEPRESS - Science and Technology Publications, 2022. <a href=\"https://doi.org/10.5220/0010845400003116\">https://doi.org/10.5220/0010845400003116</a>.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication,” 2022, doi: <a href=\"https://doi.org/10.5220/0010845400003116\">10.5220/0010845400003116</a>."},"publication_status":"published","has_accepted_license":"1","title":"Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication","doi":"10.5220/0010845400003116","date_updated":"2022-11-18T09:32:14Z","publisher":"SCITEPRESS - Science and Technology Publications","author":[{"id":"52265","full_name":"Redder, Adrian","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder","first_name":"Adrian"},{"id":"66937","full_name":"Ramaswamy, Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","first_name":"Arunselvan"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2022-04-06T07:18:36Z"},{"author":[{"last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","id":"52265","first_name":"Adrian"},{"id":"66937","full_name":"Ramaswamy, Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2022-04-06T06:53:38Z","date_updated":"2022-11-18T09:33:01Z","title":"Distributed gradient-based optimization in the presence of dependent  aperiodic communication","citation":{"bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Distributed gradient-based optimization in the presence of dependent  aperiodic communication}, journal={arXiv:2201.11343}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }","mla":"Redder, Adrian, et al. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022).","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Distributed gradient-based optimization in the presence of dependent  aperiodic communication. In <i>arXiv:2201.11343</i>.","ama":"Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the presence of dependent  aperiodic communication. <i>arXiv:220111343</i>. Published online 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization in the presence of dependent  aperiodic communication,” <i>arXiv:2201.11343</i>. 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022."},"year":"2022","user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"external_id":{"arxiv":["2201.11343"]},"_id":"30790","language":[{"iso":"eng"}],"type":"preprint","publication":"arXiv:2201.11343","status":"public","abstract":[{"lang":"eng","text":"Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate with each other, over time, in order to minimize/maximize a global\r\nobjective. In the presence of unreliable communication networks, the\r\nAge-of-Information (AoI), which measures the freshness of data received, may be\r\nlarge and hence hinder algorithmic convergence. In this paper, we study the\r\nconvergence of general distributed gradient-based optimization algorithms in\r\nthe presence of communication that neither happens periodically nor at\r\nstochastically independent points in time. We show that convergence is\r\nguaranteed provided the random variables associated with the AoI processes are\r\nstochastically dominated by a random variable with finite first moment. This\r\nimproves on previous requirements of boundedness of more than the first moment.\r\nWe then introduce stochastically strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically dominated by a\r\nrandom variable with finite $p$-th moment. In combination with our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges in the presence of AoI, if $\\alpha(n)$ is summable."}]},{"year":"2022","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. <i>arXiv:220100570</i>. Published online 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms,” <i>arXiv:2201.00570</i>. 2022.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms. In <i>arXiv:2201.00570</i>.","mla":"Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.","short":"A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms}, journal={arXiv:2201.00570}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }"},"title":"Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms","date_updated":"2022-11-18T09:33:42Z","author":[{"first_name":"Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","id":"52265","full_name":"Redder, Adrian"},{"id":"66937","full_name":"Ramaswamy, Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2022-04-06T06:53:52Z","abstract":[{"lang":"eng","text":"We present sufficient conditions that ensure convergence of the multi-agent\r\nDeep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of\r\nthe most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling\r\ncontinuous action spaces: the actor-critic paradigm. In the setting considered\r\nherein, each agent observes a part of the global state space in order to take\r\nlocal actions, for which it receives local rewards. For every agent, DDPG\r\ntrains a local actor (policy) and a local critic (Q-function). The analysis\r\nshows that multi-agent DDPG using neural networks to approximate the local\r\npolicies and critics converge to limits with the following properties: The\r\ncritic limits minimize the average squared Bellman loss; the actor limits\r\nparameterize a policy that maximizes the local critic's approximation of\r\n$Q_i^*$, where $i$ is the agent index. The averaging is with respect to a\r\nprobability distribution over the global state-action space. It captures the\r\nasymptotics of all local training processes. Finally, we extend the analysis to\r\na fully decentralized setting where agents communicate over a wireless network\r\nprone to delays and losses; a typical scenario in, e.g., robotic applications."}],"status":"public","publication":"arXiv:2201.00570","type":"preprint","language":[{"iso":"eng"}],"_id":"30791","external_id":{"arxiv":["2201.00570"]},"project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"75"}],"user_id":"477"},{"author":[{"last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","id":"52265","first_name":"Adrian"},{"id":"66937","full_name":"Ramaswamy, Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"volume":55,"date_updated":"2022-11-18T10:05:14Z","conference":{"name":"IFAC Conference on Networked Systems"},"has_accepted_license":"1","citation":{"ama":"Redder A, Ramaswamy A, Karl H. Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>. 2022;55(13):133–138.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Practical Network Conditions for the Convergence of Distributed Optimization,” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, pp. 133–138, 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i> 55, no. 13 (2022): 133–138.","mla":"Redder, Adrian, et al. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, Elsevier, 2022, pp. 133–138.","bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Practical Network Conditions for the Convergence of Distributed Optimization}, volume={55}, number={13}, journal={IFAC-PapersOnLine}, publisher={Elsevier}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022}, pages={133–138} }","short":"A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 133–138.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>, <i>55</i>(13), 133–138."},"intvolume":"        55","page":"133–138","user_id":"477","department":[{"_id":"75"}],"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"_id":"32854","file_date_updated":"2022-08-31T07:06:30Z","type":"journal_article","status":"public","date_created":"2022-08-16T09:12:55Z","publisher":"Elsevier","title":"Practical Network Conditions for the Convergence of Distributed Optimization","issue":"13","year":"2022","language":[{"iso":"eng"}],"ddc":["006"],"publication":"IFAC-PapersOnLine","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2022-08-31T07:06:30Z","date_created":"2022-08-31T07:06:30Z","creator":"aredder","file_size":298395,"file_name":"NecSys2022____Practical_Conditions_for_Conv.pdf","access_level":"closed","file_id":"33236"}]},{"citation":{"ieee":"A. Ramaswamy, A. Redder, and D. E. Quevedo, “Distributed optimization over time-varying networks with stochastic information delays,” <i>IEEE Transactions on Automatic Control</i>, pp. 1–1, 2021, doi: <a href=\"https://doi.org/10.1109/TAC.2021.3108492\">10.1109/TAC.2021.3108492</a>.","chicago":"Ramaswamy, Arunselvan, Adrian Redder, and Daniel E. Quevedo. “Distributed Optimization over Time-Varying Networks with Stochastic Information Delays.” <i>IEEE Transactions on Automatic Control</i>, 2021, 1–1. <a href=\"https://doi.org/10.1109/TAC.2021.3108492\">https://doi.org/10.1109/TAC.2021.3108492</a>.","ama":"Ramaswamy A, Redder A, Quevedo DE. Distributed optimization over time-varying networks with stochastic information delays. <i>IEEE Transactions on Automatic Control</i>. Published online 2021:1-1. doi:<a href=\"https://doi.org/10.1109/TAC.2021.3108492\">10.1109/TAC.2021.3108492</a>","apa":"Ramaswamy, A., Redder, A., &#38; Quevedo, D. E. (2021). Distributed optimization over time-varying networks with stochastic information delays. <i>IEEE Transactions on Automatic Control</i>, 1–1. <a href=\"https://doi.org/10.1109/TAC.2021.3108492\">https://doi.org/10.1109/TAC.2021.3108492</a>","mla":"Ramaswamy, Arunselvan, et al. “Distributed Optimization over Time-Varying Networks with Stochastic Information Delays.” <i>IEEE Transactions on Automatic Control</i>, 2021, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/TAC.2021.3108492\">10.1109/TAC.2021.3108492</a>.","bibtex":"@article{Ramaswamy_Redder_Quevedo_2021, title={Distributed optimization over time-varying networks with stochastic information delays}, DOI={<a href=\"https://doi.org/10.1109/TAC.2021.3108492\">10.1109/TAC.2021.3108492</a>}, journal={IEEE Transactions on Automatic Control}, author={Ramaswamy, Arunselvan and Redder, Adrian and Quevedo, Daniel E.}, year={2021}, pages={1–1} }","short":"A. Ramaswamy, A. Redder, D.E. Quevedo, IEEE Transactions on Automatic Control (2021) 1–1."},"page":"1-1","year":"2021","author":[{"first_name":"Arunselvan","full_name":"Ramaswamy, Arunselvan","id":"66937","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111"},{"first_name":"Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","full_name":"Redder, Adrian","id":"52265"},{"first_name":"Daniel E.","full_name":"Quevedo, Daniel E.","last_name":"Quevedo"}],"date_created":"2021-09-10T09:48:55Z","date_updated":"2022-08-16T09:16:43Z","doi":"10.1109/TAC.2021.3108492","title":"Distributed optimization over time-varying networks with stochastic information delays","type":"journal_article","publication":"IEEE Transactions on Automatic Control","status":"public","user_id":"52265","project":[{"_id":"24","name":"NICCI-CN: Netzgewahre Regelung & regelungsgewahre Netze"}],"_id":"24140","language":[{"iso":"eng"}]},{"has_accepted_license":"1","publication_status":"published","citation":{"bibtex":"@inproceedings{Redder_Ramaswamy_Quevedo_2019, title={Deep reinforcement learning for scheduling in large-scale networked control systems}, booktitle={Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems}, author={Redder, Adrian and Ramaswamy, Arunselvan and Quevedo, Daniel}, year={2019} }","short":"A. Redder, A. Ramaswamy, D. Quevedo, in: Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems, 2019.","mla":"Redder, Adrian, et al. “Deep Reinforcement Learning for Scheduling in Large-Scale Networked Control Systems.” <i>Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems</i>, 2019.","apa":"Redder, A., Ramaswamy, A., &#38; Quevedo, D. (2019). Deep reinforcement learning for scheduling in large-scale networked control systems. In <i>Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems</i>. Chicago, USA.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Daniel Quevedo. “Deep Reinforcement Learning for Scheduling in Large-Scale Networked Control Systems.” In <i>Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems</i>, 2019.","ieee":"A. Redder, A. Ramaswamy, and D. Quevedo, “Deep reinforcement learning for scheduling in large-scale networked control systems,” in <i>Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems</i>, Chicago, USA, 2019.","ama":"Redder A, Ramaswamy A, Quevedo D. Deep reinforcement learning for scheduling in large-scale networked control systems. In: <i>Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems</i>. ; 2019."},"author":[{"id":"52265","full_name":"Redder, Adrian","orcid":"https://orcid.org/0000-0001-7391-4688","last_name":"Redder","first_name":"Adrian"},{"first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","id":"66937","full_name":"Ramaswamy, Arunselvan"},{"last_name":"Quevedo","full_name":"Quevedo, Daniel","first_name":"Daniel"}],"oa":"1","date_updated":"2022-01-06T06:51:36Z","conference":{"location":"Chicago, USA","end_date":"2019-09-17","start_date":"2019-09-16","name":"8th IFAC Workshop on Distributed Estimation and Control in Networked Systems - NECSYS 2019"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1905.05992"}],"type":"conference","status":"public","user_id":"52265","_id":"13443","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"file_date_updated":"2019-09-23T16:21:16Z","year":"2019","date_created":"2019-09-23T16:00:58Z","title":"Deep reinforcement learning for scheduling in large-scale networked control systems","publication":"Proceedings of the 8th IFAC Workshop on Distributed Estimation and Control in Networked Systems","file":[{"relation":"main_file","content_type":"application/pdf","file_size":371429,"access_level":"local","file_id":"13444","file_name":"ifacconf.pdf","date_updated":"2019-09-23T16:21:16Z","date_created":"2019-09-23T15:48:33Z","creator":"aredder"}],"abstract":[{"text":"This work considers the problem of control and resource allocation in networked\r\nsystems. To this end, we present DIRA a Deep reinforcement learning based Iterative Resource\r\nAllocation algorithm, which is scalable and control-aware. Our algorithm is tailored towards\r\nlarge-scale problems where control and scheduling need to act jointly to optimize performance.\r\nDIRA can be used to schedule general time-domain optimization based controllers. In the present\r\nwork, we focus on control designs based on suitably adapted linear quadratic regulators. We\r\napply our algorithm to networked systems with correlated fading communication channels. Our\r\nsimulations show that DIRA scales well to large scheduling problems.","lang":"eng"}],"language":[{"iso":"eng"}],"keyword":["Networked control systems","deep reinforcement learning","large-scale systems","resource scheduling","stochastic control"],"ddc":["620"]}]