RTTES: Real-time search in dynamic environments
Applied Intelligence
Moving target search in grid worlds
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Comparing real-time and incremental heuristic search for real-time situated agents
Autonomous Agents and Multi-Agent Systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
The fringe-saving A* search algorithm: a feasibility study
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Real-time moving target evaluation search
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Efficient incremental search for moving target search
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Graph-based planning using local information for unknown outdoor environments
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A learning approach to integration of layers of a hybrid control architecture
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Real-time navigation for a mobile robot based on the autonomous behavior agent
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Autonomous Agents and Multi-Agent Systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Two-way D* algorithm for path planning and replanning
Robotics and Autonomous Systems
Adaptive navigation for autonomous robots
Robotics and Autonomous Systems
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Real-Time path planning strategies for real world application using random access sequence
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
A new hybrid navigation algorithm for mobile robots in environments with incomplete knowledge
Knowledge-Based Systems
Real-time density-based crowd simulation
Computer Animation and Virtual Worlds
Path planning with variable-fidelity terrain assessment
Robotics and Autonomous Systems
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Physical search problems with probabilistic knowledge
Artificial Intelligence
A review of path planning and mapping technologies for autonomous mobile robot systems
Proceedings of the 5th ACM COMPUTE Conference: Intelligent & scalable system technologies
Navigation for indoor mobile robot based on wireless sensor network
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Hi-index | 0.00 |
Mobile robots often operate in domains that are only incompletely known, for example, when they have to move from given start coordinates to given goal coordinates in unknown terrain. In this case, they need to be able to replan quickly as their knowledge of the terrain changes. Stentz' Focussed Dynamic A* (D*) is a heuristic search method that repeatedly determines a shortest path from the current robot coordinates to the goal coordinates while the robot moves along the path. It is able to replan faster than planning from scratch since it modifies its previous search results locally. Consequently, it has been extensively used in mobile robotics. In this article, we introduce an alternative to D* that determines the same paths and thus moves the robot in the same way but is algorithmically different. D* Lite is simple, can be rigorously analyzed, extendible in multiple ways, and is at least as efficient as D*. We believe that our results will make D*-like replanning methods even more popular and enable robotics researchers to adapt them to additional applications.