An evidential cooperative multi-agent system

Benouhiba, Toufik; Nigro, Jean-Marc

doi:10.1016/j.eswa.2005.07.008

Cited by 8 publications

(4 citation statements)

References 20 publications

(13 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If he used the strategy B ( Fig. 6(a)) the risk according to (22) is 0 = ρ for both positions, (2,3) or (4,3). A null risk means that from that moment the Apprentice knows precisely the task.…”

Section: Case Study On Building An Architecture Of Bricksmentioning

confidence: 99%

See 1 more Smart Citation

Cooperation in multiagent systems

Pozna

Kovács

Precup

et al. 2011

2011 IEEE 9th International Symposium on Intelligent Systems and Informatics

View full text Add to dashboard Cite

This paper gives aspects related to a cooperation scenario in the framework of multiagent systems. The presentation is focused on a multiagent system that consists of two agents, the Master and the Apprentice. The theoretical basis of the cooperation scenario is the definition of the most probable process, and two algorithms are used with this regard. The formulation of the cooperation scenario is exemplified for a case study that builds an architecture of successively placed bricks in the workspace.

show abstract

Section: Case Study On Building An Architecture Of Bricksmentioning

confidence: 99%

“…Fuzzy logic has been inserted in the cooperation scenarios of multiagent systems with attractive results presented in [4]- [9]. This paper presents details concerning a cooperation scenario for multiagent systems that is based on two algorithms for the probabilistic identification of a process when a state is observed.…”

Section: Introductionmentioning

confidence: 99%

Cooperation in multiagent systems

Pozna

Kovács

Precup

et al. 2011

2011 IEEE 9th International Symposium on Intelligent Systems and Informatics

View full text Add to dashboard Cite

show abstract

“…In this paper, it is proposed to model this fusion problem using the Transferable Belief Model (TBM) [25,22], a subjectivist and non-probabilistic interpretation of the Dempster-Shafer theory of belief function [18,21]. This framework is known to offer great flexibility for the manipulation of partial knowledge and information represented at various granularity levels (see, e.g., [19,12,1]), thus providing a range of tools well suited to the application at hand. This article is organized as follows.…”

mentioning

confidence: 99%

“…inv(1) s The bba m representing the piece of information provided by the PAR is thus given by:m({T 1 S 1 }) =n that the same PAR provides an output o = T 1 , which belongs to level 2 and category town denoted t. We have n…”

mentioning

confidence: 99%

Decision fusion for postal address recognition using belief functions

Mercier

Cron²,

Denux³

et al. 2009

Expert Systems with Applications

View full text Add to dashboard Cite

Combining the outputs from several postal address readers (PARs) is a promising approach for improving the performances of mailing address recognition systems. In this paper, this problem is solved using the Transferable Belief Model, an uncertain reasoning framework based on Dempster-Shafer belief functions. Applying this framework to postal address recognition implies defining the frame of discernment (or set of possible answers to the problem under study), converting PAR outputs into belief functions (taking into account additional information such as confidence scores when available), combining the resulting belief functions, and making decisions. All these steps are detailed in this paper. Experimental results demonstrate the effectiveness of this approach as compared to simple combination rules.

show abstract