Del 0 - Intelligent Systems, Control and Automation: Science and Engineering

Multi-Hierarchical Representation of Large-Scale Space

Applications to Mobile Robots

Inbunden, Engelska, 2001

AvJuan A. Fernández,Javier González

2 079 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

2 069 kr

Skickas inom 10-15 vardagar

This book formalizes multiple abstraction (arranging knowledge hierarchically using more than one hierarchy) based on graphs, and studies in-depth its implications in path search, graph isomorphism, and in the automatic construction of multi-hierarchical structures. It also describes its application as a model of the large-scale space environment of mobile robots, including real mobile robots and a well-known computational model of the human cognitive map: the Spatial Semantic Hierarchy. This book is intended for PhD students and in general for robotics, computer science, and artificial intelligence researchers.

Produktinformation

Utgivningsdatum2001-12-31
Mått155 x 235 x 21 mm
Vikt617 g
FormatInbunden
SpråkEngelska
SerieIntelligent Systems, Control and Automation: Science and Engineering
Antal sidor276
Upplaga2002
FörlagKluwer Academic Publishers
ISBN9781402001055

Tillhör följande kategorier

Elektronik och kommunikationer inom Naturvetenskap och teknik

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.