Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Abder Rezak Benaskeur"'
Publikováno v:
ICHMS
Although viewed as an enabler, the use of automation/autonomy for complex decision-making tasks, as in Command and Control (C2), is continuously debated. This paper explains the stakes and proposes a responsible and efficient human-autonomy teaming a
Publikováno v:
International Journal of Information Technology & Decision Making. 16:1465-1496
This paper is concerned with multi-criteria and dynamic resource allocation problem in a naval engagement context. The scenario under investigation considers air threats directed towards a ship that has to plan its engagement by efficiently allocatin
Publikováno v:
ACM Transactions on Intelligent Systems and Technology. 1:1-21
Forces involved in modern conflicts may be exposed to a variety of threats, including coordinated raids of advanced ballistic and cruise missiles. To respond to these, a defending force will rely on a set of combat resources. Determining an efficient
Publikováno v:
Aerospace Science and Technology. 11:327-338
The military typically operates in demanding, dynamic, semi-structured and large-scale environments. This reality makes it difficult to detect, track, recognize/classify, and response to all entities within the volume of interest, thus increasing the
Autor:
Abder Rezak Benaskeur, André Desbiens
Publikováno v:
International Journal of Control. 75:923-931
In this paper, an output feedback version of the modified error method is presented, for linear coupled plants. The novelty lies in the combination of a modified control function of Lyapunov with the observer backstepping technique to obtain a totall
Publikováno v:
AAMAS
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Q-decomposition approach is proposed when the resources which are already shared among
Publikováno v:
2007 Information, Decision and Control.
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-complete. To address this complex resource management problem, the merging of two approaches is made: The Q-decomposition model, which coordinates rewa
Publikováno v:
IAT
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which represents the problem by an acyclic graph, and solves each node in a c
Publikováno v:
Advances in Artificial Intelligence ISBN: 9783540220046
Canadian Conference on AI
Canadian Conference on AI
We are interested in contributing to solving effectively a particular type of real-time stochastic resource allocation problem. Firstly, one distinction is that certain tasks may create other tasks. Then, positive and negative interactions among the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec34b98a75efa35ede3739fc821e2a2b
https://doi.org/10.1007/11766247_5
https://doi.org/10.1007/11766247_5
Publikováno v:
IAT
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, the merging of two approaches is made: The Q-decomposition model, which coordinates rewa