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 901–1,000 of 1,018
Towards the Internet of Flying Robots: A Survey
Huang, H., & Savkin, A. V. (2018) · Sensors · doi:10.3390/s18114038 · Cited by 62
Meister, C., Vieira, T., & Cotterell, R. (2020) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00346 · Cited by 65
Analysis of the uncertainty of the AIS-based bottom-up approach for estimating ship emissions
Chen, X., & Yang, J. (2024) · Marine Pollution Bulletin · doi:10.1016/j.marpolbul.2023.115968 · Cited by 62
ANA*: anytime nonparametric A*
van den Berg, J., Shah, R., Huang, A., & Goldberg, K. (2011) · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · doi:10.1609/aaai.v25i1.7819 · Cited by 62
CAPRA: A contour-based accessible path routing algorithm
Rahaman, M. S., Mei, Y., Hamilton, M., & Salim, F. D. (2017) · Information Sciences · doi:10.1016/j.ins.2016.12.041 · Cited by 62
Li, H., & Savkin, A. V. (2018) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2018.05.008 · Cited by 62
Groeger, D., & Steimle, J. (2019) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/3290605.3300929 · Cited by 62
SneakySnake: a fast and accurate universal genome pre-alignment filter for CPUs, GPUs and FPGAs
Alser, M., Shahroodi, T., Gómez-Luna, J., Alkan, C., & Mutlu, O. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa1015 · Cited by 62
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
Chandel, A., Nagesh, P., & Sarawagi, S. (2006) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2006.55 · Cited by 62
Navigational path planning for a vision-based mobile robot
Arkin, R. C. (1989) · Robotica · doi:10.1017/s0263574700005038 · Cited by 62
State space models of remote manipulation tasks
Whitney, D. E. (1969) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1969.1099295 · Cited by 62
Rolling Soft Membrane-Driven Tensegrity Robots
Baines, R. L., Booth, J., & Kramer-Bottiglio, R. K. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.3015185 · Cited by 61
Near-Optimal Weather Routing by Using Improved A* Algorithm
Shin, Y., Abebe, M., Noh, Y., Lee, S.-B., Lee, I., Kim, D., Bae, J., & Kim, K. C. (2020) · Applied Sciences · doi:10.3390/app10176010 · Cited by 61
AEB-RRT*: an adaptive extension bidirectional RRT* algorithm
Wang, X., Wei, J., Zhou, X., Xia, Z., & Gu, X. (2022) · Autonomous Robots · doi:10.1007/s10514-022-10044-x · Cited by 61
Path Planning for Wheeled Mobile Robot in Partially Known Uneven Terrain
Zhang, B., Li, G., Zheng, Q., Bai, X., Ding, Y., & Khan, A. G. (2022) · Sensors · doi:10.3390/s22145217 · Cited by 61
FAR Planner: Fast, Attemptable Route Planner using Dynamic Visibility Update
Yang, F., Cao, C., Zhu, H., Oh, J., & Zhang, J. (2022) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros47612.2022.9981574 · Cited by 61
UAV Path Planning Based on the Combination of A-star Algorithm and RRT-star Algorithm
Zhou, Q., & Liu, G. (2022) · IEEE International Conference on Unmanned Systems (ICUS) · doi:10.1109/icus55513.2022.9986703 · Cited by 61
Meng, T., Yang, T., Huang, J., Jin, W., Zhang, W., Jia, Y., Wan, K., Xiao, G., Yang, D., & Zhong, Z. (2023) · International Journal of Automotive Technology · doi:10.1007/s12239-023-0038-1 · Cited by 61
Path Planning for Obstacle Avoidance of Robot Arm Based on Improved Potential Field Method
Xia, X., Li, T., Sang, S., Cheng, Y., Ma, H., Zhang, Q., & Yang, K. (2023) · Sensors · doi:10.3390/s23073754 · Cited by 61
Synthesizing Diverse Human Motions in 3D Indoor Scenes
Zhao, K., Zhang, Y., Wang, S., Beeler, T., & Tang, S. (2023) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.01354 · Cited by 78
A Review of Path Planning Methods for Marine Autonomous Surface Vehicles
Wu, Y., Wang, T., & Liu, S. (2024) · Journal of Marine Science and Engineering · doi:10.3390/jmse12050833 · Cited by 65
Accelerating Multi-modal Route Planning by Access-Nodes
Delling, D., Pajor, T., & Wagner, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04128-0_53 · Cited by 61
Scalable, Parallel Best-First Search for Optimal Sequential Planning
Kishimoto, A., Fukunaga, A. S., & Botea, A. (2009) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v19i1.13350 · Cited by 61
Parallel Algorithms for Real-time Motion Planning
McNaughton, M. (2011) · KiltHub Repository · doi:10.1184/r1/6720992 · Cited by 61
Decentralized simultaneous multi-target exploration using a connected network of multiple robots
Nestmeyer, T., Giordano, P. R., Bülthoff, H., & Franchi, A. (2016) · Autonomous Robots · doi:10.1007/s10514-016-9578-9 · Cited by 64
Human Mobility Modeling for Robot-Assisted Evacuation in Complex Indoor Environments
Tang, B., Jiang, C., He, H., & Guo, Y. P. (2016) · IEEE Transactions on Human-Machine Systems · doi:10.1109/thms.2016.2571269 · Cited by 61
Distributed inference-based multi-robot exploration
Smith, A. J., & Hollinger, G. A. (2018) · Autonomous Robots · doi:10.1007/s10514-018-9708-7 · Cited by 61
A Socially-Aware Hybrid Computation Offloading Framework for Multi-Access Edge Computing
Yu, S., Dab, B., Movahedi, Z., Langar, R., & Wang, L. (2019) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2019.2908154 · Cited by 61
Fast Query Decomposition for Batch Shortest Path Processing in Road Networks
Li, L., Zhang, M., Hua, W., & Zhou, X. (2020) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde48307.2020.00107 · Cited by 61
Improving Collaborative Pathfinding Using Map Abstraction
Sturtevant, N., & Buro, M. (2006) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v2i1.18750 · Cited by 61
Mamoulis, N. (2012) · Synthesis lectures on data management · doi:10.1007/978-3-031-01884-8 · Cited by 61
Perspectives in deductive databases
Minker, J. (1988) · The Journal of Logic Programming · doi:10.1016/0743-1066(88)90006-4 · Cited by 61
AD-VAT+: An Asymmetric Dueling Mechanism for Learning and Understanding Visual Active Tracking
Zhong, F., Sun, P., Luo, W., Yan, T., & Wang, Y. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2952590 · Cited by 62
Evaluating Adversarial Attacks on Driving Safety in Vision-Based Autonomous Vehicles
Zhang, J., Lou, Y., Wang, J., Wu, K., Lu, K., & Jia, X. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3099164 · Cited by 65
Bi-Risk-RRT Based Efficient Motion Planning for Autonomous Ground Vehicles
Ma, H., Meng, F., Ye, C., Wang, J., & Meng, M. Q. ‐. (2022) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2022.3152740 · Cited by 60
Efficient Path Planning and Dynamic Obstacle Avoidance in Edge for Safe Navigation of USV
Wang, D., Chen, H., Lao, S., & Drew, S. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3325234 · Cited by 60
Dynamic Routing of Automated Guided Vehicles in Real-time
Gawrilow, E., Köhler, E., Möhring, R. H., & Stenzel, B. (2008) · Springer eBooks · doi:10.1007/978-3-540-77203-3_12 · Cited by 60
Two-way D∗ algorithm for path planning and replanning
Đakulović, M., & Petrovic, I. K. (2011) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2011.02.007 · Cited by 60
Polymorphism in bovine serum albumin fibrils: morphology and statistical analysis
Usov, I., Adamčík, J., & Mezzenga, R. (2013) · Faraday Discussions · doi:10.1039/c3fd00083d · Cited by 60
Probabilistic planning for robotic exploration
Simmons, R. G., & Smith, T. (2007) · Cited by 60
A Multi‐Autonomous Underwater Vehicle System for Autonomous Tracking of Marine Life
Lin, Y., Hsiung, J., Piersall, R., White, C. F., Lowe, C. G., & Clark, C. (2016) · Journal of Field Robotics · doi:10.1002/rob.21668 · Cited by 60
Henkel, C., Bubeck, A., & Xu, W. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.07.610 · Cited by 60
A cooperative game-theoretic approach to the social ridesharing problem
Bistaffa, F., Farinelli, A., Chalkiadakis, G., & Ramchurn, S. D. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2017.02.004 · Cited by 60
The Maximum Consensus Problem: Recent Algorithmic Advances
Chin, T.-J., & Suter, D. (2017) · Synthesis lectures on computer vision · doi:10.2200/s00757ed1v01y201702cov011 · Cited by 60
Wu, T., Li, J., Li, T., Sivakumar, B., Zhang, G., & Wang, G. (2019) · Geomorphology · doi:10.1016/j.geomorph.2019.04.022 · Cited by 63
A Distributed Reconfiguration Planning Algorithm for Modular Robots
Liu, C., Whitzer, M., & Yim, M. H. (2019) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2019.2930432 · Cited by 60
OMNIVIL—An Autonomous Mobile Manipulator for Flexible Production
Engemann, H., Du, S., Kallweit, S., Cönen, P., & Dawar, H. (2020) · Sensors · doi:10.3390/s20247249 · Cited by 60
Technology and Field Demonstration of Robotic Search for Antarctic Meteorites
Apostolopoulos, D. S., Wagner, M. D., Shamah, B., Pedersen, L., Shillcutt, K. J., & Whittaker, W. (2000) · The International Journal of Robotics Research · doi:10.1177/02783640022067940 · Cited by 60
Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/06 · Cited by 60
Are many reactive agents better than a few deliberative ones
Knight, K. K. (1993) · Cited by 60
Inconsistent heuristics in theory and practice
Felner, A., Zahavi, U., Holte, R. C., Schaeffer, J., Sturtevant, N., & Zhang, Z. (2011) · Artificial Intelligence · doi:10.1016/j.artint.2011.02.001 · Cited by 59
Rezaei, M., Noori, H., Razlighi, M. M., & Nickray, M. (2019) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2952524 · Cited by 59
Multi-objective routing and scheduling for airport ground movement
Weiszer, M., Burke, E. K., & Chen, J. (2020) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2020.102734 · Cited by 59
Robust Autonomous Navigation of a Small-Scale Quadruped Robot in Real-World Environments
Dudzik, T., Chignoli, M., Bledt, G., Lim, B., Miller, A., Kim, D., & Kim, S. (2020) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros45743.2020.9340701 · Cited by 59
PaRoutes: towards a framework for benchmarking retrosynthesis route predictions
Genheden, S., & Bjerrum, E. J. (2022) · Digital Discovery · doi:10.1039/d2dd00015f · Cited by 71
A Survey of Indoor UAV Obstacle Avoidance Research
Li, J., Xiong, X., Yan, Y., & Yang, Y. (2023) · IEEE Access · doi:10.1109/access.2023.3262668 · Cited by 59
Pre- and post-contact policy decomposition for planar contact manipulation under uncertainty
Koval, M. C., Pollard, N. S., & Srinivasa, S. S. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364915594474 · Cited by 59
Syed, U., Kunwar, F., & Iqbal, M. (2014) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2013.12.004 · Cited by 59
An analysis of drivers route choice behaviour using GPS data and optimal alternatives
Ciscal-Terry, W., Dell’Amico, M., Hadjidimitriou, N. S., & Iori, M. (2015) · Journal of Transport Geography · doi:10.1016/j.jtrangeo.2015.12.003 · Cited by 59
Kang, J. Y., & Lee, B. S. (2017) · International Journal of Naval Architecture and Ocean Engineering · doi:10.1016/j.ijnaoe.2017.02.001 · Cited by 59
Trajectory Segmentation Map-Matching Approach for Large-Scale, High-Resolution GPS Data
Zhu, L., Holden, J. R., & Gonder, J. D. (2017) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/2645-08 · Cited by 59
Singh, Y., Sharma, S. K., Sutton, R., Hatton, D. C., & Khan, A. (2018) · IEEE International Conference on Autonomous Robot Systems and Competitions · doi:10.1109/icarsc.2018.8374170 · Cited by 59
Anytime hybrid driving-stepping locomotion planning
Klamt, T., & Behnke, S. (2017) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8206310 · Cited by 59
Hu, Q., & Dong, L. (2019) · IEEE Sensors Journal · doi:10.1109/jsen.2019.2954200 · Cited by 59
Routing and Rebalancing Intermodal Autonomous Mobility-on-Demand Systems in Mixed Traffic
Wollenstein-Betech, S., Salazar, M., Houshmand, A., Pavone, M., Paschalidis, I. C., & Cassandras, C. G. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3112106 · Cited by 60
Multi-robot Coordination and Planning in Uncertain and Adversarial Environments
Zhou, L., & Tokekar, P. (2021) · Current Robotics Reports · doi:10.1007/s43154-021-00046-5 · Cited by 63
A Review of Prospects and Opportunities in Disassembly With Human–Robot Collaboration
Lee, M.-L., Liang, X. P., Hu, B., Önel, G., Behdad, S., & Zheng, M. (2023) · Journal of Manufacturing Science and Engineering · doi:10.1115/1.4063992 · Cited by 58
Saemi, B., & Goodarzian, F. (2024) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2024.108132 · Cited by 58
Felner, A., Kraus, S., & Korf, R. E. (2003) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1024452529781 · Cited by 58
Minimum dose method for walking-path planning of nuclear facilities
Liu, Y.-K., Li, M.-K., Xie, C.-L., Peng, M.-J., Wang, S.-Y., Chao, N., & Liu, Z.-K. (2015) · Annals of Nuclear Energy · doi:10.1016/j.anucene.2015.04.019 · Cited by 58
Linear-time disk-based implicit graph search
Korf, R. E. (2008) · Journal of the ACM · doi:10.1145/1455248.1455250 · Cited by 58
Bouhana, A., Zidi, A., Fekih, A., Chabchoub, H., & Abed, M. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.12.012 · Cited by 58
Châari, I., Koubâa, A., Trigui, S., Bennaceur, H., Ammar, A., & Al-Shalfan, K. (2014) · International Journal of Advanced Robotic Systems · doi:10.5772/58543 · Cited by 58
Maximizing over multiple pattern databases speeds up heuristic search
Holte, R. C., Felner, A., Newton, J., Meshulam, R., & Furcy, D. (2006) · Artificial Intelligence · doi:10.1016/j.artint.2006.09.002 · Cited by 58
Robotic forklifts for intelligent warehouses: Routing, path planning, and auto-localization
Vivaldini, K. C. T., Galdames, J. P. M., Bueno, T. S., Araujo, R. C., Sobral, R. M., Becker, M., & Caurin, G. A. P. (2010) · IEEE International Conference on Industrial Technology (ICIT) · doi:10.1109/icit.2010.5472487 · Cited by 58
Ship Pipe Routing Design Using NSGA-II and Coevolutionary Algorithm
Niu, W., Sui, H., Niu, Y., Cai, K., & Gao, W. (2016) · Mathematical Problems in Engineering · doi:10.1155/2016/7912863 · Cited by 58
Exploiting floating car data for time-dependent Origin–Destination matrices estimation
Nigro, M., Cipriani, E., & del Giudice, A. (2017) · Journal of Intelligent Transportation Systems · doi:10.1080/15472450.2017.1421462 · Cited by 58
Finding Top-k Optimal Sequenced Routes
Liu, H., Jin, C., Yang, B., & Zhou, A. (2018) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2018.00058 · Cited by 58
Augusto, A., Conforti, R., Dumas, M., Rosa, M. L., & Bruno, G. (2018) · Data & Knowledge Engineering · doi:10.1016/j.datak.2018.04.007 · Cited by 58
Besbes, M., Zolghadri, M., Affonso, R. C., Faouzi Masmoudi, A., & Haddar, M. (2019) · Journal of Intelligent Manufacturing · doi:10.1007/s10845-019-01468-x · Cited by 58
Real-Time Motion Planning Approach for Automated Driving in Urban Environments
Artuñedo, A., Villagrá, J., & Godoy, J. (2019) · IEEE Access · doi:10.1109/access.2019.2959432 · Cited by 58
Complete solution of the eight-puzzle and the benefit of node ordering in IDA
Reinefeld, A. (1993) · Cited by 58
Zhang, W. (2002) · Cited by 58
Interactive Model Predictive Control for Robot Navigation in Dense Crowds
Chen, Y., Zhao, F., & Lou, Y. (2021) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2020.3048964 · Cited by 57
Representation-Optimal Multi-Robot Motion Planning Using Conflict-Based Search
Vidana, J. I. S., Motes, J., Sandström, R., & Amato, N. M. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2021.3068910 · Cited by 57
Dynamic RRT: Fast Feasible Path Planning in Randomly Distributed Obstacle Environments
Zhao, P., Chang, Y., Wu, W., Luo, H., Zhou, Z., Qiao, Y., Li, Y., Zhao, C., Huang, Z., Liu, B., et al. (2023) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-023-01823-4 · Cited by 57
Path planning for unmanned surface vehicle based on improved Q-Learning algorithm
Wang, Y., Lu, C., Wu, P., & Zhang, X. (2023) · Ocean Engineering · doi:10.1016/j.oceaneng.2023.116510 · Cited by 57
Enhanced Robot Motion Block of A-Star Algorithm for Robotic Path Planning
Kabir, R., Watanobe, Y., Islam, M. R., & Naruse, K. (2024) · Sensors · doi:10.3390/s24051422 · Cited by 57
Yin, S., & Xiang, Z. (2025) · Advanced Engineering Informatics · doi:10.1016/j.aei.2025.103355 · Cited by 57
Efficient verification of shortest path search via authenticated hints
Yiu, M. L., Lin, Y., & Mouratidis, K. (2010) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2010.5447914 · Cited by 57
Shortest paths with arbitrary clearance from navigation meshes
Kallmann, M. E. (2010) · doi:10.5555/1921427.1921451 · Cited by 57
An Information Roadmap Method for Robotic Sensor Path Planning
Zhang, G., Ferrari, S., & Qian, M. (2009) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-009-9318-x · Cited by 57
A continuous query system for dynamic route planning
Malviya, N., Madden, S. R., & Bhattacharya, A. (2011) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2011.5767844 · Cited by 57
Application of dynamic programming to study load shifting in buildings
Favre, B., & Peuportier, B. (2014) · Energy and Buildings · doi:10.1016/j.enbuild.2014.07.018 · Cited by 57
TDPP-Net: Achieving three-dimensional path planning via a deep neural network architecture
Wu, K., Esfahani, M. A., Yuan, S., & Wang, H. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.05.001 · Cited by 57
Fast stochastic routing under time-varying uncertainty
Pedersen, S. A., Yang, B., & Jensen, C. S. (2019) · The VLDB Journal · doi:10.1007/s00778-019-00585-6 · Cited by 57
Autonomous mobile robot path planning in unknown dynamic environments using neural dynamics
Chen, Y., Liang, J., Wang, Y., Pan, Q., Tan, J., & Mao, J. (2020) · Soft Computing · doi:10.1007/s00500-020-04771-5 · Cited by 57
MDS Matrices with Lightweight Circuits
Duval, S., & Leurent, G. (2018) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2018.i2.48-78 · Cited by 57
Zhao, H., Wang, C., Guo, R., Rong, X., Guo, J., Yang, Q., Yang, L., Zhao, Y., & Li, Y. (2022) · High Voltage · doi:10.1049/hve2.12221 · Cited by 57
Lee, J. H., Lee, B. H., & Choi, M. H. (1998) · IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans · doi:10.1109/3468.668966 · Cited by 57
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
