A Metric Space Approach to the Specification of the Heuristic Function for the A* Algorithm

@article{Passino1994AMS,
  title={A Metric Space Approach to the Specification of the Heuristic Function for the A* Algorithm},
  author={K. Passino and P. Antsaklis},
  journal={IEEE Trans. Syst. Man Cybern. Syst.},
  year={1994},
  volume={24},
  pages={159-166}
}
Given a graph with arcs that have costs, the A* algorithm is designed to find the shortest path from a single node to a set of nodes. While the A* algorithm is well understood, it is somewhat limited in its application due to the fact that it is often difficult to specify the "heuristic function" so that A* exhibits desirable computational properties. In this paper a metric space approach to the specification of the heuristic function is introduced. It is shown how to specify an admissible and… Expand
Problem Solving in Human Beings and Computers (formerly: Heuristic Problem Solving)
TLDR
The results suggest that human beings solve problems by building only a single path, rather than by performing a constrained search, and are compared to the performance of several conventional Al algorithms. Expand
Intelligent path planning for automated guided vehicles system based on topological map
Path planning is one of the key aspects of designing and implementing intelligent robots. This paper presents a novel path planning approach for automated guided vehicles (AGVs). In the proposedExpand
Intelligent path planning for automated guided vehicles system based on topological map
TLDR
In the proposed approach, the overall AGV control system is introduced and the environment is modeled as topological map, and an improved version of classical Dijkstra's algorithm is developed aiming to find the globally optimal path which is a set of nodes of the warehouseTopological map. Expand
Shortest Path Finding and Tracking System Based on Dijkstra ' s Algorithm for Mobile Robot
Roads play a vital role to the people live in different places and, from day to day, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remainExpand
Euclidean Heuristic Optimization
TLDR
This work proves the problem of constructing good search heuristics as an optimization problem: minimizing the loss between the true distances and the heuristic estimates subject to admissibility and consistency constraints is tractable and corresponds to a recently proposed method for dimensionality reduction. Expand
Information integration in computerized distribution system planning
Electricity distribution planning automation involves a great deal of information, residing in different systems. Information sharing among these systems is essential in improving the efficiency andExpand
Shortest Path Finding Using a Star Algorithmand Minimum weight Node First Principle
The shortest paths, sets of paths with the shortest distance between a single initial (source) point and all other destination points, as well as between all pairs of points, are to be found. ForExpand
Heuristic shortest path algorithms for transportation applications
There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requi...
Intelligent control of a planning system for astronaut training.
  • Jorge Ortiz, G. Chen
  • Medicine, Engineering
  • IEEE transactions on aerospace and electronic systems
  • 1999
TLDR
The work presented here completes the design, development, and analysis of an intricate, large-scale, and representative mathematical formulation for intelligent control of a real planning system for Space Station crew training. Expand
A new fuzzy multi-hop clustering protocol with automatic rule tuning for wireless sensor networks
TLDR
The proposed Fuzzy Multi-hop clustering protocol (FMSFLA) considers effective parameters including energy, distance from the base station (BS), the number of neighboring nodes, real node Distance from the BS, mean route load, delay, overlap, and the problem of hot spots to achieve the best application-based performance. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 33 REFERENCES
Generalized best-first search strategies and the optimality of A*
TLDR
It is shown that several known properties of A* retain their form 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. Expand
Planning via heuristic search in a Petri net framework
  • K. Passino, P. Antsaklis
  • Computer Science
  • Proceedings IEEE International Symposium on Intelligent Control 1988
  • 1988
TLDR
In the paper, a special type of extended input/output Petri net is defined and then used as the problem representation for a wide class of problem domains and a planning strategy is developed using results from the theory of heuristic search. Expand
A Method for Computing Heuristics in Problem-Solving
TLDR
A formal framework for structuring and embedding the heuristic information is proposed in order to allow an algorithmic computation of the evaluation function ĥ (n) of the classical Hart-Nilsson-Raphael algorithm. Expand
A Methodology for Solving Problems: Problem Modeling and Heuristic Generation
  • K. Irani, S. Yoo
  • Mathematics, Computer Science
  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1988
TLDR
A methodology is given for modeling a problem and solving it using the A* algorithm, mechanically generated from the simplified problem, which is derived by relaxing each of the predicate formulas describing the rules and the goal state of the problem. Expand
A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm
TLDR
The performance of a new heuristic search algorithm that uses a formal representation that contains enough information to compute the heuristic evaluation function h(n), as defined in the context of A*, without requiring a human expert to provide it is analyzed. Expand
<u>Correction</u> to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"
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 ifExpand
On the Complexity of Admissible Search Algorithms
  • A. Martelli
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1977
TLDR
This paper analyzes the complexity of heuristic search algorithms, i.e. algorithms which find the shortest path in a graph by using an estimate to guide the search and presents a new search algorithm which runs in O(N2) steps in the worst case and which never requires more steps than A*. Expand
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TLDR
How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated. Expand
The Traveling-Salesman Problem and Minimum Spanning Trees
TLDR
It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers. Expand
Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems
  • T. Ibaraki
  • Computer Science, Mathematics
  • Inf. Control.
  • 1978
TLDR
It is shown that the existence of a branch-and-bound procedure for Y is inherently related to the representation of Y by a positively monotone or positively and strictly monotones sequential decision process (pmsdp or psmsdp), which have been studied in conjunction with dynamic programming. Expand
...
1
2
3
4
...