Search Results - (( using simulation path algorithm ) OR ( basic selection path algorithm ))

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

Scheduling of batch process plant / Abdul Aziz Abu Bakar by Abu Bakar, Abdul Aziz

“…Basically this tool can successfully simulate the graphical presentation to solve the shortest path and K* shortest path problem.…”
Get full text
Get full text

Network analysis for GPS UTMnav system: preliminary stage by A. Majid, Siti Nuruljannah, Musa, Tajul Ariffin, Setan, Halim, Musliman, Ivin Amri

“…Each algorithm was reviewed and a simulation test was conducted to evaluate the selected algorithms. …”
Get full text
Get full text
Get full text

Mitigating malicious nodes using trust and reputation based model in wireless sensor networks by Abdullah, Muhammad Daniel Hafiz

“…In order to achieve this, different sets of trust information including QoS, OSNs and ant colony system (ACS) algorithm are proposed to improve the selection of trustworthy node. …”
Get full text
Get full text
Get full text

Enhanced Mobility Solution In Mobile Ipv6 Network by David, Adeniji Oluwashola

“…A framework based on policy based routing protocol was proposed for handling both the inbound and the outbound traffic on a mobile network, under specified policies which consider packet characteristics, current network situation and user preferences. The interface selection algorithm was based on NEMO implementation structure using a technique of mutihoming which was extended to MIPv6 concepts The outcome of this research work are: a designed policy protocol for policy messages communication between the Mobile Router and the Home Agent, the framework is simulated using Network Simulator (NS2) with an extension of mobiwan, the result shows the end to end delay, average end to end delay, overhead, optimal routing path, average inter-packet latency and throughput of the developed system. …”
Get full text
Get full text

Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

“…Thus, a comparison of path planning algorithm in simulated robot will be conducted in this study. …”
Get full text
Get full text

Implementation of laser simulator in robot path determination by Zenas, Chung Han Yuan

“…In addition, one of the classical path planning approach which is A* algorithm will be used to compare the result generated by laser simulator. …”
Get full text
Get full text

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

“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
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

Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

“…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
Get full text

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

“…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
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

Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

“…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
Get full text
Get full text

The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

“…All simulations were performed using MATLAB with visualization of UAV path planning. …”
Get full text
Get full text

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

“…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
Get full text
Get full text

Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

Get full text
Get full text

Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis by Awalin, Lilik J., Syahirah, Abd Halim, Jafferi, Jamaludin, Nor Azuana, Ramli

Get full text
Get full text
Get full text

Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text

New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text

A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

“…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”