Search Results - some ((growth algorithm) OR (path algorithm))

Map navigation for mobile tourist / Rohana Abd Jalil by Abd Jalil, Rohana

“…Because of some constraint, so this system is not exploring more on the development of algorithm and representation of map. …”
Get full text
Get full text

Multi-Robot Path-Planning algorithm for automated parcel sorting centre with ring road layout by Jong, Qian Biao

“…Since the automated warehouses and sorting centres are usually large and contain hundreds of robots, the recent algorithms with the simple grid layout assumption are doubted to be efficient in the real world. …”
Get full text
Get full text

Research on risk detection of autonomous vehicle based on rapidly-exploring random tree by Yincong Ma, Lim, Kit Guan, Tan, Min Keng, Sin, Helen Ee Chuo, Ali Farzamnia, Tze, Kenneth Kin Teo

“…Although it has been applied in many fields, there are still some problems, such as low efficiency of path planning and collision risk during driving. …”
Get full text
Get full text
Get full text
Get full text

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

“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text

A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
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.

“…The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.…”
Get full text
Get full text

A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
Get full text

Indoor global path planning based on critical cells using dijkstra algorithm by Azrul Amri, Jamal, Engku Fadzli Hasan, Syed Abdullah, Fatma Susilawati, Mohamad

“…The algorithm uses floor plan of any environment discretized to some equal-sized square grids. …”
Get full text
Get full text

Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

“…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
Get full text
Get full text
Get full text

Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

“…Nonetheless, the A • algorithm do have some unique properties which is more efficient in finding the shortest path especially in human real-world problem. …”
Get full text
Get full text

Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

“…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
Get full text
Get full text
Get full text
Get full text

Reusable data-path architecture for encryption-then-authentication on FPGA by Abbas Y.A., Jidin R., Jamil N., Zaba M.R.

“…This paper proposes reusable data-path architecture for lightweight cryptography algorithms, reusing some similar hardware components for both encryption and authentication. …”

Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

“…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
Get full text
Get full text
Get full text
Get full text

A review on path planning and obstacle avoidance algorithms for autonomous mobile robots by Anis Naema Atiyah, Rafai, Noraziah, Adzhar, Nor Izzati, Jaini

“…This paper reviews the mobile robot navigation approaches and obstacle avoidance used so far in various environmental conditions to recognize the improvement of path planning strategists. Taking into consideration commonly used classical approaches such as Dijkstra algorithm (DA), artificial potential field (APF), probabilistic road map (PRM), cell decomposition (CD), and meta-heuristic techniques such as fuzzy logic (FL), neutral network (NN), particle swarm optimization (PSO), genetic algorithm (GA), cuckoo search algorithm (CSO), and artificial bee colony (ABC). …”
Get full text
Get full text
Get full text
Get full text

Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

“…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
Get full text
Get full text
Get full text

Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

“…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
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

Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia by Ahmad, Ab. Rahman, Zenon , Nasaruddin, Hassan, Haswadi

“…There are many algorithms have been designed to find these paths. The algorithms such as Djikstra, Bellman-Ford or Floyd- Warshall are difference from one to another due to the simplicity, effectiveness and duration of processing the nodes. …”
Get full text
Get full text

Global Mobile Robot Path Planning using Laser Simulator by Ali, Mohammed A. H., Wan Azhar, Wan Yusoff, Zamzuri, Hamedon, Zulkifli, Md. Yusof, Musa, Mailah

“…From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
Get full text
Get full text
Get full text
Get full text

Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

“…The Bees Algorithm was run using R Software. The results found are compared with the results of other algorithms in terms of the drill path length and machining time. …”
Get full text
Get full text
Get full text
Get full text