20723 Distance Computing Between Mobile Agents And Linear Manifold Obstacles

Makoto Katoh, Takao SAKAI · The Proceedings of Conference of Kanto Branch · 2005

This paper presents some distance computing methods using a pseudo-inverse theory which is necessary for mobile agents like an artificial life Boyd etc. in order to avoid the collision with obstacles, and to move along an obstacle, which are described by LBI or LMI.

Read the paper · More papers on PaperTik