Open AccessNon - Euclidean Metric and Path Planning
Author(s) -
Edvards Valbahs,
Peter Grabusts
Publication year - 2016
Publication title -
international journal of computer science and engineering survey
Language(s) - English
Resource type - Journals
eISSN - 0976-3252
pISSN - 0976-2760
DOI - 10.5121/ijcses.2016.7102
Subject(s) - computer science , metric (unit) , euclidean distance , path (computing) , euclidean geometry , mathematics , mathematical optimization , artificial intelligence , geometry , computer network , operations management , economics
In order to achieve the wide range of the robotic application it is necessary to provide iterative motions\udamong points of the goals. For instance, in the industry mobile robots can replace any components between\uda storehouse and an assembly department. Ammunition replacement is widely used in military services.\udWorking place is possible in ports, airports, waste site and etc. Mobile agents can be used for monitoring if\udit is necessary to observe control points in the secret place. The paper deals with path planning programme\udfor mobile robots. The aim of the research paper is to analyse motion-planning algorithms that contain the\uddesign of modelling programme. The programme is needed as environment modelling to obtain the\udsimulation data. The simulation data give the possibility to conduct the wide analyses for selected\udalgorithm. Analysis means the simulation data interpretation and comparison with other data obtained\udusing the motion-planning. The results of the careful analysis were considered for optimal path planning\udalgorithms. The experimental evidence was proposed to demonstrate the effectiveness of the algorithm for\udsteady covered space. The results described in this work can be extended in a number of directions, and\udapplied to other algorithms. \u