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.
Designing effective behavioral controllers for mobile robots can be difficult and tedious; this process can be circumvented by using online learning techniques which allow robots to generate their own controllers online in an automated fash- ion. In multi- ...
Many maneuvers of Unmanned Aerial Vehicles (UAV) can be considered within a framework of trajectory following. Though this issue can differ from one application to another, they all share the same problem of finding an optimal path (or signal) to perform t ...
The results of a field experiment carried out to assess the accuracy and efficiency of a new in-vehicle navigation algorithm, whose aim is to incorporate and consider travel time reliability and route the guided vehicle along uncongested roads, in the abse ...
We report on real-robot odor source localization experiments carried out in an environment with obstacles in the odor plume. The robot was equipped with an ethanol sensor and a wind direction sensor, and the experiments were carried out in a wind tunnel, i ...
This chapter discusses decision making under uncertainty. More specifically, it offers an overview of efficient Bayesian and distribution-free algorithms for making near-optimal sequential decisions under uncertainty about the environment. Due to the uncer ...
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. All deterministic algorithms that solve consensus in this context are leader-based. However, in the context of Byzantine faults, leader-based algorithms are ...
This paper presents an efficient adaptive combination strategy for diffusion algorithms over adaptive networks in order to improve the robustness against the spatial variation of SNR over the network. The diffusion least-mean square (LMS) algorithm with th ...
We examine the ability of a swarm robotic system to transport cooperatively objects of different shapes and sizes. We simulate a group of autonomous mobile robots that can physically connect to each other and to the transported object. Controllers — artifi ...
We present an algorithm for nonlinear consensus in complex networks. Our motivation draws from analysis on the algorithm based on a weighted linear update protocol. Comparison of the asymptotic with early convergence rate encourages an alternative algorith ...
We introduce a novel bio-inspired odor source localization algorithm (surge- cast) for environments with a main wind flow and compare it to two well-known algorithms. With all three algorithms, systematic experiments with real robots are carried out in a wi ...