著者
小林 重信
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.24, no.1, pp.128-143, 2009-01-01
被引用文献数
10 63

Real-coded genetic algorithms (RCGA) are expected to solve efficiently real parameter optimization problems of multimodality, parameter dependency, and ill-scale. Multi-parental crossovers such as the simplex crossover (SPX) and the UNDX-m as extensions of the unimodal normal distribution crossover (UNDX) show relatively good performance for RCGA. The minimal generation gap (MGG) is used widely as a generation alternation model for RCGA. However, the MGG is not suited for multi-parental crossovers. Both the SPX and the UNDX-m have their own drawbacks respectively. Therefore, RCGA composed of them cannot be applied to highly dimensional problems, because their hidden faults appear. This paper presents a new and robust faramework for RCGA. First, we propose a generation alternation model called JGG (just generation gap) suited for multi-parental crossovers. The JGG replaces parents with children completely every generation. To solve the asymmetry and bias of children distribution generated by the SPX and the UNDX-m, an enhanced SPX (e-SPX) and an enhanced UNDX (e-UNDX) are proposed. Moreover, we propose a crossover called REX (φ, n+k) as a generlization of the e-UNDX, where φ and n+k denote some probability distribution and the number of parents respectively. A concept of the globally descent direction (GDD) is introduced to handle the situations where the population does not cover any optimum. The GDD can be used under the big valley structure. Then, we propose REX^<star> as an extention of the REX (φ, n+k) that can generate children to the GDD efficiently. Several experiments show excellent performance and robustness of the REX^<star>. Finally, the future work is discussed.
著者
河合 和久 塩見 彰睦 竹田 尚彦 大岩 元
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.8, no.5, pp.583-592, 1993-09-01
被引用文献数
22

A distributed and networking card-handling tool named KJ-Editor that simulates arranging index-cards on a desk as working in collaboration is described. Card-handling is one of the most useful methods for information representeation and idea-generation. In KJ-Editor, hundreds of cards can be generated on any place in a display and a sentence can be written on each of them. A generated card can be picked and moved by a mouse. Cards may be grouped by enclosing them with a curve. Relationships of cards and groups can also be marked by special lines. The chart of cards edited on KJ-Editor can be output by a printer and stored in a disk. When a user of the cooperative work makes some operations on the chart in KJ-Editor, the other collaborators can see the operations on thier own displays. That is so-called WYSIWIS (What You See Is What I See) facilities are implemented in KJ-Editor. An experiment that four collaborators made a specification of a middle-scale software- "LIFT" problem, that is well known as a common problem for requirements analysis-using KJ-Editor was conducted. The collaborators meet at a room and are provided with separate networked computers. They can make a face-to-face communication. According to our observation and analysis on this experiment, some features of cooperative work activity using KJ-Editor are identified : (1) a computer-supported card-handling tool is a useful resource for the group in mediating their cooperative work ; (2) pointing a card or an element of the chart by a mouse has an effect for concentrating the discussion, and (3) WYSIWIS facilities sometimes become obstacles for personal viewing of the card-arrangement and cause collaborators to be uncomfortable.
著者
辻野 広司 ケルナー エドガー 桝谷 知彦
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.12, no.3, pp.440-447, 1997-05-01
被引用文献数
6

We propose a multi-agent system for hypothetical reasoning based on a large-scale computational theory on essential characteristics of neocortical processing. For a problem-solving on a real world environment, we require both a large-scale computational theory and a robust local computational theory. As a large-scale computational theory, we develop a hypothetical reasoning system by introducing a knowledge-based control on agents and a local commu-nication among agents. These agents communicate each other to reach a globally consistent solution while they locally perform hypothesis generation, representation and evaluation based on a memory-based reasoning as a robust local computational theory. This memory-based reasoning is defined by a principal component analysis, and applies both a deductive reasoning and an inductive reasoning with a least amount of memory that are requisites for hypothetical reasoning. By its multiple representation of same-type knowledge, and its intrinsic local control for decision-state-dependent recall of that knowledge, the proposed agents also serve as symbolic representations of the signal description of a respective feature. Since vision is a typical case for problem-solving by hypothetical reasoning, the proposed general architecture has been used to implement a model on face recognition to verify its performance.
著者
五福 明夫
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.11, no.1, pp.112-120, 1996-01-01
被引用文献数
5

Functional modelling techniques are recently used to include the intensions of system designers into models of a system. Functions are higher level than behaviour and they are sometimes given different meanings depending on a system situation. Therefore, it is important to be able to derive behaviour from a functional model. This paper describes techniques to represent goals-functions-structure and to derive system behaviour from a functional model through a structure model, where the Multilevel Flow Modelling (MFM) and the Hybrid Phenomena Theory (HPT) are effectively combined. The MFM is a methodology to model an engineering system from the standpoint of means and goals. It has been applied to diagnostic, planning, and man-machine interface design problems. The HPT is a method to model the relations between structure and behaviour. One useful application of the HPT is to derive mathematical equations describing system's behaviour from structural information. The MFM is extended to be able to represent systematically abstracted information of structure of a system. The HPT is applied to derive the behaviour of a system from its structure model. A transformation mechanism from a MFM model to its corresponding HPT representation is developed to bridge the MFM and HPT. A simple example to model a central heating system and to derive its behaviour demonstrates the proposed techniques.
著者
角 康之
出版者
社団法人人工知能学会
雑誌
人工知能学会誌 (ISSN:09128085)
巻号頁・発行日
vol.15, no.6, pp.1012-1026, 2000-11-01
被引用文献数
15