379 research outputs found
Flexible Behavior for Worker Units in Real-Time Strategy Games Using STRIPS Planning
No full textIn this paper we investigate how STRIPS planning techniques can be used to enhance the behavior of worker units that are common in real-time strategy (RTS) video games. Worker units are typically instructed to carry out simple tasks such as moving to destinations or mining for a type of resource. In this work we investigate how this interaction can be extended by providing the human player with the capability of instructing the worker unit to achieve simple goals. We introduce the "Smart Workers" STRIPS planning domain, and generate a series of planning problems of increasing difficulty and size. We use these problem sets to evaluate the conditions under which this idea can be used in practice in a real video game. The evaluation is performed using a STRIPS planner that is implemented inside a commercial video game development framework. © 2014 Springer International Publishing
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
SemSorGrid4Env Architecture
No full textThis document specifies, designs, and validates the Semantic Sensor Grid Rapid Application Development for Environmental Management (SemSorGrid4Env) software architecture. The architecture enables the publication and querying of both stored (e.g. database) and streaming (e.g. sensor) data to support the rapid development of applications for environmental monitoring. Significant benefits are provided by the use of semantic technology for service discovery and data integration. The infrastructural backbone of the architecture is provided by four service-oriented services: Stored Data Service for the publication of databases, Streaming Data Service for the publication of sensor data, Registration and Discovery Service to enable resources to found, and Integration and Querying Service to enable multiple data sources to be accessed through a single model. These services will be supplemented with application domain specific services which may offer RESTful interfaces
Analysis of current middleware used in peer-to-peer and grid implementations for enhancement by catallactic mechanisms
No full textThis deliverable describes the work done in task 3.1, Middleware analysis: Analysis of current middleware used in peer-to-peer and grid implementations for enhancement by catallactic mechanisms from work package 3, Middleware Implementation. The document is divided in four parts: The introduction with application scenarios and middleware requirements, Catnets middleware architecture, evaluation of existing middleware toolkits, and conclusions. -- Die Arbeit definiert Anforderungen an Grid und Peer-to-Peer Middleware Architekturen und analysiert diese auf ihre Eignung für die prototypische Umsetzung der Katallaxie. Eine Middleware-Architektur für die Umsetzung der Katallaxie in Application Layer Netzwerken wird vorgestellt.Grid Computing
Querying Temporal Constraint Networks in PTIME
No full textWe start with the assumption that temporal knowledge usually captured by constraint networks can be represented and queried more effectively by using the scheme of indefinite constraint databases proposed by Koubarakis. Although query evaluation in this scheme is in general a hard computational problem, we demonstrate that there are several interesting cases where query evaluation can be done in PTIME. These tractability results are original and subsume previous results by van Beek, Brusoni, Console and Terenziani. Introduction When temporal constraint networks are used in applications, their nodes represent the times when certain facts are true, or when certain events take place, or when events start or end. By labeling nodes with appropriate natural language expressions (e.g., breakfast or walk) and arcs by temporal relations, temporal constraint networks can be queried in useful ways. For example the query "Is it possible (or certain) that event walk happened after event breakfast..
Proof-of-Concept Application - Annual Report Year 1
No full textIn this document the Cat-COVITE Application for use in the CATNETS Project is introduced and motivated. Furthermore an introduction to the catallactic middleware and Web Services Agreement (WS-Agreement) concepts is given as a basis for the future work. Requirements for the application of Cat-COVITE with in catallactic systems are analysed. Finally the integration of the Cat-COVITE application and the catallactic middleware is described. --Grid Computing
Combining tree kernels and tree representations to classify argumentative stances
No full textThis work investigates how the combination of different tree representations with different Tree Kernel functions influences the results of the classifications in two specific case studies. One case study is related to the classification of argumentative stances of support, the other one is related to the classification of stances of opposition. Results show that some Tree Kernels achieves not only higher results but also a higher level of generalization. Moreover, it seems that also the kind of tree representation influences the performances of classifiers. In this study, we thus explore this relation between tree representation and different Tree Kernels, considering also compositional trees
Access Methods and Query Processing Techniques
No full text@proceedings{DBLP:conf/chorochronos/2003,
editor = {Manolis Koubarakis and
Timos K. Sellis and
Andrew U. Frank and
St{'e}phane Grumbach and
Ralf Hartmut G{"u}ting and
Christian S. Jensen and
Nikos A. Lorentzos and
Yannis Manolopoulos and
Enrico Nardelli and
Barbara Pernici and
Hans-J{"o}rg Schek and
Michel Scholl and
Babis Theodoulidis and
Nectaria Tryfona},
title = {Spatio-Temporal Databases: The CHOROCHRONOS Approach},
booktitle = {Spatio-Temporal Databases: The CHOROCHRONOS Approach},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2520},
year = {2003},
isbn = {3-540-40552-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
No full textAbstractWe study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and disequations with at most one inequality per disjunction. This new class of constraints extends the class of generalized linear constraints originally studied by Lassez and McAloon. We show that deciding consistency of a set of constraints in this class can be done in polynomial time. We also present a variable elimination algorithm which is similar to Fourier's algorithm for linear inequalities. Finally, we use these results to provide new temporal reasoning algorithms for the Ord-Horn subclass of Allen's interval formalism. We also show that there is no low level of local consistency that can guarantee global consistency for the Ord-Horn subclass. This property distinguishes the Ord-Horn subclass from the pointizable subclass (for which strong 5-consistency is sufficient to guarantee global consistency), and the continuous endpoint subclass (for which strong 3-consistency is sufficient to guarantee global consistency)
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
- …
