| 000 -LEADER |
|---|
| fixed length control field |
02721nam a22002417a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
FT8884 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20251215134725.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
251215b ||||| |||| 00| 0 eng d |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
engtag |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.9 A43 B67 2025 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
. |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Borbon, Janelly S.; Indol, Rovia Zhen M. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
An enhancement of A* algorithm applied to automated vehicle parking |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
. |
| Name of producer, publisher, distributor, manufacturer |
. |
| Date of production, publication, distribution, manufacture, or copyright notice |
c2025 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Other physical details |
Undergraduate Thesis: (Bachelor of Science in Computer Science) - Pamantasan ng Lungsod n g Maynila, 2025 |
| 336 ## - CONTENT TYPE |
|---|
| Source |
text |
| Content type term |
text |
| Content type code |
text |
| 337 ## - MEDIA TYPE |
|---|
| Source |
unmediated |
| Media type term |
unmediated |
| Media type code |
unmediated |
| 338 ## - CARRIER TYPE |
|---|
| Source |
volume |
| Carrier type term |
volume |
| Carrier type code |
volume |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
ABSTRACT: The A* Algorithm is a path-finding algorithm that primarily uses weighted graphs and focuses on the heuristic values of nodes. However, while effective in generating a near-optimal path is a static environment, the traditional algorithm faces limitations in navigating dynamic environments, often resulting in collisions with obstacles and generating a path with unnecessary sharp turns. These limitations make it inefficient especially in complex environments with real-world scenarios. To address these limitations, an Enhanced A* Algorithm is proposed. This algorithm utilizes Navigation Mesh data structure to generate a more optimal route with local path planning, penalties and Box Blur Algorithm to create a safer distance around the obstacles, and NavMesh Raycast element to make the generated path smoother. The performance of the algorithms was evaluated using three versions of the parking lot environment, each corresponding to a distinct test case and levels of complexity. Then, in terms of dynamic obstacle avoidance, a comparison between the Enhanced A* Algorithm and the traditional algorithm was conducted. Statistical analyses were also performed to assess the consistency and validity of the findings. The results demonstrated that the Enhanced A* Algorithm successfully avoided all dynamic obstacles and moving effects encountered along the path in all distinct test cases. In contrast to the traditional algorithm, which achieved an average obstacle avoidance rate of 8.33% and 13.33% in all maps, the enhanced algorithm consistently demonstrated a 100% average obstacle avoidance rate. The average obstacle clearance and maximum turning angle were also evaluated, showing an increase in distance of 1 to 4 units and an improvement rate of 14.44% to 27.78%, respectively. The enhanced algorithm outperformed the traditional A* algorithm in generating a path in a complex environment by exhibiting optimal dynamic obstacle recognition and avoidance. |
| 526 ## - STUDY PROGRAM INFORMATION NOTE |
|---|
| Classification |
Filipiniana |
| 655 ## - INDEX TERM--GENRE/FORM |
|---|
| Genre/form data or focus term |
academic writing |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Thesis/Dissertation |