A Rapidly-Exploring Random Tree Algorithm with Reduced Random Map Size.
Aphilak LonklangJános BotzheimPublished in: ICARA (2023)
Keyphrases
- randomly generated
- computational complexity
- tree structure
- detection algorithm
- binary tree
- np hard
- cost function
- experimental evaluation
- learning algorithm
- high accuracy
- preprocessing
- single pass
- dynamic programming
- scales linearly
- memory requirements
- times faster
- k means
- search space
- optimal solution
- similarity measure
- tree construction
- em algorithm
- maximum a posteriori probability
- window size
- spanning tree
- randomly sampled
- graph structure
- convergence rate
- optimization algorithm
- particle swarm optimization
- simulated annealing
- computational cost
- objective function
- image segmentation