Search results for "ComputingMethodologies_ARTIFICIALINTELLIGENCE"
showing 10 items of 46 documents
Experiments on Concurrent Artificial Environment
2001
We show how the simulation of concurrent system is of interest for both behavioral studies and strategies of learning applied on prey-predator problems. In our case learning studies into unknown environment have been applied to mobile units by using genetic algorithms (GA). A set of trajectories, generated by GA, are able to build a description of the external scene driving a predators to a prey. Here, an example of prey-predator strategy,based on field of forces, is proposed. The evolution of the corespondent system can be formalized as an optimization problem and, for that purpose, GA can be use to give the right solution at this problem. This approach could be applied to the autonomous r…
Facilitation of Developmental Tasks in Prisons: Applying the Method of Human-Centred Co-evaluation
2021
AbstractCollaboration and learning are especially needed in times of change in the workplace. This chapter describes a novel method for developing work practices and enhancing professionals’ proactiveness through collective, participatory experimentation and evaluation. We used the method in a low-security closed prison in Finland to advance prison staff’s rehabilitation work with prisoners. The design, implementation and evaluation of the innovations prison officers introduced to advance their work (recording the inmates’ behaviour and needs into their sentence plans) are illustrated. Besides describing how the method was applied in practice, we also identify and discuss the gaps within pr…
Chaotic multiagent system approach for MRF-based image segmentation
2005
In this paper, we propose a new chaotic approach for image segmentation based on multiagent system (MAS). We consider a set of segmentation agents organized around a coordinator agent. Each segmentation agent performs iterated conditional modes (ICM) starting from its own initial image created using a chaotic mapping. The coordinator agent diversifies the initial images using a crossover and a chaotic mutation operators. The efficiency of our chaotic MAS approach is shown through some experimental results.
An Observation Framework for Multi-agent Systems
2009
Existing middleware platforms for multi-agent systems (MAS) do not provide general support for observation. On the other hand, observation is considered to be an important mechanism needed for realizing effective and efficient coordination of agents. This paper describes a framework called Agent Observable Environment (AOE) for observation-based interaction in MAS. The framework provides 1) possibility to model MAS components with RDF-based observable soft-bodies, 2) support for both query and publish/subscribe style ontology-driven observation, and 3) ability to restrict the visibility of observable information using observation rules. Additionally, we report on an implementation of the fr…
Multi-Platform Agent Systems with Dynamic Reputation Policy Management
2011
Open, distributed multi-platform agent systems require new management approaches for resources and data secure access. In this paper a Jade-S based multi-platform agent system implementing dynamic reputation policy management is proposed. The implemented extension deals with biometrics, X-Security, DES cryptography and agent reputation. With more details, the proposed reputation management system helps to assess the agent's behavior and reliability, in order to select trusted agents. This is made possible by the knowledge that agents are able to acquire, over time, and that allows them to choose the best solution using own intelligence in total autonomy.
Evaluation of changes in space control due to passing behavior in elite soccer using Voronoi-cells
2015
A soccer player’s ability to make an “effective” pass in a play situation is considered one of the key skills characterizing successful performance in elite soccer.
A grid ant colony algorithm for the orienteering problem
2005
In this paper we propose a distributed ant colony algorithm to solve large scale orienteering problem instances. Our approach is based on a multi-colony strategy where each colony works in an independent portion (cluster) in the original graph. This results in no need for communicating pheromones information among colonies and in increasing speedup. We have implemented our algorithm as a .NET Web services infrastructure following a grid computing philosophy and we provide some promising experimental results to show the feasibility and effectiveness of our approach
Representations for evolutionary algorithms
2015
Successful and efficient use of evolutionary algorithms (EA) depends on the choice of the genotype, the problem representation (mapping from genotype to phenotype) and on the choice of search operators that are applied to the genotypes. These choices cannot be made independently of each other. The question whether a certain representation leads to better performing EAs than an alternative representation can only be answered when the operators applied are taken into consideration. The reverse is also true: deciding between alternative operators is only meaningful for a given representation. In EA practice one can distinguish two complementary approaches. The first approach uses indirect repr…
High Locality Representations for Automated Programming
2011
We study the locality of the genotype-phenotype mapping used in grammatical evolution (GE). GE is a variant of genetic programming that can evolve complete programs in an arbitrary language using a variable-length binary string. In contrast to standard GP, which applies search operators directly to phenotypes, GE uses an additional mapping and applies search operators to binary genotypes. Therefore, there is a large semantic gap between genotypes (binary strings) and phenotypes (programs or expressions). The case study shows that the mapping used in GE has low locality leading to low performance of standard mutation operators. The study at hand is an example of how basic design principles o…
Lógicas epistémicas y sistemas multiagentes: los agentes nacen y mueren
2008
In this paper we study the propositional epistemic logics with operators to analize the knowledge of a group, and its applications to the multi-agent systems when the number of agents can vary between different worlds or states.