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

Refine Results
  1. 1

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

    Published 2018
    “…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
    Thesis
  2. 2

    A Survey Of Supervised Machine Learning In Wireless Sensor Network: A Power Management Perspective by Ul haq, Riaz, Norrozila, Sulaiman, Muhammad, Alam

    Published 2013
    “…This survey paper is focused on the discussion of best optimal path routing algorithms in wireless sensor networks by using supervised machine learning approaches. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

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

    Published 2008
    “…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
    Thesis
  4. 4

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
    Get full text
    Get full text
    Thesis
  5. 5

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  6. 6

    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

    Published 2021
    “…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…It makes use of three basic operations in order to optimize this problem. …”
    Get full text
    Get full text
    Thesis
  9. 9

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

    Published 2013
    “…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
    Thesis
  10. 10

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  13. 13

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

    Published 2024
    “…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”
    thesis::doctoral thesis
  15. 15

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. …”
    Get full text
    Get full text
    Thesis
  16. 16

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

    Published 2014
    “…Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    A novel Bezier curve control point search algorithm for autonomous navigation using N-order polynomial search with boundary conditions by Sajith, Akhil Vinayak, Zakaria, M. A., Baarath, K., Anwar, P. P. Abdul Majeed

    Published 2021
    “…However, the Bezier curve is the most widely used in the curve fitting algorithm for vehicle path planning as it can generate a possible number of path maneuvers. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

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

    Published 2025
    “…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
    Thesis
  19. 19

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal