1,721,083 research outputs found
iThink: A Library for Classical Planning in Video-Games
No full textAcademic artificial intelligence (AI) techniques have recently started to play a more central role in the development of commercial video games. In particular, classical planning methods for specifying a goal-oriented behavior have proven to be useful to game developers in an increasingly number of cases. Motivated by the fact that there is no clear standard for developing a goal-oriented behavior in video games, we present iThink, a framework that allows the use of academic techniques for classical planning in order to achieve goal-oriented behavior in a real game developing environment. In our work we focus on STRIPS, a well-studied framework for classical planning, and Unity3D, a popular game engine that is becoming an emerging standard for, so-called, “indie” game development. Except for being a useful tool for game developers, we believe that iThink can be used in education, providing a modern and fun environment for learning and experimenting with classical planning
A distributed implementation of the SWAN peer-to-peer look-up system using mobile agents
No full textWe present an agent-based implementation of the SWAN system. SWAN is a peer-to-peer look-up system that functions by letting the participating nodes self-organise in a virtual Small World Network. We have used DIET, a lightweight ecologically inspired multi-agent platform, to implement a test application of SWAN. We describe the implementation of the test application and present experiments in which the application runs on a cluster of computers. Our results show that the system is robust to failure and shows promising scalability
Flexible resource assignment in sensor networks: a hybrid reasoning approach
No full textToday, sensing resources3 are the most valuable assets of critical tasks (e.g., border monitoring). Although, there are various types of assets available, each with different capabilities, only a subset of these assets is useful for a specific task. This is due to the varying information needs of tasks. This gives rise to assigning useful assets to tasks such that the assets fully cover the information requirements of the individual tasks. The importance of this is amplified in the intelligence, surveillance, and reconnaissance (ISR) domain, especially in a coalition
context. This is due to a variety of reasons such as the dynamic nature of the environment, scarcity of assets, high demand placed on available assets, sharing of assets among coalition parties, and so on. A significant amount of research been done by different communities to efficiently assign assets to tasks and deliver information to the end user. However, there is little work done to infer sound alternative means to satisfy the information requirements of tasks so that the satisfiable tasks are increased. In this paper, we propose a hybrid reasoning approach (viz., a
combination of rule-based and ontology-based reasoning) based on current Semantic Web4 technologies to infer assets types that are necessary and sufficient to satisfy the requirements of tasks in a flexible manner
From local to global consistency in temporal constraint networks
No full textAbstractWe study the problem of global consistency for several classes of quantitative temporal constraints which include inequalities, inequations and disjunctions of inequations. In all cases that we consider we identify the level of local consistency that is necessary and sufficient for achieving global consistency and present an algorithm which achieves this level. As a byproduct of our analysis, we also develop an interesting minimal network algorithm
The complexity of query evaluation in indefinite temporal constraint databases
No full textAbstractIn previous work we have developed the scheme of indefinite L-constraint databases where L, the parameter, is a first-order constraint language. This scheme extends the constraint database proposal of Kanellakis et al. (1990, 1995) to include indefinite (or uncertain) information in the style of Imielinski and Lipski (1984). In this paper we study the complexity of query evaluation in an important instance of this abstract scheme: indefinite temporal constraint databases. Our results indicate that the data/combined complexity of query evaluation does not change when we move from queries in relational calculus over relational databases, to queries in relational calculus with temporal constraints over temporal constraint databases. This fact remains true even when we consider query evaluation in relational databases with indefinite information vs. query evaluation in indefinite temporal constraint databases. In the course of our work, we provide precise bounds on the complexity of decision/quantifier elimination for a subtheory of Presburger arithmetic and a subtheory of real addition with order. The bounds for the latter theory are original and of independent interest
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Engineering an agent-based peer-to-peer resource discovery system
No full textWe have designed an agent-based peer-to-peer resource discovery system, which combines a set of original features. We distinguish synchronous and asynchronous searches, and structure them in terms of speech acts in an agent communication language. We rely on a distributed reference counting counting mechanism to detect the termination of asynchronous distributed searches. Ontologies are used to define resource descriptors in an extensible and open manner, as well as queries over such resources. A graphical user interface dynamically constructed from available resource descriptors is proposed. The system has been fully implemented in SoFAR, the Southampton Framework for Agent Research
- …
