• Aucun résultat trouvé

Multi-Agent Epistemic Planning

N/A
N/A
Protected

Academic year: 2022

Partager "Multi-Agent Epistemic Planning"

Copied!
1
0
0

Texte intégral

(1)

Multi-Agent Epistemic Planning

Enrico Pontelli

Dept. of Computer Science, New Mexico State University

epontell@cs.nmsu.edu

Abstract. In this talk, I will provide an introduction to the concepts underlying planning for multi-agent systems in presence of epistemic ac- tions. We will start with a brief overview of some of the logical foun- dations and then proceed with the analysis of a recent approach to the description of multi-agent epistemic planning problems (using the lan- guage mA*). We will explore the syntactic characterization of mA* and its semantics, based on update models. We will also discuss briefly two implementation schemes that have been developed to resolve concrete planning problems.

The talk is meant to be highly introductory and accessible to a broad audience, especially composed of students.

Références

Documents relatifs

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

Figure 2 (A) Distribution of AR value frequency for unstocked ( N populations = 42; white bars) and stocked (N populations = 30; dark gray bars) populations; triangles indicate

That the diffusion-controlled cathodic peak current is independent of the proton donor concentration at high buffer concentrations, but still proportional to v 1/2 , allows us to

Figure 6 shows that the propeller thrust and torque coefficients and propulsive performance remained approximately the same for 20° (Port) and –20° (Starboard) static azimuth

While dative bonded species were observed to form on isolated clean dimers, surprisingly pyridine did not react with single dangling bonds.. This observation illustrates the ability

Ecology modeling Role game design Playing role game Ecological dynamics model Social dynamics model Stakeholder behaviour modeling Simulating scenarios

The rest of the contribu- tion consists in using this well known consensus algorithm to reach an agreement on those additional dynamics, while apply- ing a standard model tracking

Using the separator algebra inside a paver will allow us to get an inner and an outer approximation of the solution set in a much simpler way than using any other interval approach..