Filters








57,537 Hits in 4.7 sec

Characterizing Successful Formulas: the Multi-agent Case [article]

Sanchit Saraf, Sumit Sourabh
2012 arXiv   pre-print
Recently, Holliday and ICard have given a complete characterization for the single agent case. However, the problem for the multi-agent case is open.  ...  Characterization of successful formulas in Public Announcement Logic (PAL) is a well known open problem in Dynamic Epistemic Logic.  ...  The full syntactic characterization of successful formulas in the multi-agent case is a difficult task and not a simple generalization of the single agent case.  ... 
arXiv:1209.0935v1 fatcat:dzgcfuvbq5f4zgdv742sbxubn4

The Agent Oriented Multi Flow Graphs Specification Model [chapter]

I. D.
2011 Multi-Agent Systems - Modeling, Interactions, Simulations and Case Studies  
and Case Studies ' ' means that the formula which follows is valid 2 '⊭' means that the formula which follows is not satisfiable www.intechopen.comThe Agent Oriented Multi Flow Graphs Specification  ...  Oriented Multi Flow Graphs Specification Model www.intechopen.comMulti-Agent Systems -Modeling, Interactions, Simulations and Case Studies Multi-Agent Systems -Modeling, Interactions, Simulations  ...  The Agent Oriented Multi Flow Graphs Specification Model, Multi-Agent Systems -Modeling, Interactions, Simulations and Case Studies, Dr.  ... 
doi:10.5772/15824 fatcat:jwjw742oxjgafowt47d5h5l5ui

A Multi-Agent based Multimodal System Adaptive to the User's Interaction Context [chapter]

Manolo Dulva, Chakib Tadj, Amar Ramdane-Cherif, Nicole Levy
2011 Multi-Agent Systems - Modeling, Interactions, Simulations and Case Studies  
Multi-Agent based Multimodal System Adaptive to the User's Interaction Context Multi-Agent Systems -Modeling, Interactions, Simulations and Case Studies  ...  The multi-agent system's architectural framework The structure presented above ( Fig. 1) is to be redrawn to make it a multi-agent system.  ... 
doi:10.5772/14692 fatcat:334rc3yiurelbpvz4gskz2necu

The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case

J. Lin, A. S. Morse, B. D. O. Anderson
2007 SIAM Journal of Control and Optimization  
The multi-agent rendezvous problem is to devise "local" control strategies, one for each agent, which without any active communication between agents cause all members of the group to eventually rendezvous  ...  This paper is concerned with the collective behavior of a group of n > 1 mobile autonomous agents, labelled 1 through n, which can all move in the plane.  ...  same time as components of one multi-agent rendezvous problem.  ... 
doi:10.1137/040620564 fatcat:qylgghhpkvfytiih7rmckbehda

The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case

J. Lin, A. S. Morse, B. D. O. Anderson
2007 SIAM Journal of Control and Optimization  
The multi-agent rendezvous problem is to devise "local" control strategies, one for each agent, which without any active communication between agents cause all members of the group to eventually rendezvous  ...  This paper is concerned with the collective behavior of a group of n > 1 mobile autonomous agents, labelled 1 through n, which can all move in the plane.  ...  In this paper we have reconsidered the multi-agent rendezvous problem originally posed in [1] and have described several alternate synchronous solutions.  ... 
doi:10.1137/040620552 fatcat:q2lwc3vgizbezom7ytc5pfplza

MULTI-AGENT ROBOT ARCHITECTURES: THE DECOMPOSITION ISSUE AND A CASE STUDY

ELPIDA S. TZAFESTAS, SPYROS N. RAPTIS, SPYROS G. TZAFESTAS
1998 International journal on artificial intelligence tools  
It is argued that the multi-agent approach provides the necessary flexibility and adaptivity for such architectures, and that the primary issue in designing a multi-agent robot architecture is the selection  ...  In this paper, some fundamental issues of modern multi-agent robot architectures are discussed.  ...  The output of every agent is then multiplied by a weight that characterizes its degree of relevance and is provided by the behavior coordinator.  ... 
doi:10.1142/s021821309800010x fatcat:kawf2ig4u5g3da6euf5nkf7utm

Multi-Agents Dynamic Case Based Reasoning and The Inverse Longest Common Sub-Sequence And Individualized Follow-up of Learners in The CEHL [article]

Abdelhamid Zouhair, El Mokhtar En-Naimi, Benaissa Amami, Hadhoum Boukachour, Patrick Person, Cyrille Bertelle
2012 arXiv   pre-print
Our work in this field develops the design and implementation of a Multi-Agents System Based on Dynamic Case Based Reasoning which can initiate learning and provide an individualized follow-up of learner  ...  The success of a case-based reasoning system depends critically on the performance of the retrieval step used and, more specifically, on similarity measure used to retrieve scenarios that are similar to  ...  Multi-Agent Case Based Reasoning Several architectures case-based reasoning has been applied in Multi-Agent Systems to solve some problems.  ... 
arXiv:1209.6395v1 fatcat:4kqxjksovncbrbqaclhsbfau3i

Encoding formulas as deep networks: Reinforcement learning for zero-shot execution of LTL formulas [article]

