# US 2001/0034578 A1 · Information processing method and information processing apparatus

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2001/0034578 A1
- Document ID: US20010034578A1
- Status: Published application
- Kind: A1
- Application number: 09/775,784
- Filed: 2001-02-02
- Published: 2001-10-25
- Earliest claimed: 2000-02-03
- Assignees: Sony Corporation
- Inventors: Ryuichi Ugajin
- Web page: https://patentgrep.com/patent/US20010034578A1

## CPC

- G01C 21/343: {Calculating itineraries (travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047)}
- G01C 21/3446: {Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags or using precalculated routes}
- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

To obtain good approximate solutions of a combinatorial optimization problem such as traveling salesman problem and to enable its processing apparatus in form of massively parallel exclusive devices, an information carrier corresponding to the distribution of a plurality of points given on an n-dimensional space (n is an integer not smaller than 2), and time development and time reversal of the information carrier are used to process the information. The information carrier may be the density of particles or optical intensity corresponding to the distribution of the given points, and a diffusion process of the particles or a defocusing process is used as changes with time. The traveling salesman problem is solved by using this method.

## Claims

### Claim 1

An information processing method comprising: preparing an information carrier corresponding to a distribution of a plurality of points given on an n-dimensional space (where n is an integer not smaller than 2); and using time development and time reversal of the information carrier to process the information.

### Claim 2 (depends on 1)

The information processing method according to claim 1 wherein said information carrier is the density of particles corresponding to the distribution of the given points, and their diffusion process is used as changes with time.

### Claim 3 (depends on 1)

The information processing method according to claim 1 wherein said information carrier is the optical intensity corresponding to the distribution of the given points, and its defocusing process is used as changes with time.

### Claim 4 (depends on 1)

The information processing method according to claim 1 wherein, for a problem of finding a route minimizing the total length of lines each connecting two points among routes each once passing all of a plurality of points given on an n-dimensional plane, the information carrier corresponding to the distribution of the given points, and time reversal of the information carrier is used.

### Claim 5

An information processing apparatus configured to prepare an information carrier corresponding to the distribution of a plurality of points given on an n-dimensional space (where n is an integer not smaller than 2), and to use time development and time reversal of the information carrier for processing the information.

### Claim 6 (depends on 5)

The information processing apparatus according to claim 5 wherein said information carrier is the density of particles corresponding to the distribution of the given points, and their diffusion process is used as changes with time.

### Claim 7 (depends on 5)

The information processing apparatus according to claim 5 wherein said information carrier is the optical intensity corresponding to the distribution of the given points, and its defocusing process is used as changes with time.

### Claim 8 (depends on 5)

The information processing method according to claim 5 wherein, for a problem of finding a route minimizing the total length of lines each connecting two points among routes each once passing all of a plurality of points given on an n-dimensional plane, the information carrier corresponding to the distribution of the given points, and time reversal of the information carrier is used.
