A Communication Security Game on Switched Systems for Autonomous Vehicle Platoons

Sun, Guoxin; Alpcan, Tansu; Rubinstein, Benjamin I. P.; Camtepe, Seyit

doi:10.1109/cdc45484.2021.9683543

Cited by 4 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to their inherent adaptability, such systems can dynamically shape their behavior and control strategies to adeptly respond to changes in environmental conditions or system requirements. Switching systems are encountered in a variety of areas such as robots [1,2], power systems [3], and communication networks [4,5]. The success of these applications demonstrates the versatility and importance of switching systems.…”

Section: Introductionmentioning

confidence: 99%

A new computational approach for optimal control of switched systems

Zhu,

Bai,

et al. 2024

J Inequal Appl

View full text Add to dashboard Cite

The combination of the time-scaling transformation and control parameterization has proven to be an effective approach in addressing optimal control problems involving switching systems with predefined subsystem sequences. However, this approach has certain limitations. First, the number of control switchings is required to be no less than the number of subsystem switchings. Second, the switching of the subsystem must be accompanied by the switching of the control. Third, this scheme introduces many hyperparameters, leading to combinatorial explosion. To address these drawbacks, we introduce a novel computational approach such that the control switching can be independent of subsystem switching. The superiority of this novel approach can be clearly observed from the solutions obtained using the proposed method for solving two illustrative examples.

show abstract

Section: Introductionmentioning

confidence: 99%

A new computational approach for optimal control of switched systems

Zhu,

Bai,

et al. 2024

J Inequal Appl

View full text Add to dashboard Cite

show abstract

“…Recent work has proposed an Adversarial Strategic Game for 'Machine Learning as a Service' using System Features [148]. An additional, recent, example of a possible future application is in the construction of 'jailbreaking' prompts for the latest generation of large language models.…”

Section: Adversarial Machine Learningmentioning

confidence: 99%

Computable Analysis and Game Theory: From Foundations to Applications

Crook

View full text Add to dashboard Cite

This body of research showcases several facets of the intersection between computer science and game theory. On the foundational side, we explore the obstructions to the computability of Nash equilibria in the setting of computable analysis. In particular, we study the Weihrauch degree of the problem of ﬁnding a Nash equilibrium for a multiplayer game in normal form. We conclude that the Weihrauch degree Nash for multiplayer games lies between AoUC∗[0,1] and AoUC⋄[0,1] (Theorem 5.3). As a slight detour, we also explore the demarcation between computable and non-computable computational problems pertaining to the veriﬁcation of machine learning. We demonstrate that many veriﬁcation questions are computable without the need to specify a machine learning framework (Section 7.2). As well as looking into the theory of learners, robustness and sparisty of training data. On the application side, we study the use of Hypergames in Cybersecurity. We look into cybersecurity AND/OR attack graphs and how we could turn them into a hypergame (8.1). Hyper Nash equilibria is not an ideal solution for these games, however, we propose a regret-minimisation based solution concept. In Section 8.2, we survey the area of Hypergames and their connection to cybersecurity, showing that even if there is a small overlap, the reach is limited. We suggest new research directions such as adaptive games, generalisation and transferability (Section 8.3).

show abstract