Scholarly record
FAST ALGORITHM OF PLANNING A ROBOT S PATH IN 2-DIMENSIONAL SPACE ON THE BASIS OF TRIANGULATION
Publication Impact Profile
Publication details
References28
Lu L., Gong D., Robot path planning in unknown environments using particle swarm optimization, 4th International Conference on Natural Computation, ICNC, 2008, China, vol. 4, pp. 422-426.
Rusdinar A., Kim J., Lee J., Kim S., Implementation of real-time positioning system using extended Kalman filter and artificial landmark on ceiling, Journal of Mechanical Science and Technology, vol. 26/issue 3, pp. 949-958, 2012.
Saranya C., Unnikrishnan M., Akbar Ali S., Sheela D.S., Lalithambika V.R., Occupancy grid based path planning and terrain mapping scheme for autonomous mobile robots, International Journal of Control Theory and Applications, vol. 8/issue 3, pp. 1053-1061, 2015.
Das P.K., Behera H.S., Pradhan S.K., Tripathy H.K., Jena P.K., A modified real time A* Algorithm and its performance analysis for improved path planning of mobile robot, Smart Innovation, Systems and Technologies, vol. 32, pp. 221-234, 2015.
Yakovlev K., Baskin E., Hramoin I., Grid-based angle-constrained path planning (2015) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9324, pp. 208-221 , 2015.
O’Rourke J., Computational Geometry in C, 2 nd ed., Cambridge University Press, England, 1998, 392 p.
Reuter M., Harneit S., Pathfinding with Kohonen-maps, 3 rd International Industrial Simulation Conference, ISC, Germany, 2005, pp. 73-77.
O’Rourke J. , Art gallery theorems and algorithms, Oxford University Press , New York, United States, 1987, 304 p.
Seidel R., A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications, vol. 1/issue 1, pp. 51-64, 1991.
Hart P.E., Nilsson N.J., Raphael B., A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol. 4/issue 2, pp. 100-107, 1968.
Pohl I ., First results on the effect of error in heuristic search, Annu al Machine Intelligence Workshop, Edinburgh, Scotland, vol. 5, pp. 219-236, 1970.
Yakovlev K.S., HGA*, an efficient algorithm for path planning in a plane, Scientific and Technical Information Processing, vol. 37/issue 6, pp. 438-447, 2010.
Likhachev M., Stentz A., R* Search, National Conference on Artificial Intelligence, United States, vol. 1, 2008, pp. 344-350.
Levitin A., Introduction to the Design and Analysis of Algorithms, 3 rd ed., Pearson, UK, 2012, 592 p. 16th International Multidisciplinary Scientific GeoConference SGEM2016 www.sgem.org 16th International Multidisciplinary Scientific GeoConference SGEM 2016 16th International Multidisciplinary Scientific GeoConference SGEM2016 www.sgem.org
Lu L., Gong D., Robot path planning in unknown environments using particle swarm optimization, 4th International Conference on Natural Computation, ICNC, 2008, China, vol. 4, pp. 422-426.
Rusdinar A., Kim J., Lee J., Kim S., Implementation of real-time positioning system using extended Kalman filter and artificial landmark on ceiling, Journal of Mechanical Science and Technology, vol. 26/issue 3, pp. 949-958, 2012.
Saranya C., Unnikrishnan M., Akbar Ali S., Sheela D.S., Lalithambika V.R., Occupancy grid based path planning and terrain mapping scheme for autonomous mobile robots, International Journal of Control Theory and Applications, vol. 8/issue 3, pp. 1053-1061, 2015.
Das P.K., Behera H.S., Pradhan S.K., Tripathy H.K., Jena P.K., A modified real time A* Algorithm and its performance analysis for improved path planning of mobile robot, Smart Innovation, Systems and Technologies, vol. 32, pp. 221-234, 2015.
Yakovlev K., Baskin E., Hramoin I., Grid-based angle-constrained path planning (2015) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9324, pp. 208-221 , 2015.
O’Rourke J., Computational Geometry in C, 2 nd ed., Cambridge University Press, England, 1998, 392 p.
Reuter M., Harneit S., Pathfinding with Kohonen-maps, 3 rd International Industrial Simulation Conference, ISC, Germany, 2005, pp. 73-77.
O’Rourke J. , Art gallery theorems and algorithms, Oxford University Press , New York, United States, 1987, 304 p.
Seidel R., A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications, vol. 1/issue 1, pp. 51-64, 1991.
Hart P.E., Nilsson N.J., Raphael B., A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol. 4/issue 2, pp. 100-107, 1968.
Pohl I ., First results on the effect of error in heuristic search, Annu al Machine Intelligence Workshop, Edinburgh, Scotland, vol. 5, pp. 219-236, 1970.
Yakovlev K.S., HGA*, an efficient algorithm for path planning in a plane, Scientific and Technical Information Processing, vol. 37/issue 6, pp. 438-447, 2010.
Likhachev M., Stentz A., R* Search, National Conference on Artificial Intelligence, United States, vol. 1, 2008, pp. 344-350.
Levitin A., Introduction to the Design and Analysis of Algorithms, 3 rd ed., Pearson, UK, 2012, 592 p. 16th International Multidisciplinary Scientific GeoConference SGEM2016 www.sgem.org 16th International Multidisciplinary Scientific GeoConference SGEM 2016 16th International Multidisciplinary Scientific GeoConference SGEM2016 www.sgem.org
Citing literature
Number of times cited according to Crossref: 1
View or Download full articleAccess options
SWS access login
Login as SWS Scientific CommitteeLogin as SWS Scientific PartnerLogin as SWS AuthorAuthors and approved SWS contributors will read and export their own linked papers after identity matching by SWS profile, email and SGEM GlobalID.
For librarian assistance: [email protected]
Purchase Instant Access
- Article can be downloaded after successful payment.
- Article may be used according to SWS library access terms.
- Article cannot be redistributed.

