Time Efficient Graph Version of the A* Algorithm Optimized for MATLAB
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F14%3A39898263" target="_blank" >RIV/00216275:25530/14:39898263 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Time Efficient Graph Version of the A* Algorithm Optimized for MATLAB
Original language description
The paper describes a version of the A* algorithm which is based on matrix operations and is optimized for the MATLAB. The algorithm is designed to be highly time efficiency which is demonstrated on a case study in which the optimized A* algorithm is compared with the A* algorithm realized without using the matrix operations.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Mendel 2014: 20th International Conference on Soft Computing
ISBN
978-80-214-4984-8
ISSN
1803-3814
e-ISSN
—
Number of pages
6
Pages from-to
299-304
Publisher name
Vysoké učení technické v Brně
Place of publication
Brno
Event location
Brno
Event date
Jun 25, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—