Search Results - (( a destination path algorithm ) OR ( java application optimization algorithm ))

Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

“…Key features include the SMAC Hybrid A* algorithm for global path planning, the Regulated Pure Pursuit Controller for local trajectory execution and dynamic obstacle avoidance, and gmapping for SLAM functionality. …”
Get full text
Get full text

Path planning for constant speed robot by Abdullah @ Idris, Ahmad Takiyuddin

“…At the moment, the guidance algorithm managed to assist the robot to reach the desired destination, within a certain small error tolerance. …”
Get full text
Get full text

Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization by Yusof, T. S. T., Toha, Siti Fauziah, Md. Yusof, Hazlina

“…The system consists of a destination selection process and path planning process. …”
Get full text
Get full text
Get full text

AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

“…Shortest path finding algorithms are necessary in road network of a city or country for tourists and visitors. …”
Get full text
Get full text

Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

“…At the moment, the guidance algorithm managed to assist the robot to reach the desired destination, within a certain small error tolerance. …”
Get full text

Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

“…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
Get full text
Get full text

UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir by Mohamed Nasir, Mohamad Yunus

“…Route planner is a connecting route between a starting point and a point of destination, wherein the starting point, point of destination and connecting route. …”
Get full text
Get full text

Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

“…Moreover, Dijkstra algorithm is applied to find the shortest path. The shortest path is calculated by using C programming of Dev C++. …”
Get full text
Get full text
Get full text

Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

“…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
Get full text
Get full text
Get full text
Get full text

Adaptive path finding algorithm in dynamic environment for warehouse robot by Ng, Mun Kit, Chong, Yung Wey, Ko, Kwang man, Park, Young Hoon, Leau, Yu Beng

“…For example, A* path finding algorithm is developed to obtain the shortest path, while D* obtains a complete coverage path from source to destination. …”
Get full text
Get full text
Get full text

ZLS: A next-door lightweight QoS aware location service technique for VANET on highways by Rehan, M., Hasbullah, H., Chughtai, O., Rehan, W.

“…Similarly, a source can reach destination in the quickest possible way by sending uni-cast messages without using digital map or shortest path finding algorithms. …”
Get full text
Get full text

Travelling choices made easier using dijkstra algorithm / Wardah Mohd Nor and Noraini Noordin by Mohd Nor, Wardah, Noordin, Noraini

“…In finding the minimum total travel cost and shortest total completion time for a journey between two destinations, the step-by-step Dijkstra algorithm was applied in the time-dependent shortest path problem (TDSPP) and cost-dependent shortest path problem (CDSPP) in this research. …”
Get full text
Get full text
Get full text

A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.

Get full text
Get full text

An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R., Sammi, R.

Get full text
Get full text

Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

“…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
Get full text
Get full text
Get full text

Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

“…In relation to that, A* algorithm was used as a path finding technique to plan a collision-free-path journey from one location to another. …”
Get full text
Get full text

Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

“…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
Get full text
Get full text
Get full text
Get full text

Indoor navigation system using Dijkstra’s algorithm for emergency situation: article / Mohd Faizulhayad Mashuri by Mashuri, Mohd Faizulhayad

“…Route planning using Dijkstra’s algorithm can produce better accuracy and more reliable in indoor environment since the only factor taken into account is the weight for each path.…”
Get full text
Get full text

Indoor navigation system using Dijkstra's algorithm for emergency situation / Mohd Faizulhayad Mashuri by Mashuri, Mohd Faizulhayad

“…Thus, it can be conclude that Dijkstra's algorithm is the best algorithm to be used for route planning compared to Bellman-Ford and A* algorithm.…”
Get full text
Get full text

Modelling of multi-robot system for search and rescue by Poy, Yi Ler

“…The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
Get full text
Get full text