An Improved multi-objective a-star algorithm for path planning in a large workspace: Design, Implementation, and Evaluation

A Smooth Jump Point Search Algorithm for Mobile Robots Path Planning Based on a Two-Dimensional Grid Model

“…Step 2 Judge whether the obstacle grid is located in the nonboundary range according to equation (1). If it is satisfied, the free grid near it will be judged as the risk grid according to equation (2), and the corresponding matrix value will be changed from "1" to "2. "…”

“…(3) If d → is the diagonal direction and there exists a node z at the same time ( d → is the diagonal horizontal and vertical decomposition vector direction), node y can move k steps in that direction to reach node z, while node z is the defined jump point by condition (1) or condition (2). e jump point search starts by finding jump points along the straight line and diagonal directions, adding the nodes that meet the definition of jump points to the OpenList, and then selecting the node with the lowest generated value as the new extended node for calculation up to the target point.…”

“…Many algorithms for path planning have been proposed by scholars, such as the A * algorithm [2], Dijkstra algorithm [3] as the representative of geometric model search algorithm and particle swarm optimization (PSO) algorithm [4], and ant colony (ACO) algorithm [5] as the representative of the intelligent optimization algorithm. e A * algorithm has been widely studied and applied due to its relatively small computational e ort, high search e ciency, and relatively optimal planning path compared with other algorithms [6].…”

Automated routing of droplets for DNA storage on a digital microfluidics platform

“…§§3-D prioritized A* was selected as the routing algorithm of choice because it is a complete 26 and optimal 27 heuristic-based algorithm that is guaranteed to find the shortest route between a start and goal point, even in the presence of obstacles. 28 The algorithm considers three dimensions: the horizontal axis of the DMFB grid, the vertical axis of the DMFB grid, and the axis of time. It is called prioritized because it chooses to create routes for droplets by giving priority to the droplet which is furthest from its goal node, i.e.…”

“…§§3-D prioritized A* was selected as the routing algorithm of choice because it is a complete 26 and optimal 27 heuristic-based algorithm that is guaranteed to find the shortest route between a start and goal point, even in the presence of obstacles. 28 …”