Skip to Main content Skip to Navigation
Conference papers

Cooperative Decision Algorithm for Time Critical Assignment without Explicit Communication

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01383333
Contributor : Hal Ifip <>
Submitted on : Tuesday, October 18, 2016 - 2:56:02 PM
Last modification on : Thursday, March 5, 2020 - 5:41:05 PM

File

978-3-662-44980-6_22_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

125

Files downloads

187