Advertisement

Hierarchical Path Search

  • Juan A. Fernández
  • Javier González
Chapter
Part of the International Series on Microprocessor-Based and Intelligent Systems Engineering book series (ISCA, volume 24)

Abstract

Search is an important problem-solving paradigm. Many real world problems can be modeled and transformed to searching problems. Searching for chains of elements that connect places, concepts, reasonings, etc., appears in different areas of research: in AI, finding sequences of simple actions enable to solve complex tasks; in robotics, geometric paths are calculated to move mechanical elements in space under kinematic and dynamic constraints (manipulators, mobile platforms, cooperating robots,...); one of the main issues in networks is to find optimal routes to guide information packages efficiently; etc. These and many other examples highlight the importance of path search in any computational representation of knowledge.

Keywords

Computational Cost Goal Node Optimal Path Hierarchical Level Search Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Juan A. Fernández
    • 1
  • Javier González
    • 1
  1. 1.Universidad de MálagaMálagaSpain

Personalised recommendations