Greedy, A-Star, and Dijkstra's algorithms in finding shortest path

MR Wayahdi, SHN Ginting, D Syahputra - International Journal of …, 2021 - ijadis.org
The problem of finding the shortest path from a path or graph has been quite widely
discussed. There are also many algorithms that are the solution to this problem. The …

Mobile robot navigation based on lidar

Y Cheng, GY Wang - 2018 Chinese control and decision …, 2018 - ieeexplore.ieee.org
A wheeled mobile robot based on Arduino was described in this article. Hardware selection,
Simultaneous Localization and Mapping (SLAM), Path Planning and the principle of the …

Improved safety-first A-star algorithm for autonomous vehicles

J Yu, J Hou, G Chen - 2020 5th International Conference on …, 2020 - ieeexplore.ieee.org
The research focus of this paper is to improve the traditional A-star algorithm to meet the
needs of autonomous vehicles for path safety and smoothness. First, the improved algorithm …

Knowledge-Enhanced Conversational Recommendation via Transformer-Based Sequential Modeling

J Zou, A Sun, C Long, E Kanoulas - ACM Transactions on Information …, 2024 - dl.acm.org
In conversational recommender systems (CRSs), conversations usually involve a set of
items and item-related entities or attributes, eg, director is a related entity of a movie. These …

A-star algorithm for expanding the number of search directions in path planning

Z Zhang, S Wang, J Zhou - 2021 2nd International Seminar on …, 2021 - ieeexplore.ieee.org
In order to solve the problem that the traditional A-star algorithm (square A-star algorithm
has 8 search directions, regular hexagon A-star algorithm has 6 search directions) has many …

A uav global planner to improve path planning in unstructured environments

L Rocha, M Aniceto, I Araújo… - … on Unmanned Aircraft …, 2021 - ieeexplore.ieee.org
A good performance for path planning is essential to carry out real-world missions. In this
paper, the path planning consists of a global planner, that finds the optimal path, and in a …

Towards a human-like approach to path finding

V Rahmani, N Pelechano - Computers & Graphics, 2022 - Elsevier
Path finding for autonomous agents has been traditionally driven by finding optimal paths,
typically by using A* search or any of its variants. When it comes to simulating virtual …

Battlefield situation awareness and networking based on agent distributed computing

J Dong, G Wu, T Yang, Z Jiang - Physical Communication, 2019 - Elsevier
The battlefield environment is complex and changeable, and there are complex terrain
features and bad electromagnetic communication environment. At the present stage, the …

Path planning of mobile robot based on improved genetic algorithm

Y Wei, J Feng, Y Huang, K Liu… - Journal of Physics …, 2022 - iopscience.iop.org
With the continuous development of science and technology, mobile robots are gradually
applied to people's routine life. As one of the key technologies of mobile robots, the …

Multiple-target homotopic quasi-complete path planning method for mobile robot using a piecewise linear approach

G Diaz-Arango, H Vazquez-Leal… - Sensors, 2020 - mdpi.com
The ability to plan a multiple-target path that goes through places considered important is
desirable for autonomous mobile robots that perform tasks in industrial environments. This …