Ant Colony Algorithm Based on Upper Bound of Nodes for Robot Path Planning Problems.
Sizhi QiuBo HuYongbin QuanXiaoxin JianHaibin OuyangPublished in: BIC-TA (1) (2019)
Keyphrases
- planning problems
- ant colony algorithm
- upper bound
- shortest path
- global optimization
- state space
- heuristic search
- lower bound
- ant colony
- domain independent
- improved ant colony algorithm
- mathematical model
- goal state
- mobile robot
- planning domains
- ai planning
- distribution network
- ant colony optimization
- planning systems
- probabilistic planning
- solving planning problems
- humanoid robot
- htn planning
- path planning
- bp neural network
- partial observability
- classical planning
- planning tasks
- fully observable
- stochastic domains
- deterministic domains
- search algorithm
- objective function
- causal graph
- binary decision diagrams
- planning graph
- evolutionary algorithm
- swarm intelligence
- artificial neural networks