A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound.
Yukihide KohiraSuguru SuehiroAtsushi TakahashiPublished in: ASP-DAC (2009)
Keyphrases
- dynamic programming
- times faster
- detection algorithm
- upper bound
- k means
- preprocessing
- worst case
- computational cost
- recognition algorithm
- learning algorithm
- np hard
- high accuracy
- experimental evaluation
- matching algorithm
- theoretical analysis
- simulated annealing
- search space
- optimal solution
- neural network
- network topology
- multicast routing
- shortest path problem
- path length
- total length
- mobile robot
- significant improvement
- computational complexity
- decision trees
- genetic algorithm