The DOI matches its Crossref record; 5 of the 7 references it cites were found in a registry or an index.
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Abstract
Although the problem of determining the minimum cost path through a graph arises naturally in a number of interesting applications, there has been no underlying theory to guide the development of efficient search procedures. Moreover, there is no adequate conceptual framework within which the various ad hoc search strategies proposed to date can be compared. This paper describes how heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching and demonstrates an optimality property of a class of search strategies.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Finally, we chose to use A* (Hart, Nilsson, and Raphael 1968) as part of the approach to creating ERCs over other popular algorithms like Monte Carlo Tree Search (Chaslot et al. 2006) due to its more consistent and reproducible behavior.”
From Expressive Response Curves: Testing Expressive Game Feel with A* (2023) · cites this paper as Hart, Nilsson, and Raphael 1968
In the citing paper
“A* uses a breadth-first approach to visiting graph nodes and a priority queue based on cost and heuristic values to guide the search towards a specific goal (Hart, Nilsson, and Raphael 1968).”
From Expressive Response Curves: Testing Expressive Game Feel with A* (2023) · cites this paper as Hart, Nilsson, and Raphael 1968
In the citing paper
“Unlike breadth-first search, A* is not guaranteed to visit every node in a graph, nor is it guaranteed to find an optimal path without an admissible heuristic, a heuristic function which never over-estimates the distance to the goal (Hart, Nilsson, and Raphael 1968).”
From Expressive Response Curves: Testing Expressive Game Feel with A* (2023) · cites this paper as Hart, Nilsson, and Raphael 1968
Citations
Cites
Freimer, M. L., Bellman, R., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,173
Bellman, R., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 2,027
The shortest path through a maze
Moore, E. (1959) · Medical Entomology and Zoology · Cited by 756
Solutions of the Shortest-Route Problem—A Review
Pollack, M., & Wiebenson, W. (1960) · Operations Research · doi:10.1287/opre.8.2.224 · Cited by 114
Finite Graphs and Networks, An Introduction with Applications.
Harary, F., Busacker, R. G., & Saaty, T. L. (1967) · American Mathematical Monthly · doi:10.2307/2314099 · Cited by 104
Research works printed but not linked: 5
- Busacker, 1965, 3
- Gelernter, 1963, Realization of a geometry-theorem proving machine
- Samuel, 1963, Some studies in machine learning using the game of checkers
- 1959, The Annals of the Computation Laboratory of Harvard University, 30
- Feigenbaum, 1963, Computers and Thought
Cited by
Sorted by citations
Items 201–300 of 1,018
Planning optimal paths for multiple robots on graphs
Yu, J., & LaValle, S. M. (2013) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2013.6631084 · Cited by 204
Additive Pattern Database Heuristics
Felner, A., Korf, R. E., & Hanan, S. (2004) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1480 · Cited by 203
Global path planning based on a bidirectional alternating search A* algorithm for mobile robots
Li, C., Huang, X., Ding, J., Song, K., & Lu, S. (2022) · Computers & Industrial Engineering · doi:10.1016/j.cie.2022.108123 · Cited by 198
Disjoint pattern database heuristics
Korf, R. E., & Felner, A. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00092-3 · Cited by 197
Multi-Robot Path Planning Method Using Reinforcement Learning
Bae, H., Kim, G., Kim, J., Qian, D., & Lee, S.-G. (2019) · Applied Sciences · doi:10.3390/app9153057 · Cited by 201
Autonomous Pilot of Unmanned Surface Vehicles: Bridging Path Planning and Tracking
Wang, N., Zhang, Y., Ahn, C. K., & Xu, Q. (2021) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2021.3136670 · Cited by 192
The review unmanned surface vehicle path planning: Based on multi-modality constraint
Zhou, C., Gu, S., Wen, Y., Du, Z., Xiao, C., Huang, L., & Zhu, M. (2020) · Ocean Engineering · doi:10.1016/j.oceaneng.2020.107043 · Cited by 190
Distributed revision of composite beliefs
Pearl, J. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90034-8 · Cited by 190
In Transit to Constant Time Shortest-Path Queries in Road Networks
Bast, H., Funke, S., Matijević, D., Sanders, P., & Schultes, D. (2007) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972870.5 · Cited by 189
The Lee Path Connection Algorithm
Rubin, F. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.224054 · Cited by 189
F-RRT*: An improved path planning algorithm with improved initial solution and convergence rate
Liao, B., Wan, F., Hua, Y., Ma, R., Zhu, S., & Qing, X. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115457 · Cited by 188
A*Prune: an algorithm for finding K shortest paths subject to multiple constraints
Liu, G., & Ramakrishnan, K. G. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916263 · Cited by 187
PRIMAL$_2$: Pathfinding Via Reinforcement and Imitation Multi-Agent Learning - Lifelong
Damani, M., Luo, Z., Wenzel, E., & Sartoretti, G. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3062803 · Cited by 187
VHPOP: Versatile Heuristic Partial Order Planner
Younes, H. L. S., & Simmons, R. G. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1136 · Cited by 186
Livi, L., & Rizzi, A. (2012) · Pattern Analysis and Applications · doi:10.1007/s10044-012-0284-8 · Cited by 191
Including landmarks in routing instructions
Duckham, M., Winter, S., & Robinson, M. (2010) · Journal of Location Based Services · doi:10.1080/17489721003785602 · Cited by 184
A review of UAV autonomous navigation in GPS-denied environments
Chang, Y., Cheng, Y., Manzoor, U., & Murray, J. F. (2023) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2023.104533 · Cited by 206
Chi, W., Ding, Z., Wang, J., Chen, G., & Sun, L. (2021) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2021.3078390 · Cited by 182
Metz, M., Helena Mitasova, A., & Harmon, R. S. (2011) · Hydrology and earth system sciences · doi:10.5194/hess-15-667-2011 · Cited by 181
Electronic Design Automation: Synthesis, Verification, and Test
Wang, L., Wen, C. H. ‐., & Cheng, K.-T. T. (2009) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 181
Diakaki, C., Papageorgiou, M., Papamichail, I., & Nikolos, I. (2015) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2015.03.015 · Cited by 112
COMPANION: A Constraint-Optimizing Method for Person-Acceptable Navigation
Kirby, R., Simmons, R. G., & Forlizzi, J. (2009) · IEEE RO-MAN · doi:10.1109/roman.2009.5326271 · Cited by 180
Structured Learning and Prediction in Computer Vision
Nowozin, S., & Lampert, C. H. (2011) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000033 · Cited by 180
Formal-Language-Constrained Path Problems
Barrett, C., Jacob, R., & MARATHE, M. V. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798337716 · Cited by 179
Gutierrez, C., & Sequeda, J. F. (2021) · Communications of the ACM · doi:10.1145/3418294 · Cited by 148
Efficient Energy-Optimal Routing for Electric Vehicles
Sachenbacher, M., Leucker, M., Artmeier, A., & Haselmayr, J. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7803 · Cited by 178
HEDGES error-correcting code for DNA storage corrects indels and allows sequence constraints
Press, W. H., Hawkins, J. A., Jones, S. K., Schaub, J. M., & Finkelstein, I. J. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2004821117 · Cited by 184
Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation
Guck, J. W., Bemten, A. V., Martin Reisslein, B., & Kellerer, W. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2749760 · Cited by 176
Engineering Highway Hierarchies
Sanders, P., & Schultes, D. (2006) · Lecture notes in computer science · doi:10.1007/11841036_71 · Cited by 176
An Integrated Navigation and Motion Control System for Autonomous Multisensory Mobile Robots
Giralt, G., Chatila, R., & Vaisset, M. (1990) · Springer eBooks · doi:10.1007/978-1-4613-8997-2_31 · Cited by 176
ACO-A*: Ant Colony Optimization Plus A* for 3-D Traveling in Environments With Dense Obstacles
Yu, X., Chen, W., Gu, T., Yuan, H., Zhang, H., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2878221 · Cited by 174
A kilobyte rewritable atomic memory
Kalff, F., Rebergen, M., Fahrenfort, E., Girovský, J., Toskovic, R., Lado, J. L., Fernández-Rossier, J., & Otte, A. F. (2016) · Nature Nanotechnology · doi:10.1038/nnano.2016.131 · Cited by 176
Planning with Markov Decision Processes
Mausam, M., & Kolobov, A. (2012) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00426ed1v01y201206aim017 · Cited by 173
Topological constraints in search-based robot path planning
Bhattacharya, S., Likhachev, M. A., & Kumar, V. (2012) · Autonomous Robots · doi:10.1007/s10514-012-9304-1 · Cited by 172
Core Hunter: an algorithm for sampling genetic resources based on multiple genetic measures
Thachuk, C., Crossa, J. L., Franco, J., Dreisigacker, S., Warburton, M. L., & Davenport, G. F. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-243 · Cited by 172
Minimum curvature trajectory planning and control for an autonomous race car
Heilmeier, A., Wischnewski, A., Hermansdorfer, L., Betz, J., Lienkamp, M., & Lohmann, B. (2019) · Vehicle System Dynamics · doi:10.1080/00423114.2019.1631455 · Cited by 172
LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations
Grosso, V., Leurent, G., Standaert, F., & Varıcı, K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46706-0_2 · Cited by 170
Informed RRT*-Connect: An Asymptotically Optimal Single-Query Path Planning Method
Mashayekhi, R., Idris, M. Y. I., Anisi, M. H., Ahmedy, I., & Ali, I. (2020) · IEEE Access · doi:10.1109/access.2020.2969316 · Cited by 169
Minimum Bayes-risk automatic speech recognition
Goel, V., & Byrne, W. J. (2000) · Computer Speech & Language · doi:10.1006/csla.2000.0138 · Cited by 168
Learning Optimal Bayesian Networks: A Shortest Path Perspective
Yuan, C., & Malone, B. (2013) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4039 · Cited by 169
Yang, H., Yang, L., Yang, Z., Shan, Y., Gu, H., Ma, J., Zeng, X., Tian, T., Ma, S., & Wu, Z. (2023) · Composite Structures · doi:10.1016/j.compstruct.2023.117554 · Cited by 172
Edge detection using heuristic search methods
Martelli, A. (1972) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(72)80013-3 · Cited by 166
A Risk-Aware Path Planning Strategy for UAVs in Urban Environments
Primatesta, S., Guglieri, G., & Rizzo, A. (2018) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-018-0924-3 · Cited by 165
Liu, C., Mao, Q., Chu, X., & Xie, S. (2019) · Applied Sciences · doi:10.3390/app9061057 · Cited by 165
Directed explicit-state model checking in the validation of communication protocols
Edelkamp, S., Leue, S., & Lafuente, A. L. (2004) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-002-0104-3 · Cited by 165
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness GuaranteesPreprint
Wang, K.-H. C., & Botea, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.3905 · Cited by 165
Complete Algorithms for Cooperative Pathfinding Problems
Standley, T., & Korf, R. E. (2012) · Cited by 164
Poole, D., & Mackworth, A. K. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108164085 · Cited by 173
Multi-Modal Mobility Morphobot (M4) with appendage repurposing for locomotion plasticity enhancement
Sihite, E. N., Kalantari, A., Nemovi, R., Ramezani, A., & Gharib, M. (2023) · Nature Communications · doi:10.1038/s41467-023-39018-y · Cited by 176
A Panorama of Artificial and Computational Intelligence in Games
Yannakakis, G. N., & Togelius, J. (2014) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2014.2339221 · Cited by 163
Sampling-based A* algorithm for robot path-planning
Persson, M., & Sharf, I. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914547786 · Cited by 163
Dynamics-Constrained Global-Local Hybrid Path Planning of an Autonomous Surface Vehicle
Wang, N., & Xu, H. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.2991220 · Cited by 163
Critical Design and Control Issues of Indoor Autonomous Mobile Robots: A Review
Niloy, M. A., Shama, A., Chakrabortty, R. K., Ryan, M. J., Badal, F. R., Tasneem, Z., Ahamed, M. H., Moyeen, S. I., Das, S. K., Ali, M. F., et al. (2021) · IEEE Access · doi:10.1109/access.2021.3062557 · Cited by 172
An Integrated Semantic Web Service Discovery and Composition Framework
Rodríguez-Mier, P., Pedrinaci, C., Lama, M., & Mucientes, M. (2015) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2015.2402679 · Cited by 161
Grid Path Planning with Deep Reinforcement Learning: Preliminary Results
Panov, A. I., Yakovlev, K., & Suvorov, R. E. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2018.01.054 · Cited by 168
Obstacle Avoidance and Path Planning Methods for Autonomous Navigation of Mobile Robot
Katona, K., Neamah, H. A., & Köröndi, P. (2024) · Sensors · doi:10.3390/s24113573 · Cited by 169
Incremental Task and Motion Planning: A Constraint-Based Approach
Dantam, N. T., Kingston, Z. K., Chaudhuri, S., & Kavraki, L. E. (2016) · Robotics: Science and Systems · doi:10.15607/rss.2016.xii.002 · Cited by 160
Robotic Online Path Planning on Point Cloud
Liu, M. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2430526 · Cited by 159
Meng, Z., & Pan, J. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.01.009 · Cited by 162
A New Algorithm Based on Dijkstra for Vehicle Path Planning Considering Intersection Attribute
Zhu, D., & Sun, J. (2021) · IEEE Access · doi:10.1109/access.2021.3053169 · Cited by 159
Intelligent camera control in a virtual environment
Drucker, S. M., & Zeltzer, D. L. (1994) · doi:10.20380/gi1994.23 · Cited by 159
DIVERT: A Distributed Vehicular Traffic Re-Routing System for Congestion Avoidance
Pan, J., Popa, I. S., & Borcea, C. (2016) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2016.2538226 · Cited by 158
Path Planning via an Improved DQN-Based Learning Policy
Lv, L., Zhang, S., Ding, D., & Wang, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2918703 · Cited by 158
Behavior planning for character animation
Lau, M., & Kuffner, J. (2005) · ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA) · doi:10.1145/1073368.1073408 · Cited by 158
CadiaPlayer: A Simulation-Based General Game Player
Björnsson, Y., & Finnsson, H. (2009) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2009.2018702 · Cited by 157
A*-based Pathfinding in Modern Computer Games
Cui, X., & Shi, H. (2011) · Victoria University Research Repository (Victoria University) · Cited by 156
Hybrid Estimation of Complex Systems
Hofbaur, M., & Williams, B. C. (2004) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2004.835009 · Cited by 156
Real-Time Robot Path Planning Based on a Modified Pulse-Coupled Neural Network Model
Qu, H., Yang, S. X., Willms, A. R., & Zhang, Y. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2029858 · Cited by 156
Detecting and Locating Non-Technical Losses in Modern Distribution Networks
Leite, J. B., & Mantovani, J. R. S. (2016) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2574714 · Cited by 156
Autonomous Parking Using Optimization-Based Collision Avoidance
Zhang, X., Liniger, A., Sakai, A., & Borrelli, F. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619433 · Cited by 155
Huang, H., Savkin, A. V., & Huang, C. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.2983491 · Cited by 155
Active Mapping and Robot Exploration: A Survey
Lluvia, I., Lazkano, E., & Ansuategi, A. (2021) · Sensors · doi:10.3390/s21072445 · Cited by 155
Chen, M., Chen, Z., Luo, L., Tang, Y., Cheng, J., Wei, H., & Wang, J. (2024) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2024.108774 · Cited by 155
On the complexity of admissible search algorithms
Martelli, A. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90002-9 · Cited by 155
Imbalanced Datasets: From Sampling to Classifiers
Hoens, T. R., & Chawla, N. V. (2013) · Wiley eBooks · doi:10.1002/9781118646106.ch3 · Cited by 163
PONI: Potential Functions for ObjectGoal Navigation with Interaction-free Learning
Ramakrishnan, S. K., Chaplot, D. S., Al-Halah, Z., Malik, J., & Grauman, K. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01832 · Cited by 154
Proactive Vehicular Traffic Rerouting for Lower Travel Time
Pan, J., Popa, I. S., Zeitouni, K., & Borcea, C. (2013) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2013.2260422 · Cited by 154
Autonomous Intersection Management: Multi-intersection optimization
Hausknecht, M., Au, T.-C., & Stone, P. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6048565 · Cited by 154
Conflict-directed A* and its role in model-based embedded systems
Williams, B. C., & Ragno, R. J. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2005.10.022 · Cited by 154
Salient closed boundary extraction with ratio contour
Wang, S., Kubota, T., Siskind, J. M., & Wang, J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.84 · Cited by 154
Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D
Nash, A., Koenig, S., & Tovey, C. A. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7566 · Cited by 153
Rossi, F., Zhang, R., Hindy, Y., & Pavone, M. (2018) · Autonomous Robots · doi:10.1007/s10514-018-9750-5 · Cited by 153
Geodesic Methods in Computer Vision and Graphics
Gabriel Peyré, A., Péchaud, M., Keriven, R., & Cohen, L. D. (2009) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000029 · Cited by 152
Velocity-Free MS/AE Source Location Method for Three-Dimensional Hole-Containing Structures
Dong, L., Hu, Q., Tong, X., & Liu, Y. (2020) · Engineering · doi:10.1016/j.eng.2019.12.016 · Cited by 152
Dijkstra's and A-Star in Finding the Shortest Path: a Tutorial
Candra, A., Budiman, M. A., & Hartanto, K. (2020) · International Conference on Data Science, Artificial Intelligence, and Business Analytics (DATABIA) · doi:10.1109/databia50434.2020.9190342 · Cited by 152
Stochastic Scene-Aware Motion Prediction
Hassan, M. S., Ceylan, D., Villegas, R., Saito, J., Yang, J., Zhou, Y., & Black, M. J. (2021) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.01118 · Cited by 173
Macenski, S., Moore, T., Lu, D. V., Merzlyakov, A., & Ferguson, M. (2023) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2023.104493 · Cited by 170
Guided Hybrid A-star Path Planning Algorithm for Valet Parking Applications
Sedighi, S., Nguyen, D.-V., & Kuhnert, K.-D. (2019) · International Conference on Control, Automation and Robotics (ICCAR) · doi:10.1109/iccar.2019.8813752 · Cited by 151
Occupancy Anticipation for Efficient Exploration and Navigation
Ramakrishnan, S. K., Al-Halah, Z., & Grauman, K. L. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-58558-7_24 · Cited by 151
Ammar, A., Bennaceur, H., Châari, I., Koubâa, A., & Alajlan, M. (2015) · Soft Computing · doi:10.1007/s00500-015-1750-1 · Cited by 150
The Mario AI Benchmark and Competitions
Karakovskiy, S., & Togelius, J. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2188528 · Cited by 150
Place categorization and semantic mapping on a mobile robot
Sünderhauf, N., Dayoub, F., McMahon, S., Talbot, B., Schulz, R., Corke, P., Wyeth, G. F., Upcroft, B., & Milford, M. J. (2016) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2016.7487796 · Cited by 150
EB-RRT: Optimal Motion Planning for Mobile Robots
Wang, J., Meng, M. Q. ‐., & Khatib, O. (2020) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2020.2987397 · Cited by 150
Autonomous navigation of an automated guided vehicle in industrial environments
Barberá, H. M., & Herrero‐Perez, D. (2009) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2009.10.003 · Cited by 149
The EBS-A* algorithm: An improved A* algorithm for path planning
Wang, H., Lou, S., Jing, J., Wang, Y., Liu, W., & Liu, T. (2022) · PLoS ONE · doi:10.1371/journal.pone.0263841 · Cited by 149
Memari, M., Shakya, P., Shekaramiz, M., Seibi, A. C., & Masoum, M. A. S. (2024) · IEEE Access · doi:10.1109/access.2024.3371493 · Cited by 156
Schultes, D., & Sanders, P. (2007) · Springer eBooks · doi:10.1007/978-3-540-72845-0_6 · Cited by 149
A comparison of optimization techniques for AUV path planning in environments with ocean currents
Zeng, Z., Sammut, K., Lian, L., He, F., Lammas, A., & Tang, Y. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.03.011 · Cited by 148
Kinematic Constrained Bi-directional RRT with Efficient Branch Pruning for robot path planning
Wang, J., Li, B., & Meng, M. Q. ‐. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114541 · Cited by 148
Sampling-Based Motion Planning: A Comparative Review
Orthey, A., Chamzas, C., & Kavraki, L. E. (2023) · Annual Review of Control Robotics and Autonomous Systems · doi:10.1146/annurev-control-061623-094742 · Cited by 148
Metadata
- Authors
- Hart, P., Nilsson, N., & Raphael, B.
- Affiliations
- SRI International (US)
- Venue
- IEEE Transactions on Systems Science and Cybernetics
- Published
- 1968
- Volume
- 4
- Issue
- 2
- Pages
- 100-107
- ISSN
- 0536-1567 (ISSN-L)
- OpenAlex
- W1969483458
- Cited by
- 12,738
- References
- 7
- Citations by year
- 2026: 965 · 2025: 1216 · 2024: 1078 · 2023: 893 · 2022: 855 · 2021: 939 · 2020: 707 · 2019: 610 · 2018: 584 · 2017: 493 · 2016: 471 · 2015: 456 · 2014: 437 · 2013: 466 · 2012: 364
- FWCI
- 7.97
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Systems Science and Cybernetics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Keywords
- least-cost path, shortest path, graph search, heuristic search, search strategies, optimality, heuristic information
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
