Search Results - (( initial solving path algorithm ) OR ( using optimization method algorithm ))
Search alternatives:
- method algorithm »
- initial solving »
- path algorithm »
- solving path »
-
1
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
Published 2023“…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
2
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
3
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
4
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
5
Path planning algorithm for a car like robot based on MILP method
Published 2013“…This approach is that the path optimization can be easily solved using the CPLEX optimization software with AMPL interface / MATLAB. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
7
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
8
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
9
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
Get full text
Get full text
Thesis -
10
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
11
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
12
Using artificial intelligence search in solving the camera placement problem
Published 2022“…Following the coverage modeling, an optimization method needs to be used to locate the optimal poses and/or camera positions. …”
Get full text
Get full text
Book -
13
Minimum switching losses for solving distribution NR problem with distributed generation
Published 2018“…The results confirmed the effectiveness of the proposed method in determining the optimal path of switching operations, as well as the optimal network configuration and optimal output of DG units.…”
Get full text
Get full text
Article -
14
Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin
Published 2013“…The problem was initially tackled by “exact methods” such as the branch and bound method, which is based on the exhaustive enumeration of a restricted region of solutions containing exact optimal solutions. …”
Get full text
Get full text
Get full text
Thesis -
15
Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method
Published 2023“…This work intends to solve the path navigation with obstacle avoidance problem explicitly by using a numerical approach, where the mobile robot must project a route to outperform the efficiency of its travel from any initial position to the target location in the designated area. …”
Get full text
Get full text
Get full text
Get full text
Article -
16
Search algorithms for path planning problems in harsh wireless sensor network environment
Published 2017“…Each algorithm solves its respective problem with Enhanced D* solving long initial delay in dynamic environment, NBN solves harsh conditions with limited computational power, and FWN optimized the result of TSP path planning problem with minimal computational effort. …”
Get full text
Get full text
Thesis -
17
Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller
Published 2010“…In this regards, a new method of Pico-satellite attitude control using Mamdani Fuzzy Logic Principles is introduced. …”
Get full text
Thesis -
18
Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms
Published 2025“…The VFSMRCTP model is solved using the TLDW-JS algorithm and a number of comparison algorithms in order to analyze the algorithm’s performance. …”
Get full text
Get full text
Get full text
Article -
19
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
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 -
20
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. …”
Get full text
Get full text
Get full text
Article
