Zobrazeno 1 - 10 of 134 pro vyhledávání: '"François Schwarzentruber"'
1
Complexity of planning for connected agents in a partially known environment
Autor: Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Publikováno v: Theoretical Computer Science
Theoretical Computer Science, 2023, 941, pp.202-220. ⟨10.1016/j.tcs.2022.11.015⟩
International audience; The Connected Multi-Agent Path Finding (CMAPF) problem asks for a plan to move a group of agents in a graph while respecting a connectivity constraint. We study a generalization of CMAPF in which the graph is not entirely know
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b73de391da38f7d4c9dafd34dc5a828
https://hal.science/hal-03930625/file/main.pdf
Zobrazit plný text záznamu
4
On Verifying Expectations and Observations of Intelligent Agents
Autor: Sourav Chakraborty, Avijeet Ghosh, Sujata Ghosh, François Schwarzentruber
Publikováno v: Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}
Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}, Jul 2022, Vienna, Austria. pp.2568-2574, ⟨10.24963/ijcai.2022/356⟩
Public observation logic (POL) is a variant of dynamic epistemic logic to reason about agent expectations and agent observations. Agents have certain expectations, regarding the situation at hand, that are actuated by the relevant protocols, and they
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1d89f5ca04e02272a181a28959a6f83
https://cnrs.hal.science/hal-04047576
Zobrazit plný text záznamu
5
Akademický článek
A Modal Logic of Epistemic Games
Autor: François Schwarzentruber, Emiliano Lorini
Publikováno v: Games, Vol 1, Iss 4, Pp 478-526 (2010)
We propose some variants of a multi-modal of joint action, preference and knowledge that support reasoning about epistemic games in strategic form. The first part of the paper deals with games with complete information. We first provide syntactic pro
Externí odkaz: https://doaj.org/article/c1f91885638a48798dc27b558fb25bf0
Zobrazit plný text záznamu
6
Multi-Agent Belief Base Revision
Autor: François Schwarzentruber, Emiliano Lorini
Publikováno v: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence
Thirtieth International Joint Conference on Artificial Intelligence (IJCAI 2021)
Thirtieth International Joint Conference on Artificial Intelligence (IJCAI 2021), International Joint Conferences on Artificial Intelligence Organization, Aug 2021, Montreal, Canada. pp.1959-1965, ⟨10.24963/ijcai.2021/270⟩
Thirtieth International Joint Conference on Artificial Intelligence {IJCAI 2021}
Thirtieth International Joint Conference on Artificial Intelligence, Aug 2021, Montreal, Canada. pp.1959-1965, ⟨10.24963/ijcai.2021/270⟩
IJCAI
We present a generalization of belief base revision to the multi-agent case. In our approach agents have belief bases containing both propositional beliefs and higher-order beliefs about their own beliefs and other agents’ beliefs. Moreover, their
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c969315d445cc2e0b5868f7e82e84a0c
https://hal.science/hal-03453911/file/MASBelRevision.pdf
Zobrazit plný text záznamu
7
Copy and remove as dynamic operators
Autor: Hans van Ditmarsch, Carlos Areces, Bastien Maubert, Raul Fervari, François Schwarzentruber
Publikováno v: CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
In this article, we present a modal logic that extends the basic modal logic ML with two dynamic operators: copy (cp), which replicates the current model, labelling each copy with a different propositional symbol and respecting accessibility relation
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89e20df75801ca9569ede2a206825d63
https://www.tandfonline.com/doi/full/10.1080/11663081.2021.1964327
Zobrazit plný text záznamu
8
Connect Multi-Agent Path Finding: Generation and Visualization
Autor: François Schwarzentruber, Arthur Queffelec, Ocan Sankur
Publikováno v: IJCAI
We present a generic tool to visualize missions of the Connected Multi-Agent Path Finding (CMAPF) problem. This problem is a variant of MAPF which requires a group of agents to navigate from an initial configuration to a goal configuration while main
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::f25ed91beb5add4588e878da8466f7d6
https://doi.org/10.24963/ijcai.2021/714
Zobrazit plný text záznamu
9
How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements
Autor: Thomas Eiter, Aaron Hunter, François Schwarzentruber
Publikováno v: IJCAI
Consider a set of agents with initial beliefs and a formal operator for incorporating new information. Now suppose that, for each agent, we have a formula that we would like them to believe. Does there exist a single announcement that will lead all a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::870086d7d5fa79e2209d2fd3841b8be5
https://doi.org/10.24963/ijcai.2021/257
Zobrazit plný text záznamu
10
Planning for Connected Agents in a Partially Known Environment
Autor: François Schwarzentruber, Ocan Sankur, Arthur Queffelec
Publikováno v: AI 2021-34th Canadian Conference on Artificial Intelligence
AI 2021-34th Canadian Conference on Artificial Intelligence, May 2021, Vancouver / Virtual, Canada. pp.1-23
International audience; The Connected Multi-Agent Path Finding (CMAPF) problem asks for a plan to move a group of agents in a graph while respecting a connectivity constraint. We study a generalization of CMAPF in which the graph is not entirely know
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5565300c5bb642a86a910867a3cceb94
https://hal.archives-ouvertes.fr/hal-03205744/document
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje