Hierarchical A* based path planning - A case study

Knowledge-Based Systems

Volumn 15, Issue 1-2, 2002, Pages 53-66

  Autere, Antti ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

A*; Heuristic search; Resource allocation; Robot point to point path planning

Indexed keywords

COLLISION AVOIDANCE; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; MOTION PLANNING;

HEURISTIC SEARCH;

ROBOTICS;

EID: 0036138266     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0950-7051(01)00121-6     Document Type: Article

References (21)

1. A* as an optimal resource allocation policy in path finding problems
2. Robot motion planning by A* search on a modified discretized configuration space
3. A subdivision algorithm in configuration space for findpath with rotation
4. Solving findpath by combination of goal-directed and randomized search
5. Path planning using Laplace's equation
6. The optimality of A* revisited
7. Path planning using a Jacobian-based freespace generation algorithm
8. Spatial planning: A configuration space approach
9. Obbtree: A hierarchical structure for rapid interference detection
10. A. formal, basis for the heuristic determination on minimum cost paths
11. Motion planning with many degrees of freedom - Random reflections at c-space obstacles
12. Gross motion planning - A survey
13. Integration of the artificial potential field approach with simulated annealing for robot path planning
14. Randomized preprocessing of configuration space for fast path planning
15. Fast path planning for robot manipulators using numerical potential fields in the configuration space
16. Analogue computation of collision-free paths
17. Fast path planning using modified A* method