Trip Report

the 5th International Symposium in Artificial Life and Robotics

at Oita, Japan, 26-28th January 2000


and visit to University of Tokyo, Department of Precision Machinery

History of AROB
Some interesting topics :
  • Future Intelligent Systems
  • DNA computing
  • Impression on U. of Tokyo research activities
    Robotic Dog : AIBO in the world cub soccer  2000

    History of AROB

    1987 ALIFE first symposium by Santa Fe Institute, Langton
    Santa Fe Institute supports Japan to run conferences related to ALIFE
    There are 3 main conferences : AROB statistics
    year #paper #country
    1996 72 6
    1997 38 5
    1998 186 9
    1999 206 9
    2000 240 15

    Topics

    self-reproduction, GA, micro mechatronics, neural network, human centred systems, artificial brain, interactive self-reflection, biologically inspired systems, genomic dynamics, neurocomputing, life and computation.

    Large number of participants are Japanese PhD and new faculties.

    Future Intelligent Systems.

    (Prof. Harashima)

    Intelligent Systems :  A system which enhances human intelligence by the use of science and technology.
    Example : internet, mobile phone, manufacturing, transportation, space, distance learning etc.
    Traditional intelligent systems : efficiency for system managers not for customers.
    Future intelligent systems :  human friendly, human is customer not just manager.
    Example : electric hybrid vehicles  (Honda ,  100 km/ 3 litres )

    New meets Old

    IMS  System AI Brain sci  Intelligent Sys

    ITS  Power sys
                              ALIFE & Robotics
    micro VLSI  Quantum
    machine     Computing     Microtechnology

    ME  EE      CS Material
     
    Intelligent Transport System : Intelligent Highway
    60 x 10^12  yen  by 2015
    Software for this project will be as challenging as internet
    VICS (highway),  ITC (toll), AHS  (smart vehicle)

    Internet is an engineering realization of telepathy

    Distance learning : shared white board, voice, small no. of students.
    TMIT and MIT  , 3-4 students do a design project,  automatic parking of a car.

    DNA computing

    initiated by L. Adleman, advantage Adleman, solved Hamiltonian path by DNA  (Science 1994)
    Lipton solved SAT.  (Nature, Jan 2000)

    How to encode problem into DNA

    Simulation at level of gene
    (ATR group)

    DNA computing operators :
    anneal, melt, ligate, polymerase, extension, cut, destroy, merge,  separate by length, append, mark, unmark.

    Model =

    the standard DNA model +
    context sensitive grammar +
    CA with random-chaotic-syntactic parsing/generating +
    mRNA-enzyme reaction +
    protein verification
    Features : Result to date (from ATR group)
    found one new genome
    create two protein sequences
     
    Simulation of metabolism and molecular computation
    (ETL group) Simulation of metabolism (p. 738 fig 1, 2)


    molecular computing

    Each DNA consisted of three parts : program, data and head.  The head accesses a particular location in the program (or data), copies one symbol, and is detached.  In the next cycle, the copied symbol becomes the head, and it will access another location.  The flapping movement is regulated by the reaction temperature, and the termination after copying is skillfully implemented in the DNA sequence.
    (from : Arita, M., "Bio-computing in the 21th century", Proc. of the 5th Int. Symp. on Aritificial Life and Robotics, Oita, Japan, 2000, pp.737-740).