11 research outputs found

    Node dynamics on graphs: dynamical heterogeneity in consensus, synchronisation and final value approximation for complex networks

    Get PDF
    Here we consider a range of Laplacian-based dynamics on graphs such as dynamical invariance and coarse-graining, and node-specific properties such as convergence, observability and consensus-value prediction. Firstly, using the intrinsic relationship between the external equitable partition (EEP) and the spectral properties of the graph Laplacian, we characterise convergence and observability properties of consensus dynamics on networks. In particular, we establish the relationship between the original consensus dynamics and the associated consensus of the quotient graph under varied initial conditions. We show that the EEP with respect to a node can reveal nodes in the graph with increased rate of asymptotic convergence to the consensus value as characterised by the second smallest eigenvalue of the quotient Laplacian. Secondly, we extend this characterisation of the relationship between the EEP and Laplacian based dynamics to study the synchronisation of coupled oscillator dynamics on networks. We show that the existence of a non-trivial EEP describes partial synchronisation dynamics for nodes within cells of the partition. Considering linearised stability analysis, the existence of a nontrivial EEP with respect to an individual node can imply an increased rate of asymptotic convergence to the synchronisation manifold, or a decreased rate of de-synchronisation, analogous to the linear consensus case. We show that high degree 'hub' nodes in large complex networks such as Erdős-Rényi, scale free and entangled graphs are more likely to exhibit such dynamical heterogeneity under both linear consensus and non-linear coupled oscillator dynamics. Finally, we consider a separate but related problem concerning the ability of a node to compute the final value for discrete consensus dynamics given only a finite number of its own state values. We develop an algorithm to compute an approximation to the consensus value by individual nodes that is ϵ close to the true consensus value, and show that in most cases this is possible for substantially less steps than required for true convergence of the system dynamics. Again considering a variety of complex networks we show that, on average, high degree nodes, and nodes belonging to graphs with fast asymptotic convergence, approximate the consensus value employing fewer steps.Open Acces

    Formulation of control strategies for requirement definition of multi-agent surveillance systems

    Get PDF
    In a multi-agent system (MAS), the overall performance is greatly influenced by both the design and the control of the agents. The physical design determines the agent capabilities, and the control strategies drive the agents to pursue their objectives using the available capabilities. The objective of this thesis is to incorporate control strategies in the early conceptual design of an MAS. As such, this thesis proposes a methodology that mainly explores the interdependency between the design variables of the agents and the control strategies used by the agents. The output of the proposed methodology, i.e. the interdependency between the design variables and the control strategies, can be utilized in the requirement analysis as well as in the later design stages to optimize the overall system through some higher fidelity analyses. In this thesis, the proposed methodology is applied to a persistent multi-UAV surveillance problem, whose objective is to increase the situational awareness of a base that receives some instantaneous monitoring information from a group of UAVs. Each UAV has a limited energy capacity and a limited communication range. Accordingly, the connectivity of the communication network becomes essential for the information flow from the UAVs to the base. In long-run missions, the UAVs need to return to the base for refueling with certain frequencies depending on their endurance. Whenever a UAV leaves the surveillance area, the remaining UAVs may need relocation to mitigate the impact of its absence. In the control part of this thesis, a set of energy-aware control strategies are developed for efficient multi-UAV surveillance operations. To this end, this thesis first proposes a decentralized strategy to recover the connectivity of the communication network. Second, it presents two return policies for UAVs to achieve energy-aware persistent surveillance. In the design part of this thesis, a design space exploration is performed to investigate the overall performance by varying a set of design variables and the candidate control strategies. Overall, it is shown that a control strategy used by an MAS affects the influence of the design variables on the mission performance. Furthermore, the proposed methodology identifies the preferable pairs of design variables and control strategies through low fidelity analysis in the early design stages.Ph.D

    Bridging distances in technology and regulation

    Get PDF

    Contraction analysis of switched systems with application to control and observer design

    Get PDF
    In many control problems, such as tracking and regulation, observer design, coordination and synchronization, it is more natural to describe the stability problem in terms of the asymptotic convergence of trajectories with respect to one another, a property known as incremental stability. Contraction analysis exploits the stability properties of the linearized dynamics to infer incremental stability properties of nonlinear systems. However, results available in the literature do not fully encompass the case of switched dynamical systems. To overcome these limitations, in this thesis we present a novel extension of contraction analysis to such systems based on matrix measures and differential Lyapunov functions. The analysis is conducted first regularizing the system, i.e. approximating it with a smooth dynamical system, and then applying standard contraction results. Based on our new conditions, we present design procedures to synthesize switching control inputs to incrementally stabilize a class of smooth nonlinear systems, and to design state observers for a large class of nonlinear switched systems including those exhibiting sliding motion. In addition, as further work, we present new conditions for the onset of synchronization and consensus patterns in complex networks. Specifically, we show that if network nodes exhibit some symmetry and if the network topology is properly balanced by an appropriate designed communication protocol, then symmetry of the nodes can be exploited to achieve a synchronization/consensus pattern

    “Be a Pattern for the World”: The Development of a Dark Patterns Detection Tool to Prevent Online User Loss

    Get PDF
    Dark Patterns are designed to trick users into sharing more information or spending more money than they had intended to do, by configuring online interactions to confuse or add pressure to the users. They are highly varied in their form, and are therefore difficult to classify and detect. Therefore, this research is designed to develop a framework for the automated detection of potential instances of web-based dark patterns, and from there to develop a software tool that will provide a highly useful defensive tool that helps detect and highlight these patterns

    Minding the Gap: Computing Ethics and the Political Economy of Big Tech

    Get PDF
    In 1988 Michael Mahoney wrote that “[w]hat is truly revolutionary about the computer will become clear only when computing acquires a proper history, one that ties it to other technologies and thus uncovers the precedents that make its innovations significant” (Mahoney, 1988). Today, over thirty years after this quote was written, we are living right in the middle of the information age and computing technology is constantly transforming modern living in revolutionary ways and in such a high degree that is giving rise to many ethical considerations, dilemmas, and social disruption. To explore the myriad of issues associated with the ethical challenges of computers using the lens of political economy it is important to explore the history and development of computer technology

    Technical Debt is an Ethical Issue

    Get PDF
    We introduce the problem of technical debt, with particular focus on critical infrastructure, and put forward our view that this is a digital ethics issue. We propose that the software engineering process must adapt its current notion of technical debt – focusing on technical costs – to include the potential cost to society if the technical debt is not addressed, and the cost of analysing, modelling and understanding this ethical debt. Finally, we provide an overview of the development of educational material – based on a collection of technical debt case studies - in order to teach about technical debt and its ethical implication

    Rethinking Curating in the Age of Artificial Intelligence

    Get PDF

    Proceedings of the ETHICOMP 2022: Effectiveness of ICT ethics - How do we help solve ethical problems in the field of ICT?

    Get PDF
    This Ethicomp is again organized in exceptional times. Two previous ones were forced to turn to online conferences because of Covid-pandemic but it was decided that this one would be the physical one or cancelled as the need for real encounters and discussion between people are essential part of doing philosophy. We need possibility to meet people face to face and even part of the presentation were held distance–because of insurmountable problems of arriving by some authors– we manage to have real, physical conference, even the number of participants was smaller than previous conferences.The need of Ethicomp is underlined by the way world nowadays is portrayed for us. The truthfulness and argumentation seem to be replaced by lies, strategic games, hate and disrespect of humanity in personal, societal and even global communication. EThicomp is many times referred as community and therefore it is important that we as community do protect what Ethicomp stands for. We need to seek for goodness and be able to give argumentation what that goodness is. This lead us towards Habermass communicative action and Discourse ethics which encourages open and respectful discourse between people (see eg.Habermass 1984;1987;1996). However, this does not mean that we need to accept everything and everybody. We need to defend truthfulness, equality and demand those from others too. There are situations when some people should be removed from discussions if they neglect the demand for discourse. Because by giving voice for claims that have no respect for argumentation, lacks the respect of human dignity or are not ready for mutual understanding (or at least aiming to see possibility for it) we cannot have meaningful communication. This is visible in communication of all levels today and it should not be accepted, but resisted. It is duty of us all.</p
    corecore