Publication

Hybrid Flock - Formation Control Algorithms

Publications associées (108)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Optimal Distribution of Active Modules in Modular Robots

Jamie Paik, Christoph Heinrich Belke, Meibao Yao

Reconfigurability in versatile systems of modular robots is achieved by appropriate actuation of their modular units. Optimized distribution of active modules in the modular architecture can significantly reduce cost and energy in the reconfiguration tasks ...

2018

Unsupervised Camera Localization in Crowded Spaces

Alexandre Massoud Alahi

Existing camera networks in public spaces such as train terminals or malls can help social robots to navigate crowded scenes. However, the localization of the cameras is required, i.e., the positions and poses of all cameras in a unique reference. In this ...

2017

This book is open access under a CC BY 4.0 license. This book bridges the gap between playing with robots in school and studying robotics at the upper undergraduate and graduate levels to prepare for careers in industry and research. Robotic algorithms are ...

Springer2017

, , ,

In the first part of this two-part paper we show that the branch-flow convexification of the OPF problem is not exact and that the ADMM-based decomposition of the OPF fails to converge in specific scenarios. Therefore, there is a need to develop algorithms ...

Elsevier2017

, , , ,

We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fashion and (ii) m items from the algorithm’s memory might be removed after th ...

2017

Drug Combination for Treatment of Proliferative Diseases

Paul Joseph Dyson, Hubert van den Bergh, Patrycja Nowak-Sliwinska

Angiogenesis inhibitory drug combination obtained according to a specific algorithm, preferably a FSC, in which an initial combination of drugs is iteratively adjusted. The drug combination according to the invention may advantageously comprise a RAPTA-C c ...

2017

Towards 3-D Distributed Odor Source Localization: An Extended Graph-Based Formation Control Algorithm for Plume Tracking

Alcherio Martinoli, Ali Marjovi, Jorge Miguel Dias Almeida Rodrigues Soares, Jonathan Giezendanner, Anil Augustin Kodiyan, António Pedro Rodrigues de Aguiar

The large number of potential applications for robotic odor source localization has motivated the development of a variety of plume tracking algorithms, the majority of which work in restricted two-dimensional scenarios. In this paper, we introduce a distr ...

IEEE2016

A Graph-Based Formation Algorithm for Odor Plume Tracing

Alcherio Martinoli, Jorge Miguel Dias Almeida Rodrigues Soares

Odor plume tracing is a challenging robotics application, made difficult by the combination of the patchy characteristics of odor distribution and the slow response of the available sensors. This work proposes a graph-based formation control algorithm to c ...

Springer Japan2016

A Graph-Based Formation Algorithm for Odor Plume Tracing

Alcherio Martinoli, Jorge Miguel Dias Almeida Rodrigues Soares

Springer Japan2016

Decentralized consensus optimization with asynchrony and delays

Ali H. Sayed, Kun Yuan, Tianyu Wu

We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network of agents, where the agents perform local computation and communicate with neighbors. We design the algorithm so that the agents can compute a ...

IEEE2016