Improved fast replanning for robot navigation in unknown terrain

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2002, Pages 968-975

  Koenig, Sven ^a   Likhachev, Maxim ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; MOTION PLANNING; NAVIGATION;

FAST REPLANNING; ROBOT NAVIGATION;

MOBILE ROBOTS;

EID: 0036055626     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees
2. GRAMMPS: A generalized mission planner for multiple mobile robots
3. Path planning and navigation of mobile robots in unknown environments
4. Fully dynamic algorithms for maintaining shortest paths trees
5. Experiments with driving modes for urban robots
6. Hybrid evolutionary motion planning using follow boundary repair for mobile robots
7. Incremental A*
8. Lifelong planning A* and dynamic A* lite: The proofs
9. A portable, autonomous, urban reconnaissance robot
10. A new solution for path planning in partially known or unknown environment for nonholonomic mobile robots
11. An incremental algorithm for a generalization of the shortest-path problem
12. Optimal and efficient path planning for partially-known environments
13. The focussed D* algorithm for real-time replanning
14. A complete navigation system for goal acquisition in unknown environments
15. Optimal route re-planning for mobile robots: A massively parallel incremental A* algorithm
16. Distributed robotic mapping of extreme environments
17. Differential A*: An adaptive search method illustrated with robot path planning for moving obstacles and goals, and an uncertain environment