In this paper we study the performance of compressed data for classification and anomaly detection. We use networks of various complexities for our purpose, guided by the data itself rather than one uniform-complexity...
详细信息
In this paper we study the performance of compressed data for classification and anomaly detection. We use networks of various complexities for our purpose, guided by the data itself rather than one uniform-complexity network for the entire data set.
Evolutionary algorithms for optimization of dynamic problems have recently received increasing attention. Online control is a particularly interesting class of dynamic problems, because of the interactions between the...
详细信息
Evolutionary algorithms for optimization of dynamic problems have recently received increasing attention. Online control is a particularly interesting class of dynamic problems, because of the interactions between the controller and the controlled system. In this paper, we report experimental results on two aspects of the direct control strategy in relation to a crop-producing greenhouse. In the first set of experiments, we investigated how to balance the available computation time between population size and generations. The second experiments were on different control horizons, and showed the importance of this aspect for direct control. Finally, we discuss the results in the wider context of dynamic optimization.
We consider three distributed decision making tasks that arise in the design and configuration of multi-hop wireless networks: medium access scheduling, Hamiltonian cycle formation, and the partitioning of network nod...
详细信息
ISBN:
(纸本)0769514359
We consider three distributed decision making tasks that arise in the design and configuration of multi-hop wireless networks: medium access scheduling, Hamiltonian cycle formation, and the partitioning of network nodes into coordinating cliques. We first model these tasks as distributed constraint satisfaction problems (DCSPs). We show that the communication complexity of DCSPs can be related to the computational complexity of centralized constraint satisfaction problems. We then use centralized algorithms to obtain experimental results on the solvability and complexity of the three DCSPs. We show that these problems exhibit "phase transitions" in solvability and complexity as the transmission power of the wireless nodes is varied. Based on these results, we argue that phase transition analysis provides a mechanism for quantifying the critical range of network resources needed for scalable, self-configuring multi-hop wireless networks.
3D models of urban sites with good geometry and facade textures are needed for many planning and visualization applications. Approximate wireframe can be derived from aerial images but detailed textures must be obtain...
详细信息
ISBN:
(纸本)076951695X
3D models of urban sites with good geometry and facade textures are needed for many planning and visualization applications. Approximate wireframe can be derived from aerial images but detailed textures must be obtained from ground level images. Integrating such views with the 3D models is difficult as only small parts of buildings may be visible in a single view. We describe a method that uses two or three vanishing points, not necessarily from orthogonal sets of parallel lines, and a small number of point correspondences to estimate the intrinsic and extrinsic parameters of the ground level cameras. Experimental results from some buildings are presented.
Using other agents' experiences and knowledge, a learning agent may learn faster, make fewer mistakes, and create some rides for unseen situations. These benefits will be gained if the learning agents know the are...
详细信息
Using other agents' experiences and knowledge, a learning agent may learn faster, make fewer mistakes, and create some rides for unseen situations. These benefits will be gained if the learning agents know the area of expertise and the expertness values of each other. In this paper, some Q-learning agents with different skills and expertness levels cooperate in learning. The agents use some criteria to judge others information and knowledge. Four expertness criterion, certainty and entropy measures are used to assign degrees of importance to others' Q-Tables. Effects of measuring these values based on their whole Q-Table, a portion of Q-Tables that reflects their proficiencies, and the states in Q-Tables on the learning quality are studied. Simple strategy sharing and two different weighted strategy-sharing methods are used to combine the acquired knowledge from different agents.
This paper presents an attempt to integrate attention and navigation skills in 3D embodied agents (virtual humanoids). The neural model presented has been divided in two main phases. Firstly the environment-categoriza...
详细信息
This paper presents an attempt to integrate attention and navigation skills in 3D embodied agents (virtual humanoids). The neural model presented has been divided in two main phases. Firstly the environment-categorization phase, where an online pattern recognition and categorization of the agent current sensory input data is carried out by an adaptive resonance driven self organizing neural network, which will finally simulate the agent's short term memory (STM). Secondly, the model must also learn how and when to map its current STM state into the navigation and attention motor layers of the 3D agent. We also review the world modelling and the agent vision system, and finally we present the first results extracted from two of the subsystems which conforms the complete neural model, such as, the environment categorization subsystem and the base navigation neural model.
Cooperation in learning improves the speed of convergence and the quality of learning. Special care is needed when heterogeneous agents cooperate in learning. It is discussed that, cooperation in learning may cause th...
详细信息
Cooperation in learning improves the speed of convergence and the quality of learning. Special care is needed when heterogeneous agents cooperate in learning. It is discussed that, cooperation in learning may cause the learning process to diverge if heterogeneity is not handled properly. In this paper, it is assumed that two heterogeneous Q-learning agents cooperate to learn. The heterogeneity is assumed in their action order (and not in their action set). A Q-learning-based method is introduced for the agents to learn the mapping among their actions. It is shown that, the agents are able to learn this mapping while cooperating in learning. Some simulation results are reported to show the effectiveness of the proposed method.
Q-learning is widely used in many multi agent systems. In most cases, a separate critic is considered for qualifying each individual agent behavior or it is assumed that the critic is completely aware of effects of al...
详细信息
Q-learning is widely used in many multi agent systems. In most cases, a separate critic is considered for qualifying each individual agent behavior or it is assumed that the critic is completely aware of effects of all agents' actions on the team qualification. But, in many cases, the role of each team member in the group performance is not known. In order to distribute a common credit among the agents, a suitable criterion must be provided to estimate the role of each agent in the team performance and to judge if an agent has done a wrong action. In this paper two such criteria, named certainty and expertness, for a team of agents with parallel tasks are introduced. In addition, two methods for reinforcing the agents based on the proposed measures are provided. Some simulation results are also reported to show the effectiveness of the proposed measures and methods.
In multiagent reinforcement learning, inter-agent credit assignment is a fundamental problem, since a single scalar reinforcement signal is the only reliable feedback that teams of learning agents receive. This proble...
详细信息
In multiagent reinforcement learning, inter-agent credit assignment is a fundamental problem, since a single scalar reinforcement signal is the only reliable feedback that teams of learning agents receive. This problem is more critical in groups of independent learners with a joint task. In this research, it is assumed that a critic agent receives the environment feedback and assigns a proper credit to each agent using some measures. Three of such measures for a team of cooperative agents with a parallel and AND-type task are introduced. These measures somehow compare the agents' knowledge. One of these criteria, called normal expertness, is a non-relative measure while two other ones (certainty and relative normal expertness) are relative measure. It is experimentally shown that relative measures work better as they contain more information for the critic agent.
暂无评论