Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
On the consistency assumption, monotone criterion and the monotone restriction
ACM SIGART Bulletin
Journal of the ACM (JACM)
Reconciling schemas of disparate data sources: a machine-learning approach
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
IEEE Expert: Intelligent Systems and Their Applications
Reconsideration of a theorem on admissible ordered search algorithms
ACM '76 Proceedings of the 1976 annual conference
Improving the multi-stack decoding algorithm in a segment-based speech recognizer
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
A hierarchical evaluation methodology in speech recognition
Acta Cybernetica
Computers and Operations Research
Architectural design of a situated multiagent system for controlling automatic guided vehicles
International Journal of Agent-Oriented Software Engineering
Detection of Phoneme Boundaries Using Spiking Neurons
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Force deployment analysis with generalized grammar
Information Fusion
A geometric analysis of heuristic search
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Comparing real-time and incremental heuristic search for real-time situated agents
Autonomous Agents and Multi-Agent Systems
Egocentric affordance fields in pedestrian steering
Proceedings of the 2009 symposium on Interactive 3D graphics and games
On A* as a special case of ordered search
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Information-theoretic approaches to branching in search
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A* search with inconsistent heuristics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Computers and Operations Research
Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments
International Journal of Robotics Research
VELOS: A VR platform for ship-evacuation analysis
Computer-Aided Design
Ranking information in networks
SBP'11 Proceedings of the 4th international conference on Social computing, behavioral-cultural modeling and prediction
Abstractions and pattern databases: the quest for succinctness and accuracy
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Routing-based map matching for extracting routes from GPS trajectories
Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications
Dynagent: an incremental forward-chaining HTN planning agent in dynamic domains
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
Efficient memory bound puzzles using pattern databases
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Generalized maneuvers in route planning
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
A* orthogonal matching pursuit: Best-first search for compressed sensing signal recovery
Digital Signal Processing
HyTER: meaning-equivalent semantics for translation evaluation
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
Navigation of mobile robot by using D++ algorithm
Intelligent Service Robotics
Analysis of solutions to the time-optimal planning and execution problem
Intelligent Service Robotics
From their environment to their behavior: a procedural approach to model groups of virtual agents
IVA'12 Proceedings of the 12th international conference on Intelligent Virtual Agents
Mcta: heuristics and search for timed systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Proceedings of the Winter Simulation Conference
Light-assisted A* path planning
Engineering Applications of Artificial Intelligence
CrowdVis: a framework for real time crowd visualization
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Multimedia access to mobile environments using indoor semantic maps
Multimedia Tools and Applications
Algorithm A* in logical-structure recognition of objects on raster images
Pattern Recognition and Image Analysis
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Our paper on the use of heuristic information in graph searching defined a path-finding algorithm, A*, and proved that it had two important properties. In the notation of the paper, we proved that if the heuristic function ñ (n) is a lower bound on the true minimal cost from node n to a goal node, then A* is admissible; i.e., it would find a minimal cost path if any path to a goal node existed. Further, we proved that if the heuristic function also satisfied something called the consistency assumption, then A* was optimal; i.e., it expanded no more nodes than any other admissible algorithm A no more informed than A*. These results were summarized in a book by one of us.