A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound.
Yukihide KohiraSuguru SuehiroAtsushi TakahashiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2009)
Keyphrases
- upper bound
- learning algorithm
- worst case
- detection algorithm
- dynamic programming
- objective function
- segmentation algorithm
- np hard
- matching algorithm
- shortest path
- high accuracy
- computational cost
- shortest path problem
- k means
- preprocessing
- computational complexity
- probabilistic model
- particle swarm optimization
- path length
- convergence rate
- optimal path
- times faster
- routing decisions
- load balancing
- experimental evaluation
- cost function
- significant improvement
- optimal solution
- clustering algorithm