Search Results - (( based constructive method algorithm ) OR ( using simulation path algorithm ))
Search alternatives:
- based constructive »
- method algorithm »
- simulation path »
- path algorithm »
-
1
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
Get full text
Thesis -
2
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
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 -
3
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…This model driven approach was integrated with the proposed infeasible path detection method which based on analyzing various OCL constructs and operations. …”
Get full text
Get full text
Get full text
Thesis -
4
Design and modelling of an autonomous robotic airship with soft computing control
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 -
5
Time-Uncertainty Analysis by Using Simulation in Project Scheduling Networks
Published 1999“…In this study, Monte Carlo simulation as a tool of risk analysis was used. The merge event bias as one of the essential problems associated with PERT is discussed, along with models and approaches developed by other researchers, namely, Probabilistic Network Evaluation Technique (PNET algorithm), Modified PNET, Back-Forward Uncertainly Estimation procedure (BFUE) and concept based on the robust reliability idea. …”
Get full text
Get full text
Thesis -
6
Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks
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 -
7
Comparison of path planning in simulated robot
Published 2020“…Thus, a comparison of path planning algorithm in simulated robot will be conducted in this study. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
8
Implementation of laser simulator in robot path determination
Published 2016“…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
Undergraduates Project Papers -
9
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…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
Thesis -
10
Global Mobile Robot Path Planning using Laser Simulator
Published 2017“…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
Conference or Workshop Item -
11
Autonomous path planning robot using geographical information
Published 2008“…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
Learning Object -
12
Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space
Published 2015“…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
Article -
13
Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site
Published 2017“…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
Final Year Project -
14
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…All simulations were performed using MATLAB with visualization of UAV path planning. …”
Get full text
Get full text
Thesis -
15
Path planning for constant speed robot
Published 2006“…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
Thesis -
16
Simulation of identifying shortest path walkway in library by using ant colony optimization
Published 2012Get full text
Get full text
Undergraduates Project Papers -
17
-
18
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
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
New algorithm for autonomous dynamic path planning in real-time intelligent robot car
Published 2017“…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
Article -
20
A robust GA-based QoS routing algorithm for solving multi-constrained path problem
Published 2023“…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. …”
Article
