Analogues to much of today's work in ontologies have existed for centuries in text retrieval. The use of controlled vocabularies, or thesauri, has been fundamental to document indexing in library science. Thesauri serve several purposes, including:

[bull ] Knowledge organisation A thesaurus provides a hierarchy of concepts that organises domain-specific knowledge.

[bull ] Terminology normalisation By selecting a unique word or phrase to represent each domain concept, then linking synonymous terms to it, a thesaurus enforces terminological consistency.

[bull ] Query expansion A thesaurus facilitates the addition of terms to a query by providing explicit hierarchical and lateral relationships among terms.

These properties serve to mediate the information flow from indexer to user. Thesauri thus serve many of the same functions for people that ontologies are designed to serve for software agents. As automated retrieval has developed over the decades since the inception of computer processing of text, many techniques have been introduced to apply this typically manual work to the automated arena (see Soergel (1985) for an introduction to library information systems, also Anderson and Pélrez-Carballo (2001a, 2001b) for a summary of the intersection of human and machine indexing).

Biometric user authentication in large-scale distributed systems involves passive scanners and networked workstations and databases for user data acquisition, processing, and encryption. Unfortunately, traditional biometric authentication systems are prone to several attacks, such as Replay Attacks, Communication Attacks, and Database Attacks. Embedded biometric sensors overcome security limits of conventional software recognition systems, hiding its common attack points. The availability of mature reconfigurable hardware technology, such as field-programmable gate arrays, allows the developers to design and prototype the whole embedded biometric sensors. In this work, two strong and invasive biometric traits, such as fingerprint and iris, have been considered, analyzed, and combined in unimodal and multimodal biometric sensors. Biometric sensor performance has been evaluated using the well-known FVC2002, CASIA, and BATH databases.

In order to be able to specify and design ubiquitous applications, it is necessary to rely on a precise and formal representation of context. Aiming at reducing the gap between the formal specification and the design of a concrete ubiquitous application, we have proposed an approach to specify a context-aware system at three levels of abstraction. This specification uses the Algebra of Contextualized Ontologies, which is based on Category Theory and takes contextualization as a basic notion, proposing a small set of simple and powerful operations to compose and decompose contextualized ontologies. In this paper, we present a revised version of the algebra and algorithms to compute the algebraic operations. We exemplify our approach along with a concrete ubiquitous computing scenario. Moreover, by taking advantage of Category Theory foundations, we show that it is possible to derive the algorithms for each algebraic operation from simple modifications of a single basic algorithm.

Both the advent of large communication networks and the development of agent models designing more and more sophisticated (in some cases autonomous) behaviours, are producing what can be called an Agent Society. Agent societies are constituted by both artificial and human agents (in perspective indistinguishable from each other) communicating with each other (not necessarily each with all the others), with individual or collective tasks, different resources, different skills, and so on. In other words, these agent societies will become more and more similar to the human ones. As in real societies, in these virtual societies it will be necessary to consider all the problems connected with secure and reliable interaction, with trusting the other agents, with the possibility to be frauded, cheated, deceived in some exchange or relationship.

