A Novel Latent-Representation-Based Algorithm with Dynamic Obstacle Avoidance (LADy) for Autonomous Mobile Robots (AMRs)

Conventional path-planning algorithms are often tailored to industrial and warehouse settings, creating the necessity to integrate two or more planners, which requires more memory and computation limitations. To overcome this limitation, this study aims to develop a novel algorithm, semantic cost encoding-based A* with Dynamic obstacle avoidance, specifically designed for Autonomous Mobile Robots (AMRs) in warehouses. In this study, the proposed algorithm is benchmarked in Matplotlib against A* and RRT* showing 60.33% higher memory efficiency and 60.36% more efficiency in aspect of number of computed nodes than RRT*, while all equivalent to A* in a static environment, and benchmarked against D* lite for dynamic environment, as well as against a hybrid algorithm, a simplified interpretation of commercial AMR path planning approaches, to show 45.30% more memory-efficiency than the hybrid algorithm, which is much more preferred in a real time implementation than D* lite, for AMRs.

@article{Prakash2026,
  title     = {A Novel Latent-Representation-Based Algorithm with Dynamic Obstacle Avoidance (LADy) for Autonomous Mobile Robots (AMRs)},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {17},
  number    = {3},
  year      = {2026},
  publisher = {The Science and Information Organization},
  author    = {Harishma Prakash and Prasina A and Samuthira Pandi V and Naregalkar Akshaykumar Rangnath and Rajalingam A and Sundar R},
  doi       = {10.14569/IJACSA.2026.0170343},
  url       = {https://doi.org/10.14569/IJACSA.2026.0170343}
}