Cooperative Decision Algorithm for Time Critical Assignment without Explicit Communication - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Cooperative Decision Algorithm for Time Critical Assignment without Explicit Communication

Résumé

Decentralized time critical assignment is popular in the domains of military and emergency response. Considering the large communication delay, unpredictable environment and constraints, to make a rational decision in time critical context toward their common goal, agents have to jointly allocate multiple tasks based on their current status. This process can be built as a Markov Decision Model when they can share their status freely. However, it is computationally infeasible when explicit communication becomes a severe bottleneck. In this paper, by modelling the decision process as a Partially Observable Markov Decision Process for each agent and building heuristic approaches to estimate the state and reduce the action space, we apply greedy policies in our heuristic algorithms to quickly respond to time critical requirement.
Fichier principal
Vignette du fichier
978-3-662-44980-6_22_Chapter.pdf (173.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01383333 , version 1 (18-10-2016)

Licence

Paternité

Identifiants

Citer

Yulin Zhang, Yang Xu, Haixiao Hu. Cooperative Decision Algorithm for Time Critical Assignment without Explicit Communication. 8th International Conference on Intelligent Information Processing (IIP), Oct 2014, Hangzhou, China. pp.197-206, ⟨10.1007/978-3-662-44980-6_22⟩. ⟨hal-01383333⟩
28 Consultations
44 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More