Search Results - (( initial solution path algorithm ) OR ( probable distribution function algorithm ))
Search alternatives:
- probable distribution »
- function algorithm »
- initial solution »
- path algorithm »
-
1
Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach
Published 2024“…To address the nutcracker algorithm’s sensitivity to initial conditions and slow convergence, a population initialization strategy is introduced for more diverse initial populations. …”
Get full text
Get full text
Get full text
Article -
2
An empirical study of density and distribution functions for ant swarm optimized rough reducts
Published 2011“…To describe relative probability of different random variables, Probability Density Function (PDF) and the Cumulative Density Function (CDF) are capable to specify its own characterization of Gaussian distributions. …”
Get full text
Get full text
Get full text
Book Chapter -
3
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
Published 2023“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
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“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
5
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
6
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
7
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
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“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
9
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
10
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
11
A Comparative Performance Analysis of Gaussian Distribution Functions in Ant Swarm Optimized Rough Reducts
Published 2011“…Coexistence, cooperation, and individual contribution to food searching by a particle (ant) as a swarm (ant) survival behavior, depict the common characteristics of both algorithms. Solution vector of ACO is presented by implementing density and distribution function to search for a better solution and to specify a probability functions for every particle (ant). …”
Get full text
Get full text
Article -
12
Novel distributed algorithm for coalition formation for enhanced spectrum sensing in cognitive radio networks
Published 2017“…The utility function is defined as the average probability of false alarm per cognitive radio user. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
13
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
Get full text
Get full text
Thesis -
14
Solving the optimal path planning of a mobile robot using improved Q-learning
Published 2019“…Yet, despite such advantage, Q-learning exhibits slow convergence to the optimal solution. In order to address this limitation, the concept of partially guided Q-learning is introduced wherein, the flower pollination algorithm (FPA) is utilized to improve the initialization of Q-learning. …”
Get full text
Get full text
Get full text
Article -
15
Novel distributed algorithm for coalition formation in cognitive radio networks for throughput enhancement using matching theory
Published 2017“…The utility function is defined as the average probability of false alarm per cognitive radio user. …”
Get full text
Get full text
Get full text
Get full text
Article -
16
-
17
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
18
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
19
Some families of count distributions for modelling zero-inflation and dispersion / Low Yeh Ching
Published 2016“…The probability function of the counts is often complicated thus a method using numerical Laplace transform inversion for computing the probabilities and the renewal function is proposed. …”
Get full text
Get full text
Thesis -
20
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