Yen-Ling Kuo, Boris Katz, Andrei Barbu
2020 arXiv   pre-print
In a Minecraft-like environment, the agent finds a sequence of actions that conform to the formula.  ...  This is a novel form of multi-task learning for RL agents where agents learn from one diverse set of tasks and generalize to a new set of diverse tasks.  ...  The second, Craft, is designed to stress the multi-task execution capabilities of RL agents in a robotic environment.  ... 
arXiv:2006.01110v2 fatcat:5oewaleiqzfubm2wuue6uagb4m

Strategic Planning through Model Checking of ATL Formulae [chapter]

Wojciech Jamroga
2004 Lecture Notes in Computer Science  
We point out that the algorithm generalizes minimaxing, and that ATL models generalize traditional game trees.  ...  The paper ends with suggestions about other game theory concepts that can be transfered to ATL-based planning.  ...  [5] in the scope of logics for multi-agent systems.  ... 
doi:10.1007/978-3-540-24844-6_136 fatcat:fc36lcm745geda5ana3k6kvbgu

Equivalence Between Time Consistency and Nested Formula [article]

Henri Gérard, Jean-Philippe Chancelier
2019 arXiv   pre-print
We review the literature and observe that the various definitions of TC (or of NF) are special cases of ours, as they always include additional assumptions.  ...  With very few assumptions, we are able to prove an equivalence between Time Consistency and a Nested Formula (NF) between the two mappings.  ...  The authors want to thank Université Paris-Est and Labex Bézout for the financial support. The first author particularly thanks them for the funding of his PhD program.  ... 
arXiv:1711.08633v2 fatcat:qckdk2z6lvcj7on6ttsppfbdki

Bioprospecting of microalgae: Proper extraction followed by high performance liquid chromatographic–high resolution mass spectrometric fingerprinting as key tools for successful metabolom characterization

Milena Stranska-Zachariasova, Petr Kastanek, Zbynek Dzuman, Josep Rubert, Michal Godula, Jana Hajslova
2016 Journal of chromatography. B  
Moreover, to demonstrate the potential of the UHPLC-HRMS/MS for the retrospective non-target screening and compounds identification, the collected mass spectra have been evaluated to characterize the pattern  ...  Attention was focused on medium-/non-polar extracts and characterization of lipid species present in the T. minutus algae.  ...  Acknowledgements The financial support of the Technology Agency of the Czech Republic (projects No TE01020080 Appendix A.  ... 
doi:10.1016/j.jchromb.2016.01.050 pmid:26894852 fatcat:i77o6iyvubgu3njm3ajbvy7btu

Equivalence between time consistency and nested formula

Henri Gérard, Michel De Lara, Jean-Philippe Chancelier
2019 Annals of Operations Research  
We review the literature and observe that the various definitions of TC (or of NF) are special cases of ours, as they always include additional assumptions.  ...  With very few assumptions, we are able to prove an equivalence between Time Consistency and a Nested Formula (NF) between the two mappings.  ...  The authors want to thank Université Paris-Est and Labex Bézout for the financial support. The first author particularly thanks them for the funding of his PhD program.  ... 
doi:10.1007/s10479-019-03276-1 fatcat:7rwz4srbwnevpb5yc6w67avgtq

General Formulas for Valuing Stocks and Bonds with Structural Changes

Du Du
2009 Social Science Research Network  
I investigate several applications which illustrate the power of the general formulas in terms of i) establishing the links among existing models in di¤erent areas; and ii) providing analytical solutions  ...  Exploiting the muti-regime version of Feyman-Kac theorem and making use of the multi-index notation, I ...nd compact closed form valuations for both stocks and default-free bonds with an arbitrary number  ...  The result thus follows. A.3. [0,1]-multi-index notation I use the multi-index notation to simplify formulas associated with ARS-II.  ... 
doi:10.2139/ssrn.1365744 fatcat:3nb4rafgdrh5bjv5srm5hjgaha

Strategic Reasoning: Building Cognitive Models from Logical Formulas

Sujata Ghosh, Ben Meijering, Rineke Verbrugge
2014 Journal of Logic, Language and Information  
The syntactic framework of the formal system provides a generic way of constructing computational cognitive models of the participants of the Marble Drop game.  ...  There have been extensive formal debates about the merits of the principle of backward induction among game theorists and logicians.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their insightful comments which helped in the discussions throughout this paper.  ... 
doi:10.1007/s10849-014-9196-x fatcat:6tdhfeuy4fdetd6tqroxzxbrnu

Certifying the LTL Formula p Until q in Hybrid Systems [article]

Hyejin Han, Mohamed Maghenem, Ricardo G. Sanfelice
2022 arXiv   pre-print
Roughly speaking, the formula p 𝒰 q is satisfied means that the solutions, initially satisfying proposition p, keep satisfying this proposition until proposition q is satisfied.  ...  In this paper, we propose sufficient conditions to guarantee that a linear temporal logic (LTL) formula of the form p Until q, denoted by p 𝒰 q, is satisfied for a hybrid system.  ...  Furthermore, in [6] , motion planning for multi-agent systems with safety is achieved by verifying corresponding LTL formulas in real time.  ... 
arXiv:2106.06455v4 fatcat:pvermprj6nh6zbfsjphdftjole
« Previous Showing results 1 — 15 out of 57,537 results