Cover Image

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. However, despite of JPS advantage in using less memory, it does not consider the shape of obstacles when finding the shortest path from start to goal p...

Full description

Saved in:
Bibliographic Details
Main Author: Nurul Atikah Janis
Format: Thesis
Language:English
English
Published: 2018
Subjects:
TK5101-6720 Telecommunication Including telegraphy, telephone, radio, radar, television
Online Access:https://eprints.ums.edu.my/id/eprint/42802/1/24%20PAGES.pdf
https://eprints.ums.edu.my/id/eprint/42802/2/FULLTEXT.pdf
https://eprints.ums.edu.my/id/eprint/42802/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.ums.eprints.42802
record_format eprints
spelling my.ums.eprints.428022025-02-13T06:42:54Z https://eprints.ums.edu.my/id/eprint/42802/ Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment Nurul Atikah Janis TK5101-6720 Telecommunication Including telegraphy, telephone, radio, radar, television Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. However, despite of JPS advantage in using less memory, it does not consider the shape of obstacles when finding the shortest path from start to goal point. We demonstrate our framework; the integration of enhanced Jump Point Search algorithm with modified Bresenham for heuristic computation in virtual grid-based environment. The first approach is the enhancement of the JPS technique. Basically, the original JPS technique consists of two rules; pruning rules and jumping rules. This research study will be focusing on enhancement of jumping rules. The enhancement being done by improving the selection of jump point into n’+1, instead of choosing the node n’ next to the obstacle. The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. The algorithm which consider the error value, e to increment pixels is the crucial part of the line generation applies the same concept in the second approach, where the error value, e is used as indicator to determine the heuristic cost of the path. The third approach is the integration of the two crucial process earlier which satisfy the third objective of the research study; to produce an optimal shortest path with minimum computation time. The visualization and experiment results from the enhanced JPS showed that the proposed technique require less number of nodes attached to obstacles as the obstacles level become higher in percentage. This is due to the improved jumping rules and steps of successor selection. The conducted simulations clearly shows that the proposed technique helps in producing a path with less nodes attached to the obstacles compared to the original JPS. Finally, the third approach of the integration of enhanced JPS with modified Bresenham technique is tested on three different benchmark maps; “Starcraft” map, Britannia height map and general height map. The results shows that this proposed technique performs better than the Original JPS manage to achieve shorter execution time while trying to maintain the shortest path towards reaching the goal. For example, in the last experiment part of using general height map, the execution time is 10ms with shortest path of 91 node distance compared to Original JPS with 40ms and 122 node distance. In conclusion, the integration of the two techniques has successfully produce an optimal shortest path with minimum execution time especially for environment with many obstacles. Next, future research can be further by enhancing the heuristic computation in JPS or other path finding technique by considering weightage heuristic cost. 2018 Thesis NonPeerReviewed text en https://eprints.ums.edu.my/id/eprint/42802/1/24%20PAGES.pdf text en https://eprints.ums.edu.my/id/eprint/42802/2/FULLTEXT.pdf Nurul Atikah Janis (2018) Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment. Masters thesis, Universiti Malaysia Sabah.
institution Universiti Malaysia Sabah
building UMS Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Sabah
content_source UMS Institutional Repository
url_provider http://eprints.ums.edu.my/
language English
English
topic TK5101-6720 Telecommunication Including telegraphy, telephone, radio, radar, television
spellingShingle TK5101-6720 Telecommunication Including telegraphy, telephone, radio, radar, television
Nurul Atikah Janis
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
description Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. However, despite of JPS advantage in using less memory, it does not consider the shape of obstacles when finding the shortest path from start to goal point. We demonstrate our framework; the integration of enhanced Jump Point Search algorithm with modified Bresenham for heuristic computation in virtual grid-based environment. The first approach is the enhancement of the JPS technique. Basically, the original JPS technique consists of two rules; pruning rules and jumping rules. This research study will be focusing on enhancement of jumping rules. The enhancement being done by improving the selection of jump point into n’+1, instead of choosing the node n’ next to the obstacle. The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. The algorithm which consider the error value, e to increment pixels is the crucial part of the line generation applies the same concept in the second approach, where the error value, e is used as indicator to determine the heuristic cost of the path. The third approach is the integration of the two crucial process earlier which satisfy the third objective of the research study; to produce an optimal shortest path with minimum computation time. The visualization and experiment results from the enhanced JPS showed that the proposed technique require less number of nodes attached to obstacles as the obstacles level become higher in percentage. This is due to the improved jumping rules and steps of successor selection. The conducted simulations clearly shows that the proposed technique helps in producing a path with less nodes attached to the obstacles compared to the original JPS. Finally, the third approach of the integration of enhanced JPS with modified Bresenham technique is tested on three different benchmark maps; “Starcraft” map, Britannia height map and general height map. The results shows that this proposed technique performs better than the Original JPS manage to achieve shorter execution time while trying to maintain the shortest path towards reaching the goal. For example, in the last experiment part of using general height map, the execution time is 10ms with shortest path of 91 node distance compared to Original JPS with 40ms and 122 node distance. In conclusion, the integration of the two techniques has successfully produce an optimal shortest path with minimum execution time especially for environment with many obstacles. Next, future research can be further by enhancing the heuristic computation in JPS or other path finding technique by considering weightage heuristic cost.
format Thesis
author Nurul Atikah Janis
author_facet Nurul Atikah Janis
author_sort Nurul Atikah Janis
title Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
title_short Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
title_full Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
title_fullStr Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
title_full_unstemmed Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
title_sort integration of enchanced jump point search (jps) algorithm with modified bresenham technique for path planning in virtual grid-based environment
publishDate 2018
url https://eprints.ums.edu.my/id/eprint/42802/1/24%20PAGES.pdf
https://eprints.ums.edu.my/id/eprint/42802/2/FULLTEXT.pdf
https://eprints.ums.edu.my/id/eprint/42802/
_version_ 1825161823087755264
score 13.244413

Similar Items