A pathfinding problem for search trees with unknown edge length.
Kunihiko HiraishiKoichi KobayashiPublished in: J. Discrete Algorithms (2018)
Keyphrases
- path finding
- branching factor
- search tree
- search algorithm
- heuristic search
- path planning
- tree search
- search space
- hill climbing
- optimal path
- search strategy
- sat solvers
- branch and bound algorithm
- machine learning
- heuristic function
- rule learning
- evaluation function
- b tree
- first order logic
- mobile robot
- data model
- complexity analysis
- branch and bound
- data analysis
- state space
- special case