• Aucun résultat trouvé

Multi-Robot Navigation and Cooperative Mapping in a Circular Topology

N/A
N/A
Protected

Academic year: 2021

Partager "Multi-Robot Navigation and Cooperative Mapping in a Circular Topology"

Copied!
82
0
0

Texte intégral

Figure

Figure 1.1: Picture of the robot task realized during the project: A team of three robots cooperatively explores the environment around a scene containing a human person performing a certain activity.
Figure 2.2: The basic concept of a particle filter in a one-dimensional state space (x-coordinate): Particles are random samples drawn from the probability distribution
Figure 2.3: A simple resampling scheme: On top: particles with diameter proportional to their importance weights, below: particles with equal weights after resampling
Figure 2.5: A tree representing K = 8 landmarks within a single particle and its update after generating a new particle where the landmark with index k = 3 has been modified: Only a single Gaussian is changed, the new particle such receives only a partial
+7

Références

Documents relatifs

Our objectives were: first, to explore if interpersonal motor coordination impairments already shown during interactions with a human partner 20,21 also apply to interactions with

[r]

Vous pouvez aussi rejoindre l’un des nombreux GROUPES associés, ou le quitter si un ami vous y a inclus et qu’il ne vous convient pas (beaucoup l’ignorent, mais il est

When solving this monitoring problem, we apply a decoupling strategy to decompose the problem into two subproblems: one is to select suitable robots and quickly move

• We suggest a simulation framework in which path planning, path following, and collision avoidance collaborate to detect and resolve conflicts between their strategies (Section 5)..

All this is very classical and studied, but the fact that the robot must interact for a long time with the human introduces a new challenge: how a machine can be acceptable for

When the assignment and the routing problems are solved, the residual problem can be modelled as a two-stage hybrid flow shop with maximal time lags where the machine in

La dualité Tannakienne pour les réseaux Tannakiens donne une équivalence entre C(X/S) ◦ et la catégorie des représentations localement libres d’un schéma en groupes G(X/S) affine