Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments.
Adel AmmarHachemi BennaceurImen ChâariAnis KoubâaMaram AlajlanPublished in: Soft Comput. (2016)
Keyphrases
- planning problems
- linear complexity
- grid environment
- heuristic search
- state space
- domain independent
- mobile robot
- job scheduling
- data grids
- goal state
- ai planning
- probabilistic planning
- planning systems
- optimal solution
- htn planning
- grid services
- grid computing
- data access
- planning domains
- partial observability
- classical planning
- security issues
- deterministic domains
- solving planning problems
- data transfer
- humanoid robot
- multi robot
- path planning
- orders of magnitude
- object oriented
- dynamic programming
- load balancing