A Hierarchical Self-orginising Map Model for Sequence Recognition

This paper presents an analysis of an original hierarchical neural model on a complex sequence - the complete sixteenth fourpart fugue in G minor of the Well-Tempered Clavier (vol 1) of J. S. Bach. The model makes an effective use of context information, through its hierarchical topology and embedded time integrators, and that enables it to keep a very good account of past events. The model performs sequence classification and discrimination efficiently. It has application in domains which require pattern recognition, or particulary, which demand recognising either a set if sequences of vectors in time, or sub-sequences into a unique and large sequence of vectors in time. Received: 16 March 1999, Received in revised form: 30 July 1999, Accepted: 27 September 1999     

The power of ants in solving Distributed Constraint Satisfaction Problems

Distributed Constraint Satisfaction (DCSP) has long been considered an important area of research for artificial intelligence and multi-agent systems. Also, Ant Colony Optimization (ACO) is an important evolutionary method for solving various optimization problems. This paper demonstrates the power of ants in solving DCSPs and describes a new approach for such a solution, showing how it differs from previous ACO-based DCSP solvers. The presented algorithm is designed to provide the special requirements that are important in the distributed form of Constraint Satisfaction Problem (CSP). The paper describes the important criteria for distributed CSP and then demonstrates how the presented algorithm stands out over similar DCSP solvers considering these criteria. Finally, the proposed approach is evaluated on random binary problems. The practical results show that this method, in most of the cases, outperforms the Asynchronous Backtracking Algorithm (ABT) and Distributed Breakout Algorithm (DBA) two important algorithms in this field of research.     

Collective circular motion of multi-vehicle systems

This paper addresses a collective motion problem for a multi-agent system composed of nonholonomic vehicles. The aim of the vehicles is to achieve circular motion around a virtual reference beacon. A control law is proposed, which guarantees global asymptotic stability of the circular motion with a prescribed direction of rotation, in the case of a single vehicle. Equilibrium configurations of the multi-vehicle system are studied and sufficient conditions for their local stability are given, in terms of the control law design parameters. Practical issues related to sensory limitations are taken into account. The transient behavior of the multi-vehicle system is analyzed via numerical simulations.     

多智能体在WebGIS中的应用研究

WebGIS作为地理信息领域的一个分支,正面临着越来越大的需求。传统的WebGIS的构建方法已经呈现了一定的局限性。该文将人工智能领域的Agent引入到WebGIS中,目的在于构建一种智能化的WebGIS体系。文章通过对Agent的功能分析,得到反应型Agent的定义,建立了反应型Agent的模型。在反应型Agent基础上,分析了MAS的结构体系。通过多智能体的组合,具体实现一个农业WebGIS的应用。     

Towards agent systems engineering

The term “ ” has became a buzzword these days, not only in academic circles, but also in some computer magazines and application fields of computer science like manufacturing and logistics. Hence, there is a pressing need for a design methodology for multi-agent systems. Or even stronger, there is a demand for an agent engineering technology, which includes computer assistance during the design phases, for the validation of the designed system, and for the implementation of the multi-agent system as a physically distributed system. This status report will introduce the field of multi-agent systems and its design. Three prominent applications will serve as a first motivation of the theme. Based on the ideas of the agent examples a discussion on the term agent will serve as a first motivation of the theme. Based of the theme. Based on the ideas of the agent architecture of an agent, its communication capabilities, and planning in a multi-agent context. After this broad technical introduction the main topic of this work will be tackled. An introduction to five methodologies for the design of multi-agent systems will be given and a new one, the method, will be presented. Eventually a brief discussion about the multi-agent design approaches will be given, the missing correlations to the task definitions will be critizised, and further research directions will be proposed.     

Swarming behavior of multi—agent systems

We consider an anisotropic swarm model with an attraction/repulsion function and study its aggregation properties. It is shown that the swarm members will aggregate and eventually form a cohesive cluster of finite size around the swarm center in a finite time. Moreover, we extend our results to more general attraction/repttlsion functions. Numerical simulations demonstrate that all agents will eventually enter into and remain in a bounded region around the swarm center which may exhibit complex spiral motion due to asymmetry of the coupling structure. The model in this paper is more general than isotropic swarms and our results provide fiarther insight into the effect of the interaction pattem on individual motion in a swarm system.     

Model Checking Abilities of Agents: A Closer Look

