• Aucun résultat trouvé

M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement

N/A
N/A
Protected

Academic year: 2021

Partager "M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement"

Copied!
7
0
0

Texte intégral

(1)

HAL Id: hal-01979717

https://hal.laas.fr/hal-01979717

Submitted on 13 Jan 2019

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

M+: a scheme for multi-robot cooperation through

negotiated task allocation and achievement

Silvia .C. Botelho, Rachid Alami

To cite this version:

Silvia .C. Botelho, Rachid Alami. M+: a scheme for multi-robot cooperation through negotiated task allocation and achievement. IEEE International Conference on Robotics and Automation, May 1999, Detroit, United States. �hal-01979717�

(2)
(3)

Robot1 Robot2

Robot1 World State

State State

Global World Global World

T2 T3 T4 T1 A1 A2 A3 A4 T2 T3 T4 T1 A1 A3 A4 A2 State Robot2 World Mission

Robot 1 Robot 2 Robot n

Mission Layer

Action Layer Task Layer

others conflicts: Plan-Merging

M+ protocol M+ protocol Coordinated Task Distributed Task Cooperative Reaction to Contingencies (Re)Allocation Acheivement planner planner planner M+ protocol PRS PRS PRS

(4)
(5)

6 5 4 IDLE 7 8 EVAL 2 1 PLAN 3 BEST CANDIDATE CANDIDATE i R OFFER_HELP(Tk)(Rm)(Cmk)(Amk) NO_HELP(Tk)(Ri)(Ckj) OFFER_HELP(Tk)(Rj)(Cjk)(Ajk) Rm Ri REQUEST_HELP(Tk)(Ri) OK_HELP(Tk)(Ri)(Cjk) Ri all Ri Rm Ri Ri Rj Rj Rj Rm

(6)
(7)

1 3 9 4 0 5 2 7 8 cooperation reallocation 6 TASK 9 TASK 8 TASK 7 TASK 6 TASK 5 TASK 5 TASK 4 TASK 3 TASK 2 TASK 1 TASK 0

Références

Documents relatifs