Two-way D∗ algorithm for path planning and replanning-Reference-Cited by-同舟云学术

Two-way D∗ algorithm for path planning and replanning

Published:2011-05 Issue:5 Volume:59 Page:329-342
ISSN:0921-8890
Container-title:Robotics and Autonomous Systems
language:en
Short-container-title:Robotics and Autonomous Systems

Author:

Dakulović Marija,Petrović Ivan

Publisher

Elsevier BV

Subject

Computer Science Applications,General Mathematics,Software,Control and Systems Engineering

Reference26 articles.

1. Robot Motion Planning;Latombe,1991

2. Artificial Intelligence: A Modern Approach;Russell,1995

3. A formal basis for the heuristic determination of minimum cost paths;Hart;IEEE Transactions on Systems Science and Cybernetics,1968

4. A. Stentz, Optimal and efficient path planning for partially-known environments, Robotics and Automation, 1994, in: Proceedings, 1994 IEEE International Conference on, 1994, pp. 3310–3317.

5. A. Stentz, The focussed D* algorithm for real-time replanning, in: International Joint Conference on Artificial Intelligence, vol. 14, 1995, pp. 1652–1659.

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Autonomous hierarchy creation for computationally feasible near-optimal path planning in large environments;Robotics and Autonomous Systems;2024-02

2. An autonomous coverage path planning algorithm for maritime search and rescue of persons-in-water based on deep reinforcement learning;Ocean Engineering;2024-01

3. Fast Path Planning Algorithm for 3D Indoor Scene Roaming Based on Path Table;Lecture Notes in Computer Science;2024

4. Smooth Autonomous Patrolling for a Differential-Drive Mobile Robot in Dynamic Environments;Sensors;2023-08-25

5. Formation Flight of Multiple UAVs Using Artificial Potential Field Algorithm;AIAA AVIATION 2023 Forum;2023-06-08