Search Results - (( program _ ((method algorithm) OR (path algorithm)) ) OR ( java application modified algorithm ))

Search alternatives:

Refine Results
  1. 1
    Path planning algorithm for a car like robot based on MILP method

    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
    Save to List
    Saved in:
  2. 2
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

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

    Published 2004
    “…This means A • algorithm only calculates and consider the next node m path that has the lowest value of G and F, plus searching the shortest route by using heuristic estimation in Manhattan method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming

    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

    Published 2016
    “…This paper will review and compare the performances of those existing methods that can find solution without graph search algorithm such as Mixed-Integer Linear Programming (MILP) techniques which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…The simulation results indicate that the algorithm is able to segregate and assign the tasks for each scanning head and also able to find the shortest scanning path for different types of objects coordination. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    MAZE ROBOT: APPLYING AUTONOMOUS VEHICLE NAVIGATION ALGORITHM WITH EVENT-DRIVEN PROGRAMMING

    MAZE ROBOT: APPLYING AUTONOMOUS VEHICLE NAVIGATION ALGORITHM WITH EVENT-DRIVEN PROGRAMMING by ABDUL MALEK, NADHIRA

    Published 2011
    “…Event-driven programming method was applied in producing the maze navigation algorithm for the robot.…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  6. 6
    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem

    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

    Published 2024
    Article
    Save to List
    Saved in:
  7. 7
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Scheduling of batch process plant / Abdul Aziz Abu Bakar

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

    Published 1995
    “…This research work is devoted to software development of scheduling and control algorithm of batch process plant using shortest path method developed by Dijkstra and K* shortest path method developed by Jin Y. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  9. 9
    Development of real-time navigation system by using pure pursuit guidance for unmanned surface vehicle

    Development of real-time navigation system by using pure pursuit guidance for unmanned surface vehicle by Putri Nur Farhanah, Mohd Shamsuddin

    Published 2024
    “…The Pure Pursuit algorithm works by focusing on the nearby path relative to the USV's position, guiding it with steering directions based on its current position and orientation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail

    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail by Ismail, Zafhira

    Published 2017
    Subjects: Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution

    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

    Published 2017
    “…The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution; secondly, the algorithm has proven its success in solving the problem and finds a shortest route. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Developing and validating a simulation model for counting and classification of vehicles

    Developing and validating a simulation model for counting and classification of vehicles by Ali Emad Jehad, Riza Atiq O.K. Rahmat

    Published 2016
    “…The algorithm program was developed to detect vehicles in traffic videos and get the vehicle count for the small time period as an assistance tool for a researcher who seeks vehicle counting.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Optimum Time-Cost Trade-Off Strategies on Critical Path Method for Project Management

    Optimum Time-Cost Trade-Off Strategies on Critical Path Method for Project Management by Khalaf, Wakas S.

    Published 2010
    “…Approach of Crashing Critical Activities (CCA) was originally developed along with the Critical Path Method (CPM) for planning and controlling large scale projects in the late 50s. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Path Following Using A Learning Neural Network

    Path Following Using A Learning Neural Network by NHH , Mohamad Hanif

    Published 2004
    “…Two algorithms, gradient descent and quasi-Newton which utilize a batch training method, are introduced as comparison to the gradient descent method that incorporates the online (or incremental) training method. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  16. 16
    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman

    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Very Large Scale Integration Cell Based Path Extractor For Physical To Layout Mapping In Fault Isolation Work

    Very Large Scale Integration Cell Based Path Extractor For Physical To Layout Mapping In Fault Isolation Work by Pragasam, Matthew

    Published 2017
    “…To be able to retrieve all possible signals involved within a suspected boundary is a popular search computational problem. Therefore the path extractor program proposed incorporates the characteristics of a depth-first search algorithm by considering the specifications of a cell-based design. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi

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

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
    Save to List
    Saved in:
  20. 20
    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
    Save to List
    Saved in:

Search Tools: