Some optimal path planning algorithms for navigating mobile rectangular robot among
obstacles and weighted regions are presented. The approach is based on a higher …

In Euclidean and/or λ-geometry planes with obstacles, the shortest path problem involves
determining the shortest path between a source and a destination. There are three different …

This paper addresses the challenges associated with drone formation and light shows,
presenting an algorithm with a complexity of O (MNLO) tailored for drone light show …

Maze solving using multiple algorithms is one of the important problems in the last years,
maze solving problem is to determine the path of a mobile robot from its source position to a …

In this article, six obstacle-avoidance path planners are introduced to find the free path in the
Euclidean plane with obstacles. Using the Dijkstra's shortest path algorithm in a connected …

This paper presents modified A* and Lifelong Planning A* algorithms to facilitate more
accurate path finding than existing methods, including the Minkowski sum for differential …

In this article, a new obstacle-avoidance path planner is proposed based on the windmill
decomposition to find the shortest path in the Euclidean plane with rectangle obstacles …

Algorithms (PPA), which hold an important place in Robotics navigation. Navigation has
become indispensable to most modern inventions. Mobile robots have to move to a relevant …

In many industrial fields, mobile robots are widely used these days. Research on the mobile
robot's path planning is one of the most important aspects of improvements on the mobile …

En el presente trabajo se hace el análisis de los algoritmos más comunes para la
construcción de Laberintos de Conexión Simple (LCS): Prims, Kruscal, Aldous Broder …