A heuristic search algorithm with modifiable estimate
Artificial Intelligence
Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Principles of artificial intelligence
Principles of artificial intelligence
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM (JACM)
Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
Journal of the ACM (JACM)
Handbook of AI
Art and Theory of Dynamic Programming
Art and Theory of Dynamic Programming
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Space-efficient search algorithms
ACM Computing Surveys (CSUR)
Heuristic search in cyclic AND/OR graphs
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Best first search in and/or graphs
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Computing the nxm shortest path efficiently
Journal of Experimental Algorithmics (JEA)
PHA*: performing A* in unknown physical environments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Heuristic allocation based on a dynamic programming state-space representation
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the 9th International Congress on computational and applied mathematics
On the asymptotic performance of IDA*
Annals of Mathematics and Artificial Intelligence
Search Heuristics for Box Decomposition Methods
Journal of Global Optimization
Admissibility Proofs for the LCS* Algorithm
IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
A Formal Model of Trade-off between Optimization and Execution Costs in Semantic Query Optimization
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
New Search Heuristics for Max-CSP
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Computing the n × m Shortest Paths Efficently
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
An average-case analysis of graph search
Eighteenth national conference on Artificial intelligence
Handbook of data mining and knowledge discovery
Annals of Mathematics and Artificial Intelligence
Average-case analysis of best-first search in two representative directed acyclic graphs
Artificial Intelligence
Navigation and Multimodal Transportation with EasyTransport
IEEE Intelligent Systems
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
Multi-agent Physical A* with Large Pheromones
Autonomous Agents and Multi-Agent Systems
Finding optimal solutions to the graph partitioning problem with heuristic search
Annals of Mathematics and Artificial Intelligence
Breadth-first heuristic search
Artificial Intelligence
Only the Best Can Make It: Optimal Component Selection
Electronic Notes in Theoretical Computer Science (ENTCS)
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges
Proceedings of the 8th ACM conference on Electronic commerce
Conflict-directed A* and its role in model-based embedded systems
Discrete Applied Mathematics
Magallanes: 3D navigation for everybody
Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia
On diversity and accuracy of homogeneous and heterogeneous ensembles
International Journal of Hybrid Intelligent Systems
Multiple Concern Adaptation for Run-time Composition in Context-Aware Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Anytime search in dynamic graphs
Artificial Intelligence
Waveprint: Efficient wavelet-based audio fingerprinting
Pattern Recognition
Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Best-First AND/OR Search for 0/1 Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Incrementally Refined Acquaintance Model for Consortia Composition
CIA '08 Proceedings of the 12th international workshop on Cooperative Information Agents XII
An online multi-agent co-operative learning algorithm in POMDPs
Journal of Experimental & Theoretical Artificial Intelligence
Egocentric affordance fields in pedestrian steering
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Identifying MMORPG bots: a traffic analysis approach
EURASIP Journal on Advances in Signal Processing - Special issue on signal processing applications in network intrusion detection systems
Fast object search on road networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Personalised routing for wheelchair navigation
Journal of Location Based Services
Improving optical character recognition through efficient multiple system alignment
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
Context-aware multi-stage routing
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Better Safe than SorryOptimal Troubleshooting through A* Search with Efficiency-based Pruning
Proceedings of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008
Weighted A∗ search -- unifying view and application
Artificial Intelligence
Visibility transition planning for dynamic camera control
Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
On the value of good advice: the complexity of A* search with accurate heuristics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Best-first search for treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Best-first AND/OR search for graphical models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Stitching Planning in Laparoscopic Surgery: Towards Robot-assisted Suturing
International Journal of Robotics Research
Phase transitions and backbones of the asymmetric traveling salesman problem
Journal of Artificial Intelligence Research
PHA*: finding the shortest path with A* in an unknown physical environment
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Bidirectional heuristic search reconsidered
Journal of Artificial Intelligence Research
Towards finding optimal solutions with non-admissible heuristics: a new technique
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Switching from bidirectional to unidirectional search
IJCAI'99 Proceedings of the 16th 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
How to use limited memory in heuristic search
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
TextSL: a command-based virtual world interface for the visually impaired
Proceedings of the 11th international ACM SIGACCESS conference on Computers and accessibility
A new approach to multiobjective A* search
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Breadth-first heuristic search
Artificial Intelligence
Monitoring minimum cost paths on road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A hybrid evolutionary-graph approach for finding functional network paths
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Cost-optimal planning with landmarks
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance
Journal of Intelligent and Robotic Systems
A Cooperative CiberMouse@RTSS08 Team
EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Cube pruning as heuristic search
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
A hierarchical path planning and obstacle avoidance system for an autonomous underwater vehicle
ACC'09 Proceedings of the 2009 conference on American Control Conference
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A heuristic routing protocol for wireless sensor networks in home automation
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Scalable navigation system for mobile robots based on the agent dual-space control paradigm
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Scheduling task graphs optimally with A*
The Journal of Supercomputing
Multiobjective A* search with consistent heuristics
Journal of the ACM (JACM)
Concurrent reactive plans: anticipating and forestalling execution failures
Concurrent reactive plans: anticipating and forestalling execution failures
A two stage yard crane workload partitioning and job sequencing algorithm for container terminals
Proceedings of the 2010 ACM Symposium on Applied Computing
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
Efficient ranking of rate-compatible puncturing patterns for a given LDPC code matrix
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Nonlinear network optimization: an embedding vector space approach
IEEE Transactions on Evolutionary Computation
Crowd modeling and simulation technologies
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Depth-first vs best-first search
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Performance of IDA on trees and graphs
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Depth-first vs. best-first search: new results
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Artificial intelligence search algorithms
Algorithms and theory of computation handbook
Fast Surface-Based Travel Depth Estimation Algorithm for Macromolecule Surface Shape Description
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Optimal top-k query evaluation for weighted business processes
Proceedings of the VLDB Endowment
Cellular ants: A method to create collision free trajectories for a cooperative robot team
Robotics and Autonomous Systems
Heuristic and metaheuristic optimization techniques with application to power systems
MMACTEE'10 Proceedings of the 12th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
A Numerical Study of the Bottom-Up and Top-Down Inference Processes in And-Or Graphs
International Journal of Computer Vision
Formation sketching: an approach to stylize groups in crowd simulation
Proceedings of Graphics Interface 2011
Efficient congestion mitigation using congestion-aware steiner trees and network coding topologies
VLSI Design - Special issue on CAD for Gigascale SoC Design and Verification Solutions
Inconsistent heuristics in theory and practice
Artificial Intelligence
Cluster based partitioning for agent-based crowd simulations
Winter Simulation Conference
A decision-support system for smarter city planning and management
IBM Journal of Research and Development
Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information
Advanced Engineering Informatics
Fast approximate similarity search based on degree-reduced neighborhood graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Interactive structured output prediction: application to chromosome classification
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
K*: A heuristic search algorithm for finding the k shortest paths
Artificial Intelligence
Discovering personalized routes from trajectories
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks
Mini-bucket heuristics for improved search
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Flexible and approximate computation through state-space reduction
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Connecting Two (or Less) Dots: Discovering Structure in News Articles
ACM Transactions on Knowledge Discovery from Data (TKDD)
Comparison of heuristics in multiobjective a* search
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Fast and accurate connectivity analysis between functional regions based on DT-MRI
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Multiobjective heuristic search in road maps
Expert Systems with Applications: An International Journal
Energy-saving light positioning using heuristic search
Engineering Applications of Artificial Intelligence
Conflict-Directed a* search for soft constraints
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A* orthogonal matching pursuit: Best-first search for compressed sensing signal recovery
Digital Signal Processing
Propagating changes between aligned process models
Journal of Systems and Software
Intelligent transportation systems-Enabling technologies
Mathematical and Computer Modelling: An International Journal
Connecting the dots between news articles
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Information-theoretic approaches to branching in search
Discrete Optimization
A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
INFORMS Journal on Computing
Software Agent Systems for Improving Performance of Multi-Robot Groups
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
BPR: fast FPGA placement and routing using macroblocks
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Self-control of the time complexity of a constraint satisfaction problem solver program
Journal of Systems and Software
A genetic algorithm for the Zen Puzzle Garden game
Natural Computing: an international journal
A M2MC based approach for mapping two ADL models
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Optimal linear programming solutions for multiprocessor scheduling with communication delays
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Aligning event logs and declarative process models for conformance checking
BPM'12 Proceedings of the 10th international conference on Business Process Management
Light-assisted A* path planning
Engineering Applications of Artificial Intelligence
The increasing cost tree search for optimal multi-agent pathfinding
Artificial Intelligence
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
Towards rational deployment of multiple heuristics in A*
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Bridging the gap between refinement and heuristics in abstraction
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Reducing the solution space of optimal task scheduling
Computers and Operations Research
Local map-based exploration for mobile robots
Intelligent Service Robotics
Hi-index | 0.01 |
This paper reports several properties of heuristic best-first search strategies whose scoring functions ƒ depend on all the information available from each candidate path, not merely on the current cost g and the estimated completion cost h. It is shown that several known properties of A* retain their form (with the minmax of f playing the role of the optimal cost), which helps establish general tests of admissibility and general conditions for node expansion for these strategies. On the basis of this framework the computational optimality of A*, in the sense of never expanding a node that can be skipped by some other algorithm having access to the same heuristic information that A* uses, is examined. A hierarchy of four optimality types is defined and three classes of algorithms and four domains of problem instances are considered. Computational performances relative to these algorithms and domains are appraised. For each class-domain combination, we then identify the strongest type of optimality that exists and the algorithm for achieving it. The main results of this paper relate to the class of algorithms that, like A*, return optimal solutions (i.e., admissible) when all cost estimates are optimistic (i.e., h ≤ h*). On this class, A* is shown to be not optimal and it is also shown that no optimal algorithm exists, but if the performance tests are confirmed to cases in which the estimates are also consistent, then A* is indeed optimal. Additionally, A* is also shown to be optimal over a subset of the latter class containing all best-first algorithms that are guided by path-dependent evaluation functions.