Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Agent" wg kryterium: Temat


Wyświetlanie 1-12 z 12
Tytuł:
A belief revision approach for argumentation-based negotiation agents
Autorzy:
Pilotti, P.
Casali, A.
Chesñevar, C.
Powiązania:
https://bibliotekanauki.pl/articles/330448.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
argumentation based negotiation
collaborative agents
belief revision
multi-agent system
Opis:
Negotiation is an interaction that happens in multi-agent systems when agents have conflicting objectives and must look for an acceptable agreement. A typical negotiating situation involves two agents that cannot reach their goals by themselves because they do not have some resources they need or they do not know how to use them to reach their goals. Therefore, they must start a negotiation dialogue, taking also into account that they might have incomplete or wrong beliefs about the other agent’s goals and resources. This article presents a negotiating agent model based on argumentation, which is used by the agents to reason on how to exchange resources and knowledge in order to achieve their goals. Agents that negotiate have incomplete beliefs about the others, so that the exchange of arguments gives them information that makes it possible to update their beliefs. In order to formalize their proposals in a negotiation setting, the agents must be able to generate, select and evaluate arguments associated with such offers, updating their mental state accordingly. In our approach, we will focus on an argumentation-based negotiation model between two cooperative agents. The arguments generation and interpretation process is based on belief change operations (expansions, contractions and revisions), and the selection process is a based on a strategy. This approach is presented through a high-level algorithm implemented in logic programming. We show various theoretical properties associated with this approach, which have been formalized and proved using Coq, a formal proof management system. We also illustrate, through a case study, the applicability of our approach in order to solve a slightly modified version of the well-known home improvement agents problem. Moreover, we present various simulations that allow assessing the impact of belief revision on the negotiation process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 455-470
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Grounding and extracting modal responses in cognitive agents: 'AND' query and states of incomplete knowledge
Autorzy:
Katarzyniak, R. P.
Pieczyńska-Kuchtiak, A.
Powiązania:
https://bibliotekanauki.pl/articles/907407.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
cognitive agent
semantic communication
language grounding
czynnik poznawczy
komunikacja semantyczna
język programowania
Opis:
In this study an original way of modeling language grounding and generation for a simple set of language responses is presented. It is assumed that the language is used by a cognitive agent and consists of a few modal belief and possibility formulas that are used by this agent to communicate its opinions on the current state of an object. The cognitive agent is asked a simple AND query and the language is tailored to this situation. The agent's knowledge bases are characterized by certain incompleteness of information on the current state of objects. The language of the available responses is originally grounded in the agent's previous empirical experience. According to the assumptions of the cognitive linguistics and the phenomenology of knowledge, this experience is the basic source of meaning represented by the available formulas (responses). In the study the idea of an epistemic satisfaction relation is introduced that describes states of the agent's knowledge in which particular formulas are satisfied in the epistemic sense. Additionally, a formal description of the semantic power of formulas is presented. The concepts of the empirical satisfaction relation and the semantic power of formulas are used to define a model of particular language behavior that preserves the assumption of language grounding. Two examples of possible implementations are given. These implementations are basic ones and refer to statistical characteristics of the stored empirical experience of the cognitive agent.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 2; 249-263
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A multi-agent brokerage platform for media content recommendation
Autorzy:
Veloso, B.
Malheiro, B.
Burguillo, J. C.
Powiązania:
https://bibliotekanauki.pl/articles/330094.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
multi agent computing
brokerage platform
media content personalisation
recommendation
przetwarzanie wieloagentowe
platforma maklerska
Opis:
Near real time media content personalisation is nowadays a major challenge involving media content sources, distributors and viewers. This paper describes an approach to seamless recommendation, negotiation and transaction of personalised media content. It adopts an integrated view of the problem by proposing, on the business-to-business (B2B) side, a brokerage platform to negotiate the media items on behalf of the media content distributors and sources, providing viewers, on the business-to-consumer (B2C) side, with a personalised electronic programme guide (EPG) containing the set of recommended items after negotiation. In this setup, when a viewer connects, the distributor looks up and invites sources to negotiate the contents of the viewer personal EPG. The proposed multi-agent brokerage platform is structured in four layers, modelling the registration, service agreement, partner lookup, invitation as well as item recommendation, negotiation and transaction stages of the B2B processes. The recommendation service is a rule-based switch hybrid filter, including six collaborative and two content-based filters. The rule-based system selects, at runtime, the filter(s) to apply as well as the final set of recommendations to present. The filter selection is based on the data available, ranging from the history of items watched to the ratings and/or tags assigned to the items by the viewer. Additionally, this module implements (i) a novel item stereotype to represent newly arrived items, (ii) a standard user stereotype for new users, (iii) a novel passive user tag cloud stereotype for socially passive users, and (iv) a new content-based filter named the collinearity and proximity similarity (CPS). At the end of the paper, we present off-line results and a case study describing how the recommendation service works. The proposed system provides, to our knowledge, an excellent holistic solution to the problem of recommending multimedia contents.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 513-527
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Data intensive scientific analysis with grid computing
Autorzy:
Terzo, O.
Mossucca, L.
Cucca, M.
Notarpietro, R.
Powiązania:
https://bibliotekanauki.pl/articles/907793.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
przetwarzanie siatkowe
program szeregujący
e-nauka
grid computing
GPS radio occultation
scheduler
agent
e-science
Opis:
At the end of September 2009, a new Italian GPS receiver for radio occultation was launched from the Satish Dhawan Space Center (Sriharikota, India) on the Indian Remote Sensing OCEANSAT-2 satellite. The Italian Space Agency has established a set of Italian universities and research centers to implement the overall processing radio occultation chain. After a brief description of the adopted algorithms, which can be used to characterize the temperature, pressure and humidity, the contribution will focus on a method for automatic processing these data, based on the use of a distributed architecture. This paper aims at being a possible application of grid computing for scientific research.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 2; 219-228
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Emotion learning: solving a shortest path problem in an arbitrary deterministic environment in linear time with an emotional agent
Autorzy:
Petruseva, S.
Powiązania:
https://bibliotekanauki.pl/articles/907900.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
czynnik emocjonalny
złożoność
programowanie
sieć neuronowa
emotional agent
complexity
consequence programming
CAA neural network
planning
Opis:
The paper presents an algorithm which solves the shortest path problem in an arbitrary deterministic environment with n states with an emotional agent in linear time. The algorithm originates from an algorithm which in exponential time solves the same problem, and the agent architecture used for solving the problem is an NN-CAA architecture (neural network crossbar adaptive array). By implementing emotion learning, the linear time algorithm is obtained and the agent architecture is modified. The complexity of the algorithm without operations for initiation in general does not depend on the number of states n, but only on the length of the shortest path. Depending on the position of the goal state, the complexity can be at most O(n). It can be concluded that the choice of the function which evaluates the emotional state of the agent plays a decisive role in solving the problem efficiently. That function should give as detailed information as possible about the consequences of the agent’s actions, starting even from the initial state. In this way the function implements properties of human emotions.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 409-421
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On some properties of grounding nonuniform sets of modal conjunctions
Autorzy:
Katarzyniak, R. P.
Powiązania:
https://bibliotekanauki.pl/articles/908392.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
czynnik poznawczy
komunikacja semantyczna
koniunkcja
cognitive agent
semantic communication
language grounding
conjunction
modality
artificial cognition
Opis:
A language grounding problem is considered for nonuniform sets of modal conjunctions consisting of conjunctions extended with more than one modal operator of knowledge, belief or possibility. The grounding is considered in the context of semiotic triangles built from language symbols, communicative cognitive agents and external objects. The communicative cognitive agents are assumed to be able to observe external worlds and store the results of observations in internal knowledge bases. It is assumed that the only meaning accessible to these agents and assigned to modal conjunctions can be extracted from these internal knowledge bases. Commonsense requirements are discussed for the phenomenon of grounding nonuniform sets of modal conjunctions and confronted with an original idea of epistemic satisfaction relation used to define proper conditions for language grounding. Theorems are formulated and proved to show that the communicative cognitive agents based on the proposed model of grounding fulfill some commonsense requirements given for processing sets of nonuniform modal conjunctions. The main result is that the communicative cognitive agents considered can be constructed in a way that makes them rational and intentional as regards the processing of modal conjunctions and from the human point of view.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 3; 399-412
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
FSP and FLTL framework for specification and verification of middle-agents
Autorzy:
Bădică, A.
Bădică, C.
Powiązania:
https://bibliotekanauki.pl/articles/907813.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system wieloagentowy
algebra procesów
specyfikacja formalna
multi-agent system
interaction protocol
process algebra
formal specification
Opis:
Agents are a useful abstraction frequently employed as a basic building block in modeling service, information and resource sharing in global environments. The connecting of requester with provider agents requires the use of specialized agents known as middle-agents. In this paper, we propose a formal framework intended to precisely characterize types of middle-agents with a special focus on matchmakers, brokers and front-agents by formally modeling their interactions with requesters and providers. Our approach is based on capturing interaction protocols between requesters, providers and middle-agents as finite state processes represented using FSP process algebra. The resulting specifications are formally verifiable using FLTL temporal logic. The main results of this work include (i) precise specification of interaction protocols depending on the type of middle-agent (this can also be a basis for characterizing types of middle-agents), (ii) improvement of communication between designers and developers and facilitation of formal verification of agent systems, (iii) guided design and implementation of agent-based software systems that incorporate middle-agents.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 1; 9-25
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Uncertainty Models of Vision Sensors in Mobile Robot Positioning
Autorzy:
Skrzypczyński, P.
Powiązania:
https://bibliotekanauki.pl/articles/908490.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
robot mobilny
sensor wizyjny
system wieloagentowy
mobile robots
vision sensors
positioning
uncertainty
action planning
multi-agent systems
Opis:
This paper discusses how uncertainty models of vision-based positioning sensors can be used to support the planning and optimization of positioning actions for mobile robots. Two sensor types are considered: a global vision with overhead cameras, and an on-board camera observing artificial landmarks. The developed sensor models are applied to optimize robot positioning actions in a distributed system of mobile robots and monitoring sensors, and to plan the sequence of actions for a robot cooperating with the external infrastructure supporting its navigation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 1; 73-88
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
Autorzy:
Czarnowski, I.
Jędrzejowicz, P.
Powiązania:
https://bibliotekanauki.pl/articles/907819.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
redukcja danych
komputerowe uczenie się
optymalizacja
system wieloagentowy
data reduction
machine learning
A-Team
optimization
multi-agent system
Opis:
The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning process executed by a team of agents (A-Team). Several A-Team architectures with agents executing the simulated annealing and tabu search procedures are proposed and investigated. The paper includes a detailed description of the proposed approach and discusses the results of a validating experiment.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 1; 57-68
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A matrix inequality based design method for consensus problems in multi-agent systems
Autorzy:
Zhai, G.
Okuno, S.
Imae, J.
Kobayashi, T.
Powiązania:
https://bibliotekanauki.pl/articles/930012.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system wieloagentowy
konsensus
sterowanie zdecentralizowane
nierówność macierzy
LMI
multi-agent systems
consensus
decentralized control
graph Laplacian
matrix inequality
Opis:
In this paper, we study a consensus problem in multi-agent systems, where the entire system is decentralized in the sense that each agent can only obtain information (states or outputs) from its neighbor agents. The existing design methods found in the literature are mostly based on a graph Laplacian of the graph which describes the interconnection structure among the agents, and such methods cannot deal with complicated control specification. For this purpose, we propose to reduce the consensus problem at hand to the solving of a strict matrix inequality with respect to a Lyapunov matrix and a controller gain matrix, and we propose two algorithms for solving the matrix inequality. It turns out that this method includes the existing Laplacian based method as a special case and can deal with various additional control requirements such as the convergence rate and actuator constraints.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 4; 639-646
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Predictive control for trajectory tracking and decentralized navigation of multi-agent formations
Autorzy:
Prodan, I.
Olaru, S.
Stoica, C.
Niculescu, S. I.
Powiązania:
https://bibliotekanauki.pl/articles/330700.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
multi-agent system
linear system
model predictive control
potential function
polyhedral function
system wieloagentowy
system linearny
sterowanie predykcyjne
funkcja potencjału
Opis:
This paper addresses a predictive control strategy for a particular class of multi-agent formations with a time-varying topology. The goal is to guarantee tracking capabilities with respect to a reference trajectory which is pre-specified for an agent designed as the leader. Then, the remaining agents, designed as followers, track the position and orientation of the leader. In real-time, a predictive control strategy enhanced with the potential field methodology is used in order to derive a feedback control action based only on local information within the group of agents. The main concern is that the interconnections between the agents are time-varying, affecting the neighborhood around each agent. The proposed method exhibits effective performance validated through some illustrative examples.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 1; 91-102
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An agent-oriented hierarchic strategy for solving inverse problems
Autorzy:
Smołka, M.
Schaefer, R.
Paszyński, M.
Pardo, D.
Álvarez-Aramberri, J.
Powiązania:
https://bibliotekanauki.pl/articles/329764.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
inverse problem
hybrid optimization method
memetic algorithm
multi-agent system
magnetotelluric data inversion
zadanie odwrotne
optymalizacja hybrydowa
algorytm memetyczny
system wieloagentowy
Opis:
The paper discusses the complex, agent-oriented hierarchic memetic strategy (HMS) dedicated to solving inverse parametric problems. The strategy goes beyond the idea of two-phase global optimization algorithms. The global search performed by a tree of dependent demes is dynamically alternated with local, steepest descent searches. The strategy offers exceptionally low computational costs, mainly because the direct solver accuracy (performed by the hp-adaptive finite element method) is dynamically adjusted for each inverse search step. The computational cost is further decreased by the strategy employed for solution inter-processing and fitness deterioration. The HMS efficiency is compared with the results of a standard evolutionary technique, as well as with the multi-start strategy on benchmarks that exhibit typical inverse problems’ difficulties. Finally, an HMS application to a real-life engineering problem leading to the identification of oil deposits by inverting magnetotelluric measurements is presented. The HMS applicability to the inversion of magnetotelluric data is also mathematically verified.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 483-498
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-12 z 12

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies