• Aucun résultat trouvé

[PDF] Top 20 A Certified Universal Gathering Algorithm for Oblivious Mobile Robots

Has 10000 "A Certified Universal Gathering Algorithm for Oblivious Mobile Robots" found on our website. Below are the top 20 most common "A Certified Universal Gathering Algorithm for Oblivious Mobile Robots".

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots

A Certified Universal Gathering Algorithm for Oblivious Mobile Robots

... of mobile robots [5, 9, 3, 2, 14, ...in a simpler setting where robots evolve in a discrete space where the number of possible positions is ...in a ring-shaped discrete space) is ... Voir le document complet

15

Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots

Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots

... correct a new protocol for oblivious mobile robot universal gathering ...The mobile robot gathering problem is a benchmarking problem in this context and can ... Voir le document complet

18

Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots

Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots

... (e.g. gathering), the algorithmic techniques that enable solving problems are substantially ...hand, robots evolving in continuous spaces may typically use fractional distance moves to another robot, or ... Voir le document complet

13

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

... suitable for our ...attempts for automatically proving impossibility results in robot networks properties are due to Devismes et ...of a 3 × 3 grid (and con- clude that no such algorithm ...k ... Voir le document complet

18

Remembering Without Memory: Tree Exploration by Asynchronous Oblivious Robots

Remembering Without Memory: Tree Exploration by Asynchronous Oblivious Robots

... Ω(n) robots are necessary; this holds even if the maximum degree is ...of a complexity ...) robots. The proof of the result is constructive. We design an algorithm that allows a team of ... Voir le document complet

22

Design of a triple singularity drive for mobile wheeled robots

Design of a triple singularity drive for mobile wheeled robots

... This section of the paper deals with the geometric kinematic modeling of a triple singularity drive mobile platform. This modeling is split into two parts: inverse kinematics, which[r] ... Voir le document complet

43

Gathering of Robots on Anonymous Grids without multiplicity detection

Gathering of Robots on Anonymous Grids without multiplicity detection

... and oblivious robots can move according to the so-called Look-Compute-Move cycles ...cycle, a robot takes a snapshot of the current global configuration (Look), then, based on the perceived ... Voir le document complet

13

Reactive Path Deformation for Nonholonomic Mobile Robots

Reactive Path Deformation for Nonholonomic Mobile Robots

... towing a trailer: a nonholonomic system of dimension 4 with 2 nonholonomic ...are a few ...wheeled mobile robots are ...in a near future with computer aided motion capabilities ... Voir le document complet

12

Efficient Path Planning for Nonholonomic Mobile Robots

Efficient Path Planning for Nonholonomic Mobile Robots

... reach a given configuration while avoiding some set of obstacles. For many applications, the ability of the robot to react quickly is crucial, and a strong emphasis must be placed on the efficiency ... Voir le document complet

6

A certified numerical algorithm for the topology of resultant and discriminant curves

A certified numerical algorithm for the topology of resultant and discriminant curves

... 0 for each variable {x i } 1≤i≤n<m , to transform it into a square system ( Dedieu ( 2006 )), but this introduces spurious ...of a non-regular solution, and use this information to create a ... Voir le document complet

27

Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots

Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots

... such a child exists, except for up to two robots that may move from one piece to ...exceptional robots are solitaires. The objective here is to have a unique heaviest piece with the ... Voir le document complet

16

Gathering of Six Robots on Anonymous Symmetric Rings

Gathering of Six Robots on Anonymous Symmetric Rings

... some robots are in different nodes from those previously perceived by r at time t because in the meantime they performed their Move ...Hence, robots may move based on significantly outdated ...that ... Voir le document complet

13

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots

... are gathering [12, 11] and exploration [7, 8]. For gathering, both breaking symmetry [12] and preserving symmetry are meaningful ...approaches. For exploration, the fact that robots ... Voir le document complet

30

Self-Stabilizing Scheduling Algorithm for Cooperating Robots

Self-Stabilizing Scheduling Algorithm for Cooperating Robots

... from a stable state, the action MISS will never ...stable. For n = 0, it is just the hypothesis of the ...at a robot waiting at a location at time ...at a robot moving to a ... Voir le document complet

8

A distributed multi-agent production planning and scheduling framework for mobile robots

A distributed multi-agent production planning and scheduling framework for mobile robots

... requested robots from the number N of available robots, and by increasing the current value of λ(k) if dev(k) is positive ...be a non-decreasing function of the excess (deficit); moreover, it is ... Voir le document complet

37

Certified Descent Algorithm for shape optimization driven by fully-computable a posteriori error estimators

Certified Descent Algorithm for shape optimization driven by fully-computable a posteriori error estimators

... is a circle of radius ρ ini = 2 and the associated computational mesh counting 472 triangles is displayed in figure ...domain for both solving the state problem and computing a descent direction may ... Voir le document complet

31

A fleet of autonomous and cooperative mobile robots

A fleet of autonomous and cooperative mobile robots

... Note that such an operation involves only commu- nication and computation and concerns future (near term) robot actions. It can run in parallel with the execution [r] ... Voir le document complet

7

PRS: a high level supervision and control language for autonomous mobile robots

PRS: a high level supervision and control language for autonomous mobile robots

... is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or ... Voir le document complet

8

Efficient and Precise Trajectory Planning for Nonholonomic Mobile Robots

Efficient and Precise Trajectory Planning for Nonholonomic Mobile Robots

... on a rotating turret and a set of three beacons that the Eurobot rules allow to place around the play ...with a certain degree of precision through, for example, the use of 3D cameras or ... Voir le document complet

252

Motion discontinuity-robust controller for steerable wheeled mobile robots

Motion discontinuity-robust controller for steerable wheeled mobile robots

... workspace for safety ...suited for steering coordination since the steer joint coordinates are computed from a unique ICR point (output of the controller), rather than from the robot 3D velocity ... Voir le document complet

112

Show all 10000 documents...