Search Results - (( java implementation path algorithm ) OR ( based complex path algorithm ))

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

“…The objective is to design and develop an evacuation route using shortest path algorithm based on the evacuation map of the building. …”
Get full text
Get full text
Get full text
Get full text

Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

“…Subsequently, both algorithms were applied to the test environments. Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
Get full text
Get full text

Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

“…The routing problems in VLSI physical design are, in essence, shortest path problems in special graphs. It has been shown that the performance of a graph-based shortest path algorithm can severely be affected by the performance of its priority queue. …”
Get full text
Get full text
Get full text

Mobile robot path planning using hybrid genetic algorithm and traversability vectors method by Loo, C.K., Rajeswari, M., Wong, E.K., RaoTask, M.V.C.

“…In this paper, GA path-planning approach is enhanced with feasible path detection mechanism based on traversability vectors method. …”
Get full text
Get full text
Get full text

An improved narrowband active noise control system without secondary path modelling based on the time domain by Mondal, Kuheli, Das, Saurav, Hamada, Nozomu, Haji Abu, Aminudin, Das, Saikat, Faris, Waleed Fekry, Toh, Hoong Thiam, Ahmad, Akij

Get full text
Get full text
Get full text
Get full text

Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

“…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
Get full text
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

“…Firstly, the study concludes that the adoptions of the flexible approach in estimation can model the binary feature of CVDs and non-linear paths in the complex path models. The estimated CVDs path model can be implemented as a disease delay strategy in clinical settings. …”
Get full text
Get full text

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
Get full text

False path identification algorithm framework for nonseparable controller-data path circuits by Shaheen, Ateeq U. R., Hussin, Fawnizu Azmadi, Hamid, Nor Hisham

“…This paper proposes an algorithm frame-work to deal with these false paths through identification for DFT test. …”
Get full text
Get full text

Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

“…Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. …”
Get full text
Get full text
Get full text

Robot manipulator minimum jerk trajectory planning based on the improved dung Beetle Optimizer Algorithm by Ma, Haohao, As’arry, Azizan, Cong, Miaomiao, Delgoshaei, Aidin, Ismail, Mohd Idris Shah, Ramli, Hafiz Rashidi, Wu, Xuping

Get full text
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

Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

“…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
Get full text
Get full text

False path identification algorithm framework for nonseparable controller-data path circuits by Shaheen, A.-U.-R., Hussin, F.A., Hamid, N.H.

“…This paper proposes an algorithm framework to deal with these false paths through identification for DFT test. …”
Get full text
Get full text

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

“…This paper develops a path planning algorithm of hyper-redundant manipulators to achieve a cyclic property. …”
Get full text
Get full text
Get full text

Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article by Saliman, Nur Farah Ain

“…It focuses on the complexity in the trace back scanning architecture design based on structural modelling technique. …”
Get full text
Get full text