This paper addresses the problem of implementing a Simultaneous Localization and Mapping (SLAM) algorithm combined with a non-reactive controller (such as trajectory following or path following). A general study showing the advantages of using predictors to avoid mapping inconsistences in autonomous SLAM architectures is presented. In addition, this paper presents a priority-based uncertainty map construction method of the environment by a mobile robot when executing a SLAM algorithm. The SLAM algorithm is implemented with an extended Kalman filter (EKF) and extracts corners (convex and concave) and lines (associated with walls) from the surrounding environment. A navigation approach directs the robot motion to the regions of the environment with the higher uncertainty and the higher priority. The uncertainty of a region is specified by a probability characterization computed at the corresponding representative points. These points are obtained by a Monte Carlo experiment and their probability is estimated by the sum of Gaussians method, avoiding the time-consuming map-gridding procedure. The priority is determined by the frame in which the uncertainty region was detected (either local or global to the vehicle's pose). The mobile robot has a non-reactive trajectory following controller implemented on it to drive the vehicle to the uncertainty points. SLAM real-time experiments in real environment, navigation examples, uncertainty maps constructions along with algorithm strategies and architectures are also included in this work.

Loyalty cards programs have been used by retailers to increase customer retention. Loyality cards provide means to identify a particular customer and to collect customer-specific data, thus enabling individualized marketing; however, operating a loyalty program is complicated for retailers since they require to manage balances, collections, and transfers of customers. This is exactly the same problem the retailers were facing before credit cards were readily available. A new problem is that customers now have too many cards, customers may forget, or even deliberately decide to carry only a selection of their cards. This paper proposes a loyalty program based on a blockchain that does not require a physical card for identifying customers as it associates customers to their phone numbers, since nowadays people always carry their phone. In this perspective, companies can reduce overhead costs associated to managing the loyalty program. This paper reviews the technology required and describes the implementation of a loyalty program based on blockchains. Finally, it also enumerates the reasons for choosing the blockchain technology for this application.

Blockchain technology has rapidly emerged as a decentralized trusted network to replace the traditional centralized intermediator. Especially, the smart contracts that are based on blockchain allow users to define the agreed behaviour among them, the execution of which will be enforced by the smart contracts. Based on this, we propose a decentralized booking system that uses the blockchain as the intermediator between hoteliers and travellers. The system enjoys the trustworthiness of blockchain, improves efficiency and reduces the cost of the traditional booking agencies. The design of the system has been formally modelled using the CSP# language and verified using the model checker Process Analysis Toolkit. We have implemented a prototype decentralized booking system based on the Ethereum ecosystem.

The problem of traffic congestion incurs numerous social and economical repercussions and has thus become a central issue in every major city in the world. For this work we look at the transportation domain from a multiagent system perspective, where every driver can be seen as an autonomous decision-making agent. We explore how learning approaches can help achieve an efficient outcome, even when agents interact in a competitive environment for sharing common resources. To this end, we consider the route choice problem, where self-interested drivers need to independently learn which routes minimise their expected travel costs. Such a selfish behaviour results in the so-called user equilibrium, which is inefficient from the system’s perspective. In order to mitigate the impact of selfishness, we present Toll-based Q-learning (TQ-learning, for short). TQ-learning employs the idea of marginal-cost tolling (MCT), where each driver is charged according to the cost it imposes on others. The use of MCT leads agents to behave in a socially desirable way such that the is attainable. In contrast to previous works, however, our tolling scheme is distributed (i.e., each agent can compute its own toll), is charged a posteriori (i.e., at the end of each trip), and is fairer (i.e., agents pay exactly their marginal costs). Additionally, we provide a general formulation of the toll values for univariate, homogeneous polynomial cost functions. We present a theoretical analysis of TQ-learning, proving that it converges to a system-efficient equilibrium (i.e., an equilibrium aligned to the system optimum) in the limit. Furthermore, we perform an extensive empirical evaluation on realistic road networks to support our theoretical findings, showing that TQ-learning indeed converges to the optimum, which translates into a reduction of the congestion levels by 9.1%, on average.

This paper presents a parameterized gait generator based on linear inverted pendulum model (LIPM) theory, which allows users to generate a natural gait pattern with desired step sizes. Five types of zero moment point (ZMP) components are proposed for formulating a natural ZMP reference, where ZMP moves continuously during single support phases instead of staying at a fixed point in the sagittal and lateral plane. The corresponding center of mass (CoM) trajectories for these components are derived by LIPM theory. To generate a parameterized gait pattern with user-defined parameters, a gait planning algorithm is proposed, which determines related coefficients and boundary conditions of the CoM trajectory for each step. The proposed parameterized gait generator also provides a concept for users to generate gait patterns with self-defined ZMP references by using different components. Finally, the feasibility of the proposed method is validated by the experimental results with a teen-sized humanoid robot, David, which won first place in the sprint event at the 20th Federation of International Robot-soccer Association (FIRA) RoboWorld Cup.

Ambient intelligence (AmI) proposes pervasive information systems composed of autonomous agents embedded within the environment who, in orchestration, complement human activity in an intelligent manner. As such, it is an interesting and challenging application area for many computer science fields and approaches. A critical issue in such application scenarios is that the agents must be able to acquire, exchange, and evaluate knowledge about the environment, its users, and their activities. Knowledge populated between the agents in such systems may be contextually dependent, ambiguous, and incomplete. Conflicts may thus naturally arise, that need to be dealt with by the agents in an autonomous way. In this survey, we relate AmI to the area of knowledge representation and reasoning (KR), where conflict resolution has been studied for a long time. We take a look at a number of KR approaches that may be applied: context modelling, multi-context systems, belief revision, ontology evolution and debugging, argumentation, preferences, and paraconsistent reasoning. Our main goal is to describe the state of the art in these fields, and to draw attention of researchers to important theoretical issues and practical challenges that still need to be resolved, in order to reuse the results from KR in AmI systems or similar complex and demanding applications.

This paper presents an overview on the role of agents in the Semantic Web, which was the topic of the AgentLink Technical Forum Group on ‘Semantic Web Agents’, aimed at fostering closer collaboration between the European communities working in these areas. The paper is structured in three main sections. In the first, we argue how agents are an essential component of the Semantic Web, then we provide a brief history, by no means comprehensive, of how the Semantic Web vision—that includes agents—has evolved over the past fifteen years. We then conclude, reporting on the topics presented and discussed during the Technical Forum.

We investigate artificial intelligence and machine learning methods for optimizing the adversarial behavior of agents in cybersecurity simulations. Our cybersecurity simulations integrate the modeling of agents launching Advanced Persistent Threats (APTs) with the modeling of agents using detection and mitigation mechanisms against APTs. This simulates the phenomenon of how attacks and defenses coevolve. The simulations and machine learning are used to search for optimal agent behaviors. The central question is: under what circumstances, is one training method more advantageous than another? We adapt and compare a variety of deep reinforcement learning (DRL), evolutionary strategies (ES) and Monte Carlo Tree Search methods within Connect 4, a baseline game environment, and on both a simulation supporting a simple APT threat model, SNAPT, as well as CyberBattleSim, an open-source cybersecurity simulation. Our results show that when attackers are trained by DRL and ES algorithms, as well as when they are trained with both algorithms being used in alternation, they are able to effectively choose complex exploits that thwart a defense. The algorithm that combines DRL and ES achieves the best comparative performance when attackers and defenders are simultaneously trained, rather than when each is trained against its non-learning counterpart.

Mechanical engineering design is a broad subject area covering many topics and bas influences upon many other engineering disciplines and activities. Computer support for mechanical engineering design activity has been in draughting Systems and analysis packages, but there has been little in conceptual design assistance. This paper presents a number of areas of work in which AI techniques and developments are being used, sometimes in conjunction with traditional methods, to improve the support of design. The approaches to design and design Systems are covered, along with some techniques that are used. Specifie design Systems illustrate progress, and integration issues and simultaneous engineering Systems indicate the way research is moving. Finally, discussion of the trends and future topics indicates where and how effort may be applied in the future.

This paper explores the implications of research results in behavioural decision theory on knowledge engineering. Behavioural decision theory, with its performance (versus process) orientation, can tell us a great deal about the validity of human expert knowledge, and when it should be modelled. A brief history of behavioural decision theory is provided. Implications for knowledge elicitation and representation are discussed. An approach to knowledge engineering is proposed that takes into account these implications.

Expert critiquing systems present an interesting and important complement to conventional expert systems. The basic idea is to emphasize the support for the user's own decision making rather than to let the system independently suggest a solution to a given problem. Thus it is assumed that the user initially proposes a decision or course of action. The system then reviews this suggestion relative to known circumstance, tries to evaluate the proposed solution, provides suggestions for improvements, draws attention to possible risks, indicates alternatives, and evaluates their merits, etc. A critiquing system is characterized both by its approach to problem solving and by its style of interaction with the user, as will be detailed below.

The concept of holonic systems has its roots in the desire to understand the structure of natural systems (e.g. living organisms and social organisations) and in particular their ability to behave in a stable yet flexible manner in the face of change. It is not surprising that the lessons learned from these natural systems could help with the design and control of complex man-made systems. However, a key issue is, how can one translate holonic concepts to real industrial environments? For example, one of the key holonic concepts, the holon, can be described as a self-contained autonomous and cooperative entity; when deciding how to implement holons, software agents appear to be the logical choice. In this paper, we summarise the presentations and discussions from a workshop held at the recent International Conference on Autonomous Agents that focused on this issue and brought together researchers from both the holonic systems and the multi-agents systems communities.

Recent progress in reinforcement learning (RL) using self-play has shown remarkable performance with several board games (e.g., Chess and Go) and video games (e.g., Atari games and Dota2). It is plausible to hypothesize that RL, starting from zero knowledge, might be able to gradually approach a winning strategy after a certain amount of training. In this paper, we explore neural Monte Carlo Tree Search (neural MCTS), an RL algorithm that has been applied successfully by DeepMind to play Go and Chess at a superhuman level. We try to leverage the computational power of neural MCTS to solve a class of combinatorial optimization problems. Following the idea of Hintikka’s Game-Theoretical Semantics, we propose the Zermelo Gamification to transform specific combinatorial optimization problems into Zermelo games whose winning strategies correspond to the solutions of the original optimization problems. A specially designed neural MCTS algorithm is then introduced to train Zermelo game agents. We use a prototype problem for which the ground-truth policy is efficiently computable to demonstrate that neural MCTS is promising.

Traditional approaches to plan representation have focused on the generation of a sequence of actions and orderings. Knowledge rich models, which incorporate plan rationale, provide benefits to the planning process in a number of ways. The use of rationale in planning is reviewed in terms of causality, dependencies, and decisions. Each dimension addresses practical issues in the planning process, and adds value to the resultant plan. The contribution of this paper is to explore this categorisation, and to motivate the need to explicitly record and represent rationale knowledge for situated, mixed-initiative planning systems.

Automated modelling is a young research field and is attracting increasingly more attention. It is a cross-disciplinary field involving simulation, modelling, qualitative reasoning, bond graphs and systems dynamics. It is an investigation of the modelling process with the purpose of developing computer tools which will automatically follow modelling principles. In addition, these tools will take into account the details of an application and generate the most appropriate model for the application. Its objective is to develop computer modelling tools which will have perception of model correctness, completeness and appropriateness and can perform modelling automatically. One way to achieve this objective is to introduce well-defined models and automate the process of assembling submodels into models to create well-defined models. This paper reviews the motivation and background behind this new field, its theory and current state of the art, compares existing approaches and discusses the underlying issues. It is hoped that more researchers will become aware of this field and be encouraged to work in it.

The scope of the Technical Forum Group (TFG) on Agents in Bioinformatics (BIOAGENTS) was to inspire collaboration between the agent and bioinformatics communities with the aim of creating an opportunity to propose a different (agent-based) approach to the development of computational frameworks both for data analysis in bioinformatics and for system modelling in computational biology. During the day, the participants examined the future of research on agents in bioinformatics primarily through 12 invited talks selected to cover the most relevant topics. From the discussions, it became clear that there are many perspectives to the field, ranging from bio-conceptual languages for agent-based simulation, to the definition of bio-ontology-based declarative languages for use by information agents, and to the use of Grid agents, each of which requires further exploration. The interactions between participants encouraged the development of applications that describe a way of creating agent-based simulation models of biological systems, starting from an hypothesis and inferring new knowledge (or relations) by mining and analysing the huge amount of public biological data. In this report we summarize and reflect on the presentations and discussions.