Path planning using Hybrid Routing Algorithm

The aim of this hybrid algorithm is to design and refine a path-finding technique that integrates A * (A-star) and Dijkstra's algorithms, enhancing the efficiency of route planning by utilizing the advantages of both approaches. The method applies the advantages of the two algorithms by adaptin...

Full description

Saved in:
Bibliographic Details
Published in:2025 3rd International Conference on Artificial Intelligence and Machine Learning Applications Theme: Healthcare and Internet of Things (AIMLA) pp. 1 - 6
Main Authors: G, Abishek, P, Gokul Vasan, N, Janarthanan, P, Kumar
Format: Conference Proceeding
Language:English
Published: IEEE 29.04.2025
Subjects:
A Algorithm
Autonomous Systems
Decision making
Dijkstra's Algorithm
Heuristic algorithms
Hybrid Al-gorithm
Machine learning
Machine learning algorithms
Navigation
Obstacle Avoidance
Path planning
Real-time systems
Robot Navigation
Routing
Technological innovation
Uncertainty
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The aim of this hybrid algorithm is to design and refine a path-finding technique that integrates A * (A-star) and Dijkstra's algorithms, enhancing the efficiency of route planning by utilizing the advantages of both approaches. The method applies the advantages of the two algorithms by adapting them according to the density of the environment. Dijkstra's algorithm is an optimal search algorithm that tries all possible paths to find the shortest path, but is resource-intensive in complex or large environments. The A *(A-star) algorithm optimizes performance by using heuristics to estimate the cost of reaching the goal, thus focusing on dependency and avoiding unnecessary computations. The hybrid strategy attempts to achieve performance and efficiency by combining A * 's efficiency in sparse setting and Dijkstra's extensive search in dense setting. Thus, it maximizes optimal path-finding while minimizing computational effort. Large-scale simulations were performed in MATLAB to compare the algorithm's performance in different environments with varying challenges. The comparison involves the evaluation of the efficiency, effectiveness, and computational complexity of the hybrid algorithm with respect to the standalone A * algorithm and Dijkstra's algorithm implementations.
AbstractList The aim of this hybrid algorithm is to design and refine a path-finding technique that integrates A * (A-star) and Dijkstra's algorithms, enhancing the efficiency of route planning by utilizing the advantages of both approaches. The method applies the advantages of the two algorithms by adapting them according to the density of the environment. Dijkstra's algorithm is an optimal search algorithm that tries all possible paths to find the shortest path, but is resource-intensive in complex or large environments. The A *(A-star) algorithm optimizes performance by using heuristics to estimate the cost of reaching the goal, thus focusing on dependency and avoiding unnecessary computations. The hybrid strategy attempts to achieve performance and efficiency by combining A * 's efficiency in sparse setting and Dijkstra's extensive search in dense setting. Thus, it maximizes optimal path-finding while minimizing computational effort. Large-scale simulations were performed in MATLAB to compare the algorithm's performance in different environments with varying challenges. The comparison involves the evaluation of the efficiency, effectiveness, and computational complexity of the hybrid algorithm with respect to the standalone A * algorithm and Dijkstra's algorithm implementations.
Author N, Janarthanan
P, Gokul Vasan
P, Kumar
G, Abishek
Author_xml – sequence: 1
  givenname: Abishek
  surname: G
  fullname: G, Abishek
  email: abishek130803@gmail.com
  organization: KS Rangasamy College of Technology,Department of ECE,Tiruchengode,Tamil Nadu,India
– sequence: 2
  givenname: Gokul Vasan
  surname: P
  fullname: P, Gokul Vasan
  email: gokulvasan425@gmail.com
  organization: KS Rangasamy College of Technology,Department of ECE,Tiruchengode,Tamil Nadu,India
– sequence: 3
  givenname: Janarthanan
  surname: N
  fullname: N, Janarthanan
  email: janajana9047@gmail.com
  organization: KS Rangasamy College of Technology,Department of ECE,Tiruchengode,Tamil Nadu,India
– sequence: 4
  givenname: Kumar
  surname: P
  fullname: P, Kumar
  email: kumar@ksrct.ac.in
  organization: KS Rangasamy College of Technology,Department of ECE,Tiruchengode,Tamil Nadu,India
BookMark eNo1j8FqwzAQRFVoDm2aP-jBH1Cnktaydo8mtE3ApSXkHiRrnQgcOTjOIX9fTNvLDG8OD-ZR3Kc-sRCZkkulJL1Wm8-6KgE1LbXUZhoLiUbdiQVZQgBlAKk0D-Ll243H7Ny5lGI6ZNfLlOubH2LItv11nLDqDv0Qx-PpScxa11148ddzsXt_263Wef31sVlVdR4JxtxL49nqViGF4FVBjbGMAbVTzhUlBw4GtPXGSocNMRasGyRsAXzTooO5eP7VRmben4d4csNt__8BfgA0pUFj
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/AIMLA63829.2025.11040851
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798331538965
EndPage 6
ExternalDocumentID 11040851
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i93t-b05be72f189ddb149c57e8d82a1aa46eded5327b570a8c9e84e2c898f33bcf8a3
IEDL.DBID RIE
IngestDate Wed Jul 02 05:55:39 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i93t-b05be72f189ddb149c57e8d82a1aa46eded5327b570a8c9e84e2c898f33bcf8a3
PageCount 6
ParticipantIDs ieee_primary_11040851
PublicationCentury 2000
PublicationDate 2025-April-29
PublicationDateYYYYMMDD 2025-04-29
PublicationDate_xml – month: 04
  year: 2025
  text: 2025-April-29
  day: 29
PublicationDecade 2020
PublicationTitle 2025 3rd International Conference on Artificial Intelligence and Machine Learning Applications Theme: Healthcare and Internet of Things (AIMLA)
PublicationTitleAbbrev AIMLA
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.9070572
Snippet The aim of this hybrid algorithm is to design and refine a path-finding technique that integrates A * (A-star) and Dijkstra's algorithms, enhancing the...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms A Algorithm
Autonomous Systems
Decision making
Dijkstra's Algorithm
Heuristic algorithms
Hybrid Al-gorithm
Machine learning
Machine learning algorithms
Navigation
Obstacle Avoidance
Path planning
Real-time systems
Robot Navigation
Routing
Technological innovation
Uncertainty
Title Path planning using Hybrid Routing Algorithm
URI https://ieeexplore.ieee.org/document/11040851
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aPHhSseKbPXg07e5k00yOi1gqaOmhh95KHpNa0Lb0Ifjv3Wy3igcP3pIQCJMEJpP5vvkYu4OASBgCB8gMz03muAlScOcBrPXYEcJXYhOq38fRSA9qsnrFhSGiCnxGrdiscvl-7jbxq6xduqpYkKsMdvaV6mzJWjt0TqrbxdPLc1HeJ4gEFJCt3fRfwimV3-ge_XPFY9b8YeAlg2_fcsL2aHbK7gflcy1Z1DJDSYSsT5LeZ-RcJRHZE7vF22Rexvuv70027D4OH3q8VjvgUy3W3KbSkoKQofbelnGLk4rQI5jMmLxDnrwUoKxUqUGnCXMChxqDENYFNOKMNWbzGZ2zJCdpiFC5WE0LAqALQSDp1AllnJUXrBktHS-29SzGOyMv_xi_YodxP2MOBfQ1a6yXG7phB-5jPV0tb6tT-ALzqIq4
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEG0MmuhJjRi_3YNHC7vTLZ0eidFABMKBAzfSjymSKBAEE_-92wU0Hjx4a5s0zbRNptN5bx5jdxAQCUPgAJnhuckcN0EK7jyAtR4bQvhSbEL1ejgc6v6GrF5yYYioBJ9RLTbLXL6fuVX8KqsXrioW5CqCnV2Z55Cu6VpbfE6q6812t9MsbhRECgrI2nbCL-mU0nM8Hf5zzSNW_eHgJf1v73LMdmh6wu77xYMtmW-EhpIIWh8nrc_Iukoitid2m6_jWRHxv7xV2eDpcfDQ4hu9Az7RYsltKi0pCBlq720RuTipCD2CyYzJG-TJSwHKSpUadJowJ3CoMQhhXUAjTlllOpvSGUtykoYIlYv1tCAAuhAEkk6dUMZZec6q0dLRfF3RYrQ18uKP8Vu23xp0O6NOu_d8yQ7i3saMCugrVlkuVnTN9tzHcvK-uClP5Atdho3_
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2025+3rd+International+Conference+on+Artificial+Intelligence+and+Machine+Learning+Applications+Theme%3A+Healthcare+and+Internet+of+Things+%28AIMLA%29&rft.atitle=Path+planning+using+Hybrid+Routing+Algorithm&rft.au=G%2C+Abishek&rft.au=P%2C+Gokul+Vasan&rft.au=N%2C+Janarthanan&rft.au=P%2C+Kumar&rft.date=2025-04-29&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FAIMLA63829.2025.11040851&rft.externalDocID=11040851