Normal view MARC view ISBD view

Further enhancement of jump point search algorithm applied in pathfinding in a cave explorer / Jade Anne M. Somosa. 6

By: Jade Anne M. Somosa. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; March 2019.46Edition: Description: 28 cm. 49 ppContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: ABSTRACT: This study is about the Further Enhancement of Jump Point Search Algorithm Applied in Pathfinding In A Cave Explorer. Jump Point Search (JPS) is an online symmetry breaking algorithm which speeds up pathfinding on uniform-cost grid maps by jumping over many locations that would otherwise need to be explicitly considered. Studying the existing algorithm, the researcher found three problems for this research study which are [1] The algorithm only generates 2 paths to follow for symmetrical paths, [2] The algorithm does not support hexagonal grids that slows the movement in finding the paths in map, [3] The algorithm is not reliable on bigger maps. The researcher used a Jump point to generate three symmetrical paths to follow. Also, the researcher used hexagonal algorithm to be able to apply the JPS algorithm in Hexagonal grids. Lastly, the researcher used a Swamp technique, wherein the JPS algorithm can now be more reliable in bigger maps. The further enhanced system was able to solve the problems involved in this algorithm regarding in applying it to a bigger map and on other type of grid which is the hexagonal grid and the algorithm can now generate three symmetrical paths, but on separated system for each objective because it happens to interfere when it's on one same system. The researcher recommends that the enhanced algorithm can be further enhanced by extending to it other types of grid or orthogonal grid not just in hexagonal grids and to integrate the three objectives in one system. Other editions:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Filipiniana Section	Filipiniana-Thesis	T QA769.So4.2019 (Browse shelf)	Available		FT7086

Total holds: 0

Browsing PLM Shelves , Shelving location: Filipiniana Section , Collection code: Filipiniana-Thesis Close shelf browser

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	T QA769.G58.2023 Modifying JPS algorithm using NavMesh Data Structure applied in 3D using unity /	T QA769.I36.2018 An enhancement of knuth, morris and pratt algorithm applied in DNA sequence matching /	T QA769.Qu5.2017 Plagiarism Detection Application Using Enhanced Rabin- Karp Algorithm /	T QA769.So4.2019 Further enhancement of jump point search algorithm applied in pathfinding in a cave explorer /	T QD1.Ad5.2022 In-silico screening and molecular docking study of selected flavonoids as a potential inhibitor against SARS-COV-2 3CLPRO /	T QD1.B33.2006 Equilibrium and kinetic studies: removal of heavy metal (Cu2+, Cr3+) from Aqueous solution using modified corncobs /	T QD1.B35.2022 Pharmacophore modeling and molecular docking studies on eleusine indica against type 2 diabetes mellitus targets /	Next

Thesis: (BSCA major in Computer Science) -Pamantasan ng Lungsod ng Maynila, 2019. 56

ABSTRACT: This study is about the Further Enhancement of Jump Point Search Algorithm Applied in Pathfinding In A Cave Explorer. Jump Point Search (JPS) is an online symmetry breaking algorithm which speeds up pathfinding on uniform-cost grid maps by jumping over many locations that would otherwise need to be explicitly considered. Studying the existing algorithm, the researcher found three problems for this research study which are [1] The algorithm only generates 2 paths to follow for symmetrical paths, [2] The algorithm does not support hexagonal grids that slows the movement in finding the paths in map, [3] The algorithm is not reliable on bigger maps. The researcher used a Jump point to generate three symmetrical paths to follow. Also, the researcher used hexagonal algorithm to be able to apply the JPS algorithm in Hexagonal grids. Lastly, the researcher used a Swamp technique, wherein the JPS algorithm can now be more reliable in bigger maps. The further enhanced system was able to solve the problems involved in this algorithm regarding in applying it to a bigger map and on other type of grid which is the hexagonal grid and the algorithm can now generate three symmetrical paths, but on separated system for each objective because it happens to interfere when it's on one same system. The researcher recommends that the enhanced algorithm can be further enhanced by extending to it other types of grid or orthogonal grid not just in hexagonal grids and to integrate the three objectives in one system.

There are no comments for this item.

to post a comment.