Anytime dynamic A*: an anytime, replanning algorithm
- Journal
- International Conference on Automated Planning and Scheduling
In The Last Decade
doi.org/w9457685 →Countries where authors are citing Anytime dynamic A*: an anytime, replanning algorithm
This map shows the geographic impact of Anytime dynamic A*: an anytime, replanning algorithm. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anytime dynamic A*: an anytime, replanning algorithm with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anytime dynamic A*: an anytime, replanning algorithm more than expected).
Fields of papers citing Anytime dynamic A*: an anytime, replanning algorithm
This network shows the impact of Anytime dynamic A*: an anytime, replanning algorithm. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Anytime dynamic A*: an anytime, replanning algorithm.
About Anytime dynamic A*: an anytime, replanning algorithm
This paper, published in 2005, received 392 indexed citations . Written by Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz and Sebastian Thrun covering the research area of Software, Artificial Intelligence and Computer Vision and Pattern Recognition. It is primarily cited by scholars working on Computer Vision and Pattern Recognition (343 citations), Aerospace Engineering (204 citations) and Control and Systems Engineering (114 citations). Published in International Conference on Automated Planning and Scheduling.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.
This paper is also available at doi.org/w9457685.