String Tightening as a Self-Organizing Phenomenon: Computation of Shortest Homotopic Path, Smooth Path, and Convex Hull

12/11/2020
by   Bonny Banerjee, et al.
0

The phenomenon of self-organization has been of special interest to the neural network community for decades. In this paper, we study a variant of the Self-Organizing Map (SOM) that models the phenomenon of self-organization of the particles forming a string when the string is tightened from one or both ends. The proposed variant, called the String Tightening Self-Organizing Neural Network (STON), can be used to solve certain practical problems, such as computation of shortest homotopic paths, smoothing paths to avoid sharp turns, and computation of convex hull. These problems are of considerable interest in computational geometry, robotics path planning, AI (diagrammatic reasoning), VLSI routing, and geographical information systems. Given a set of obstacles and a string with two fixed terminal points in a two dimensional space, the STON model continuously tightens the given string until the unique shortest configuration in terms of the Euclidean metric is reached. The STON minimizes the total length of a string on convergence by dynamically creating and selecting feature vectors in a competitive manner. Proof of correctness of this anytime algorithm and experimental results obtained by its deployment are presented in the paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/05/2015

Grid-based angle-constrained path planning

Square grids are commonly used in robotics and game development as spati...
research
10/18/2020

Shortest Paths Among Obstacles in the Plane Revisited

Given a set of pairwise disjoint polygonal obstacles in the plane, findi...
research
06/03/2021

Internal Shortest Absent Word Queries in Constant Time and Linear Space

Given a string T of length n over an alphabet Σ⊂{1,2,…,n^O(1)} of size σ...
research
04/14/2022

A* shortest string decoding for non-idempotent semirings

The single shortest path algorithm is undefined for weighted finite-stat...
research
05/25/2021

Minimal unique palindromic substrings after single-character substitution

A palindrome is a string that reads the same forward and backward. A pal...
research
12/26/2021

Quantum Algorithm for the Shortest Superstring Problem

In this paper, we consider the “Shortest Superstring Problem”(SSP) or th...
research
03/17/2019

Shortest directed networks in the plane

Given a set of sources and a set of sinks as points in the Euclidean pla...

Please sign up or login with your details

Forgot password? Click here to reset