Sliding mode control for coordination in multi-agent systems with directed communication graphs
Publications associées (77)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In this paper an algorithm for nonlinear explicit model predictive control is introduced based on multiresolution function approximation that returns a low complexity approximate receding horizon control law built on a hierarchy of second order interpolets ...
In this paper we address the problem of driving a group of agents towards a consensus point when agents have a discrete-time integrator dynamics and the communication graph is time-varying. We propose two decentralized Model Predictive Control (MPC) scheme ...
We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving goo ...
In this paper we propose an application of distributed model predictive control techniques to the problem of driving a group of autonomous agents towards a consensus point, i.e. a negotiated position in their state space. Agents are assumed to be governed ...
Practical large-scale nonlinear control systems require an intensive and time-consuming effort for the fine-tuning of their control parameters in order to achieve a satisfactory performance. In most cases, the fine-tuning process may take years and is perf ...
Institute of Electrical and Electronics Engineers2007
We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving goo ...
The main goal in network information theory is to identify fundamental limits of communication over networks, and design solutions which perform close to such limits. After several decades of effort, many important problems still do not have a characteriza ...
The problem of swinging up an inverted pendulum on a cart and controlling it around the upright position has traditionally been treated as two separate problems. This paper proposes a control strategy that is globally asymptotically stable under actuator s ...
We explore the border between decidability and undecidability of verification problems related to message passing systems that admit unbounded creation of threads and name mobility. Inspired by use cases in real-life programs we introduce the notion of dep ...
We propose a new fluid control technique that uses scale-dependent force control to preserve small-scale fluid detail. Control particles define local force fields and can be generated automatically from either a physical simulation or a sequence of target ...
