Search Results - (( based constructive path algorithm ) OR ( data simulation based algorithm ))

Search alternatives:

Refine Results
  1. 1
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    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
    Save to List
    Saved in:
  2. 2
    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed

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

    Published 2017
    “…The second contribution of this thesis is developing an accurate search-based test data generator for generating automatically optimal test data to satisfy the whole constraints in the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

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

    Published 2014
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Multi agent quality of service routing based on scheme ant colony optimization algorithm

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

    Published 2019
    “…In this paper, a novel sampling-based algorithm is proposed which is able to plan in an unknown environment and provides solutions with lower cost in terms of path length, runtime and stability of the results. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar W., Hong T.S., Sahari K.S.M., Khaksar M., Torresen J.

    Published 2023
    Article
    Save to List
    Saved in:
  7. 7
    Design and modelling of an autonomous robotic airship with soft computing control

    Design and modelling of an autonomous robotic airship with soft computing control by Wong, Wei Kitt

    Published 2012
    “…Along with the prototype airship, a path planner was also proposed for the UAV for the purpose of obstacle avoidance and path optimization using genetic algorithm to minimize on the distance travelled and to generate the shortest path to cover the specified waypoints. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Ant system with heuristics for capacitated vehicle routing problem

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…The ASH algorithm is basically applied with its probabilistic decision rule and pheromone feedback to construct the sequences of customers to be visited in the CVRP solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    New optimization feature for the developed open cnc controller based on ISO 6983 and ISO 14649

    New optimization feature for the developed open cnc controller based on ISO 6983 and ISO 14649 by Obayes, Noor Hatem

    Published 2021
    “…The system is composed of ISO data interface models interpretation, tool path optimization, 3D simulation, and automatic document generation modules. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks

    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
    Save to List
    Saved in:
  11. 11
    Differential evolution optimization for constrained routing in Wireless Mesh Networks

    Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

    Published 2014
    “…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  12. 12
    Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks

    Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks by Abdulla Mogaibel, Hassen Abd-Almotaleb

    Published 2016
    “…However, as a result of contention-based nature of IEEE 802.11-based wireless mesh network, the node capacity is limited by the contention, interference caused by hidden nodes, data transmission over low rate links, and frequent interface switching. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

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

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Efficient hybrid flooding scheme for ad-hoc on-demand distance vector routing protocol in MANET

    Efficient hybrid flooding scheme for ad-hoc on-demand distance vector routing protocol in MANET by Waheed, Bassam M.S.

    Published 2014
    “…Thresholds selection is based on three performance metrics namely: maintenance overhead, number of times the links break and data delivery ratio. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Autonomous path planning robot using geographical information

    Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

    Published 2008
    Get full text
    Learning Object
    Save to List
    Saved in:
  16. 16
    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:
  17. 17
    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff

    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
    “…Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…The objectives of this study are to construct the distance matrix and sequence matrix based on the network layout and to find the shortest path to collect the item in the warehouse. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  19. 19
    AUTOMATED GUIDED ROBOT (AGR)

    AUTOMATED GUIDED ROBOT (AGR) by Abd Rahim, Mohd Azlan Shah

    Published 2007
    “…Algorithm conversion to C code programming has been done throughout the project for the obstacle avoidance and path planning algorithms based upon the GA platform ofAI.…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  20. 20
    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]

    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
    “…Moreover, Dijkstra algorithm is applied to find the shortest path. The shortest path is calculated by using C programming of Dev C++. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: