  <?xml version="1.0"?>
<journal>
 <journal_metadata>
  <full_title>Journal of Intelligent Systems and Internet of Things</full_title>
  <abbrev_title>JISIoT</abbrev_title>
  <issn media_type="print">2690-6791</issn>
  <issn media_type="electronic">2769-786X</issn>
  <doi_data>
   <doi>10.54216/JISIoT</doi>
   <resource>https://www.americaspg.com/journals/show/4158</resource>
  </doi_data>
 </journal_metadata>
 <journal_issue>
  <publication_date media_type="print">
   <year>2019</year>
  </publication_date>
  <publication_date media_type="online">
   <year>2019</year>
  </publication_date>
 </journal_issue>
 <journal_article publication_type="full_text">
  <titles>
   <title>Path Planning in Mobile Robotics: A Comparative Review of Classical and AI-Driven Techniques</title>
  </titles>
  <contributors>
   <organization sequence="first" contributor_role="author">Department of Mathematics, Faculty of Science, Al-Azhar University, Nasr-City, Cairo, Egypt</organization>
   <person_name sequence="first" contributor_role="author">
    <given_name>Mohammed</given_name>
    <surname>Mohammed</surname>
   </person_name>
   <organization sequence="first" contributor_role="author">Department of Mathematics, Faculty of Science, Al-Azhar University, Nasr-City, Cairo, Egypt</organization>
   <person_name sequence="additional" contributor_role="author">
    <given_name>H. A. El</given_name>
    <surname>Shenbary</surname>
   </person_name>
   <organization sequence="first" contributor_role="author">Department of Mathematics, Faculty of Science, Al-Azhar University, Nasr-City, Cairo, Egypt</organization>
   <person_name sequence="additional" contributor_role="author">
    <given_name>Ashraf A.</given_name>
    <surname>Gouda</surname>
   </person_name>
   <organization sequence="first" contributor_role="author">Department of Mathematics, Faculty of Science, Al-Azhar University, Nasr-City, Cairo, Egypt</organization>
   <person_name sequence="additional" contributor_role="author">
    <given_name>Mohammed Abdel</given_name>
    <surname>Razek</surname>
   </person_name>
  </contributors>
  <jats:abstract xml:lang="en">
   <jats:p>This research presents a comprehensive analysis of path planning and optimization techniques in mobile robotics, focusing on both classical algorithms and modern intelligent approaches. The study systematically reviews fundamental methods such as Dijkstra’s algorithm, the A* search algorithm, and artificial potential fields, together with evolutionary optimization approaches including genetic algorithms and swarm intelligence. It also explores the application of machine learning and deep reinforcement learning models that allow robots to adapt dynamically to complex and changing environments. The comparative evaluation highlights the strengths, weaknesses, and suitable application areas of each approach across scenarios involving obstacle avoidance, energy efficiency, real time adaptability, and multi robot coordination. Particular attention is given to the challenges of uncertain and dynamic environments, computational scalability, and sensor noise, which continue to limit the performance of autonomous navigation systems. By consolidating current advancements and emerging trends, this study provides a structured overview and critical synthesis of existing methodologies, offering a valuable reference for researchers, engineers, and practitioners. It also identifies important research gaps in intelligent hybrid planning, context aware learning and energy constrained mobility, outlining promising directions for the future development of autonomous robotic navigation systems.</jats:p>
  </jats:abstract>
  <publication_date media_type="print">
   <year>2025</year>
  </publication_date>
  <publication_date media_type="online">
   <year>2025</year>
  </publication_date>
  <pages>
   <first_page>360</first_page>
   <last_page>373</last_page>
  </pages>
  <doi_data>
   <doi>10.54216/JISIoT.170125</doi>
   <resource>https://www.americaspg.com/articleinfo/18/show/4158</resource>
  </doi_data>
 </journal_article>
</journal>
