Collision detection for three dimension objects in a fixed time

This study aimed to propose, a different architecture of a collision detection neural network (DCNN). The ability to detect and avoid collision is very important for mobile intelligent machines. However many artificial vision systems are not yet able to quickly and cheaply extract the wealth information. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons linear and threshold logic, which simplified the actual implementation of all the networks proposed. This article represents a comprehensive algorithm that determine through the AMAXNET network a measure (a mini-maximum point) in a fixed time, which allows us to detect the presence of a potential collision.

[1]  A. Namir,et al.  AOSNET: a neural network implementation of adjustable order statistic filters in fixed time , 2000 .

[2]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

[3]  Mark H. Overmars,et al.  Batched Dynamic Solutions to Decomposable Searching Problems , 1985, J. Algorithms.

[4]  Jing Yuan,et al.  Collision identification between convex polyhedra using neural networks , 1995, IEEE Trans. Neural Networks.

[5]  Francis Y. L. Chin,et al.  Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.

[6]  Kunihiko Fukushima,et al.  A neural network for visual pattern recognition , 1988, Computer.

[7]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[8]  Mohammed Mestari,et al.  An analog neural network implementation in fixed time of adjustable-order statistic filters and applications , 2004, IEEE Transactions on Neural Networks.

[9]  Teuvo Kohonen,et al.  Correlation Matrix Memories , 1972, IEEE Transactions on Computers.

[10]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[11]  Jacob T. Schwartz,et al.  Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.

[12]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

[13]  D. T. Lee,et al.  Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.

[14]  A. Namir,et al.  Θ(1) Time Neural Network Minimum Distance Classifier and its Application to Optical Character Recognition Problem , 2008 .