Search Results - (( using function based algorithm ) OR ( a constructive path algorithm ))

Refine Results
  1. 1

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

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

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

    Published 2017
    “…A model-driven approach was used for generating abstract test cases from the feasible paths. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Development of a motion planning and obstacle avoidance algorithm using adaptive neuro fuzzy inference system for mobile robot navigation by Muslim, Farah Kamil Abid

    Published 2017
    “…Finally, the last objective is to improve the optimality of the new approach using a robust Machine Learning strategy. An adaptive neuro-fuzzy inference system (ANFIS) was designed which constructs and optimizes a fuzzy logic controller using a given dataset of input/output variables in order for the mobile robot to learn. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Autonomous path planning through application of rotated two-parameter overrelaxation 9-point Laplacian iteration technique by W. K. Ling, A. A. Dahalan, Azali Saudi

    Published 2020
    “…The harmonic functions are an appropriate method to be used on autonomous path planning because it satisfies the min-max principle, therefore avoiding the occurrence of local minima which traps robot’s movements, and that it offers complete path planning algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    A collision resistant cryptographic hash function based on cellular automata rules by Jamil, Norziana

    Published 2013
    “…The security analysis shows that STITCH-256 is resistant against all the generic attacks and it is very difficult to construct a small list of conditions that gives a successful construction of collision path. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Development of robot kit for visually impaired by Chee, Fang Lit

    Published 2017
    “…Thus, the speed of the wheels is based on the condition of environment. To test the functionality of the obstacle avoidance algorithm, the guidance robot is tested in three different situations. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  8. 8

    Modeling and sensitivity analysis of a multi-nets anns model for real-time performance-based condition monitoring of an industrial gas turbine engine by Tahan, M., Sarwar, U., Muhammad, M., Abdul Karim, Z.A.

    Published 2016
    “…Three-layer feed-forward configuaration is chosen to construct the networks, the Levenberg-Marquardt algorithm is used as the training function, and the k-fold cross-validation process is employed to obtain the optimum number of neurons in the hidden layers. …”
    Get full text
    Get full text
    Article
  9. 9

    Modeling and sensitivity analysis of a multi-nets anns model for real-time performance-based condition monitoring of an industrial gas turbine engine by Tahan, M., Sarwar, U., Muhammad, M., Abdul Karim, Z.A.

    Published 2016
    “…Three-layer feed-forward configuaration is chosen to construct the networks, the Levenberg-Marquardt algorithm is used as the training function, and the k-fold cross-validation process is employed to obtain the optimum number of neurons in the hidden layers. …”
    Get full text
    Get full text
    Article
  10. 10

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

    Published 2013
    “…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  11. 11

    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
  12. 12

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…In the initial stage, the test environments were constructed. Subsequently, both algorithms were applied to the test environments. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Wi-fi fingerprint database construction using Chebyshev wavelet functions by Narzullaev, Anvar, Nemadaliev, Azamjon, Selamat, Mohd Hasan, Othman, Mohamed, Sharif, Khaironi Yatim

    Published 2015
    “…Our algorithm requires only a few samples to be collected in a given region, and thus significantly reduces the calibration time. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    An efficient algorithm to improve oil-gas pipelines path by Hasan Almaalei, Nabeel Naeem, Mohd Razali, Siti Noor Asyikin, Mohammed Alduais, Nayef Abdulwahab

    Published 2018
    “…Therefore, the aim of this study is to propose a new algorithm to obtain the shortest path connecting oil-gas wells and addressing obstacles that may appear on the path connecting any two wells. …”
    Get full text
    Article
  16. 16

    The impact of clustering on the average path length in wireless sensor networks by Aziz, A.A., Şekercioğlu, Y. A.

    Published 2015
    “…Clustering algorithms have been widely used in wireless sensor networks for virtual backbone construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

    Published 2020
    “…Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
    Get full text
    Get full text
    Student Project
  20. 20

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

    Published 2014
    “…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis