On the minimum distance problem for faster-than-Nyquist signaling

1988 ◽  
Vol 34 (6) ◽  
pp. 1420-1427 ◽  
Author(s):  
J.E. Mazo ◽  
H.J. Landau
Keyword(s):  
Minimum Distance ◽  
Distance Problem

A Maxmin Distance Problem

1972 ◽  
Vol 94 (2) ◽  
pp. 155-158 ◽  
Author(s):  
R. Aggarwal ◽  
G. Leitmann
Keyword(s):  
Minimum Distance ◽  
Terminal State ◽  
Initial State ◽  
Closed Set ◽  
Distance Problem

The problem of maximizing the minimum distance of a dynamical system’s state from a given closed set, while transferring the system from a given initial state to a given terminal state, is considered. Two different methods of solution of this problem are given.

Using Genetic Algorithms With Niche Formation to Solve the Minimum Distance Problem Among Concave Objects

2002 ◽  
Author(s):  
J. A. Carretero ◽  
M. A. Nahon ◽  
O. Ma
Keyword(s):  
Minimum Distance ◽  
Optimization Technique ◽  
Combinatorial Problem ◽  
The Body ◽  
Optimization Approach ◽  
Multiple Minima ◽  
Niche Formation ◽  
Distance Problem ◽  
Set Of Points ◽  
Global Optimization Technique

In this paper an optimization approach is used to solve the problem of finding the minimum distance between concave objects, without the need for partitioning the objects into convex sub-objects. Since the optimization problem is not unimodal (i.e., has more than one local minimum point), a global optimization technique, namely a Genetic Algorithm, is used to solve the concave problem. In order to reduce the computational expense of evaluating the constraints at runtime, the objects’ geometry is replaced by a set of points on the surface of the body. This reduces the problem to a combinatorial problem where the combination of points (one on each body) that minimizes the distance will be the solution. Additionally, niche formation is used to allow the minimum distance algorithm to track multiple minima rather than exclusively looking for the global minimum.

Sign in / Sign up

Export Citation Format

Share Document