Alternating-time temporal logic (atl) is a logic for reasoning about open computational systems and multi-agent systems. It is well known that atl model checking is linear in the size of the model. We point out, however, that the size of an atl model is usually exponential in the number of agents. When the size of models is defined in terms of states and agents rather than transitions, it turns out that the problem is (1) Δ ₃ ^P -complete for concurrent game structures, and (2) Δ ₂ ^P -complete for alternating transition systems. Moreover, for “Positive atl” that allows for negation only on the level of propositions, model checking is (1) Σ ₂ ^P -complete for concurrent game structures, and (2) NP-complete for alternating transition systems. We show a nondeterministic polynomial reduction from checking arbitrary alternating transition systems to checking turn-based transition systems, We also discuss the determinism assumption in alternating transition systems, and show that it can be easily removed. In the second part of the paper, we study the model checking complexity for formulae of atl with imperfect information (atl _ir ). We show that the problem is Δ ₂ ^P -complete in the number of transitions and the length of the formula (thereby closing a gap in previous work of Schobbens in Electron. Notes Theor. Comput. Sci. 85(2), 2004). Then, we take a closer look and use the same fine structure complexity measure as we did for atl with perfect information. We get the surprising result that checking formulae of atl _ir is also Δ ₃ ^P -complete in the general case, and Σ ₂ ^P -complete for “Positive atl _ir ”. Thus, model checking agents’ abilities for both perfect and imperfect information systems belongs to the same complexity class when a finer-grained analysis is used.     

Game theoretical applications for multi-agent systems

We consider game-theoretic principles for design of cooperative and competitive (non-cooperative self-interested) multi-agent systems. Using economic concepts of tâtonnement and economic core, we show that cooperative multi-agent systems should be designed in games with dominant strategies that may lead to social dilemmas. Non-cooperative multi-agent systems, on the other hand, should be designed for games with no clear dominant strategies and high degree of problem complexity. Further, for non-cooperative multi-agent systems, the number of learning agents should be carefully managed so that solutions in the economic core can be obtained. We provide experimental results for the design of cooperative and non-cooperative MAS from telecommunication and manufacturing industries.     

Expert system problem selection: A domain characteristics approach

The first generation of commercial expert systems based on AI technology are now available in the market place. But in the available literature, one can find hardly any material on expert system problem selection. In this paper a number of popular and successful expert systems are analyzed. Domain-dependent and domain-independent problem characteristics have been identified, based on the analysis. To test our contention that these characteristics significantly contribute to the success of expert systems, a questionnaire survey involving a number of expert system developers was conducted. Based on this, a domain characteristic approach for expert system problem selection is presented.     

Social logics and expert systems

My goal is to emphasize the way we generally use the word logic and the sort of problems related to the definition of logic and the sort of problems related to the definition of logic. I also wish to underline the differences between human intelligence and artificial intelligence.I underline what, in my opinion, are the consequences for skill and knowledge transfer when using logic-based methodologies in landscapes deeply different from an input landscape. In this case I use, as a paradigm, the Indian way of logic, that has developed an original form of formal logic different from the Western logic.     

人工智能的应用研究

本文对人工智能的发展过程及现在研究的热点进行了简要的概述,重点对人工智能的应用研究领域做了阐述。     

基于SOAP的软件人通信模型研究

对比了两种常用智体通信语言KQML和FIPA-ACL,确定软件人的通信语言采用FIPAACL,从而实现与分布在世界各地的多智体系统之间能够互操作,即相互通信和交流信息。同时提出了软件人通信层;欠结构和交互模型。然而,目前FIPA消息不能穿越防火墙,极大地制约了不同Agent平台之间的互操作性,因此提出使用简单对象存取协议（simple Object Access Protocol）作为新的传输协议,该协议可以穿越防火墙FIPAACL的规范,但未完整地涉及安全问题,因此同时通过扩展SOAP解决软件人通信的安全问题,从而达到可靠的安全通信。     

集控式足球机器人系统关键技术研究

足球机器人比赛是机器人研究的一个新热点,它为人工智能理论和算法的研究提供了一个实验平台,其研究的领域涵盖了人工智能、自动控制、机器人视觉、无线通信、机器学习和多智能体合作与协调等。集控式足球机器人系统通常可以划分为4个子系统,即视觉、决策、通信和车型机器人。结合研究经验,介绍了集控式足球机器人各个子系统的关键技术。     

An immune oriented multi-agent system for biological image processing

In this article, we present a parallel image processing system based on the concept of reactive agents. Our system lies in the oRis language, which allows to describe finely and simply the agents’ behaviors to detect image features. We also present a method of segmentation using a multi-agent system, and two biological applications made with oRis. The stopping of this multi-agent system is implemented through a technique issued from immunology: the apoptosis.     

Agent-oriented software patterns for rapid and affordable robot programming

Robotic systems are often quite complex to develop; they are huge, heavily constrained from the non-functional point of view and they implement challenging algorithms. The lack of integrated methods with reuse approaches leads robotic developers to reinvent the wheel each time a new project starts. This paper proposes to reuse the experience done when building robotic applications, by catching it into design patterns. These represent a general mean for (i) reusing proved solutions increasing the final quality, (ii) communicating the knowledge about a domain and (iii) reducing the development time and effort. Despite of this generality, the proposed repository of patterns is specific for multi-agent robotic systems. These patterns are documented by a set of design diagrams and the corresponding implementing code is obtained through a series of automatic transformations. Some patterns extracted from an existing and freely available repository are presented. The paper also discusses an experimental set-up based on the construction of a complete robotic application obtained by composing some highly reusable patterns.