Search Results - same ((growth algorithm) OR (((path algorithm) OR (based algorithm))))

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

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

“…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah A., Parman S., Abbasi A., Solihin M.I., Manan T.S.A., Beddu S., Ahmad A., Rasdi N.W.

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

The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement by Hosseini E., Al-Ghaili A.M., Kadir D.H., Daneshfar F., Gunasekaran S.S., Deveci M.

“…In this study, a new idea centered on seed growth, Seed Growth Algorithm (SGA), as a conditional convergent evolutionary algorithm is proposed for optimizing several discrete and continuous optimization problems. …”

Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

“…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
Get full text
Get full text
Get full text
Get full text

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text

Range sensor based local path planning algorithm for mobile robot in unknown static environment with beacon / Wan Ahmad Jailani Wan Ngah by Wan Ngah, Wan Ahmad Jailani

“…The Bug algorithm is a local path planning methodology for mobile robot which detects the nearest obstacle as the robot moves towards a target with no or very limited information about the environment. …”
Get full text
Get full text

Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

“…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
Get full text
Get full text
Get full text
Get full text

Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

“…By combining physical layer capacity with MAC layer estimated congestion value, a new delay-based load-balancing routing (DLBR) algorithm is proposed in this paper. …”
Get full text
Get full text

Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

“…By combining physical layer capacity with MAC layer estimated congestion value, a new delay-based load-balancing routing (DLBR) algorithm is proposed in this paper. …”
Get full text
Get full text

Transmission path optimization Based on Efficiency Communication System by Jin Fan, Kit, Guan Lim, Sin, Helen Ee Chuo, Min, Keng Tan, Ali Farzamnia, Tze, Kenneth Kin Teo

“…In this paper, routing attribute table that is maintained by the nodes, the density and relative distance of node distribution, is used to determine the clustering method. At the same time, the developed algorithm combines the relative position of the cluster and the base station to further improve the routing method of the sub-cluster head, Finally, the algorithm analyzes the influence of different parameters on the transmission path, and use the simulation experiments to evaluate the conclusions.…”
Get full text
Get full text
Get full text
Get full text

Token based path allocation approach for mobile robots in sorting centre for achieving high throughput by Khoo, Zong Zheng

“…This project proposes an improved path-finding algorithm that implements token-based path finding while a robot wants to access a grid cell. …”
Get full text
Get full text

Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

“…In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
Get full text
Get full text
Get full text

UAV collision detection algorithm design based on circle overlapping test by Radzi, N.F.M., Mubin, M., Rahim, N.A., Mokhtar, N.

“…This paper proposes a design of collision avoidance algorithm for unmanned aerial vehicle based on circle overlapping test. …”
Get full text
Get full text

Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm by Enshaei, Mehdi

“…In this study, a new defence mechanism is proposed based on modification of the packet forwarding process, using Neighborhood Information (NI) and PT algorithm, and known as NIPT algorithm. …”
Get full text
Get full text

General Algorithm of n-Multiple Coil Shape for Variable Links Hyper-Redundant Robotic Manipulator by Jamali, Annisa, Khan, Md. Raisuddin, Rahman , Md Mozasser

“…An algorithm is then developed to control the links of the robot along the path so that the robot will travel in such a way that each of the follower links will take place of the earlier link‘s position. …”
Get full text
Get full text
Get full text

The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi by Mohd Radzi, Mohamad Khairul Ikhwan

“…However, for optimum distance, dijkstra algorithm has been used. This algorithm is one of the algorithms used for getting the lowest cost search path. …”
Get full text
Get full text

Adaptable decentralized orchestration engine for block structured non-transactional workflow in service oriented architecture. by Esfahani, Faramarz Safi

“…The latter considers the frequent-path adaptability and both of them together satisfy both frequent-path and proportionalfragment adaptability aspects; v) A Fuzzy Decentralization Decision Making algorithm (FDDM) is presented based on the fuzzy logic to choose a suitable method of decentralization that satisfies the three adaptability aspects frequent-path,proportional- fragment and available-bandwidth; and, vi) an algorithm is introduced for wiring of dynamic fragments. …”
Get full text
Get full text

NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment by Shen, jiazheng, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan, Wang, Xinming

“…By comparing the total distance and maximum deviation of multiple robot systems, it is proven that this algorithm can effectively balance the path length of each robot in task allocation. …”
Get full text
Get full text
Get full text