Multi-Hierarchical Representation of Large-Scale Space

It has been stated in psychology that human brain arranges information in a way that improves efficiency in performing common tasks, for example, information about our spatial environment is conveniently structured for efficient route finding. On the other hand, in computational sciences, the use of hierarchical information is well known for reducing the complexity of solving problems. This book studies hierarchical representations of large-scale space and presents a new model, called Multi-AH-graph, that uses multiple hierarchies of abstraction. It allows an agent to represent structural information acquired from the environment (elements such as objects, free space, etc., relations existing between them, such as proximity, similarity, etc. and other types of information, such as colors, shapes, etc). The Multi-AH-graph model extends a single hierarchy representation to a mUltiple hierarchy arrangement, which adapts better to a wider range of tasks, agents, and environments. We also present a system called CLAUDIA, which is an implementation of the task-driven paradigm for automatic construction of multiple abstractions: a set of hierarchies of abstraction will be "good" for an agent if it can reduce the cost of planning and performing certain tasks of the agent in the agent's world. CLAUDIA constructs multiple hierarchies (Multi-AH-graphs) for a given triple , trying to optimize their "goodness".

Inhalt

1. Introduction.- 2. Hierarchies of Abstraction in Literature.- 3. A Formal Model of Multiple Abstraction.- 4. Hierarchical Path Search.- 5. Automatic Generation of Multiple Hierarchies of Abstraction.- 6. Multiple Hierarchies of Abstraction for Mobile Robots.- 7. Conclusions.- Appendix A. NP-Completeness Overview.- Appendix B. Algorithm for Hierarchical Path Search.- Appendix C. The Cohesion Forces Clustering Algorithm.- Appendix D. The OEET Clustering Algorithm.- D.1. Introduction.- D.2. The OEET Algorithm.- D.2.1. First Stage: Retrieving Path Information.- D.2.2. Second Stage: Arc-Elimination Test and Arc-Erasing Process.- Behaviour of the Optimal Paths.- Behaviour of the Non-Optimal Paths.- Appendix E. Computational Cost of Hierarchical Path Search.- E.1. Computational Cost in Hierarchies with Two Hierarchical Levels.- E.2. Computational Cost in Hierarchies with More Than Two Hierarchical Levels.- Appendix F. Sufficient Condition for Optimality When There is No Materialization of Costs.- F.1. When the Cost of Refining Paths is a Constant.- F.2. When the Cost of Refining Paths is Bounded by the Costs of the Arcs.- References.