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.
Since the 1960s, consensus problems have puzzled the minds of many researchers in fields ranging from computer science to information aggregation. In this work, although specifically addressing the rendezvous problem for a team of robots, we develop a methodology that can also be applied to other consensus problems, where optimality is important and where non-holonomicity characterizes the system at hand. In particular, we consider a group of differential-wheeled robots endowed with noisy relative positioning capabilities. We develop a distributed, real-time optimization method based on a receding horizon controller that minimizes a user-defined cost whilst guaranteeing the rendezvous. Finally, we perform experiments on real robots to confirm the validity of our approach.
Alcherio Martinoli, Wanting Jin