A Robot Exploration and Mapping Strategy Based on a Semantic Hierarchy of Spatial Representations Benjamine Kuipers and Yung-Tai Byun Tai S. Jang MAE University.

Slides:



Advertisements
Similar presentations
Heuristic Search techniques
Advertisements

Sonar and Localization LMICSE Workshop June , 2005 Alma College.
Design Concepts and Principles
University of Amsterdam Search, Navigate, and Actuate - Quantitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Quantative Navigation.
Speech Group INRIA Lorraine
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
TEKS 8.6 (A,B) & 8.7 (A,D) This slide is meant to be a title page for the whole presentation and not an actual slide. 8.6 (A) Generate similar shapes using.
A New Omnidirectional Vision Sensor for the Spatial Semantic Hierarchy E. Menegatti, M. Wright, E. Pagello Dep. of Electronics and Informatics University.
CS 326 A: Motion Planning Planning Exploration Strategies.
ECE 7340: Building Intelligent Robots QUALITATIVE NAVIGATION FOR MOBILE ROBOTS Tod S. Levitt Daryl T. Lawton Presented by: Aniket Samant.
Shapes and the Coordinate System TEKS 8.6 (A,B) & 8.7 (A,D)
ECE 4340/7340 Exam #2 Review Winter Sensing and Perception CMUcam and image representation (RGB, YUV) Percept; logical sensors Logical redundancy.
Brent Dingle Marco A. Morales Texas A&M University, Spring 2002
System Partitioning Kris Kuchcinski
Optimization Methods One-Dimensional Unconstrained Optimization
Using Search in Problem Solving
Animation. Outline  Key frame animation  Hierarchical animation  Inverse kinematics.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
1/53 Key Problems Localization –“where am I ?” Fault Detection –“what’s wrong ?” Mapping –“what is my environment like ?”
Optimization Methods One-Dimensional Unconstrained Optimization
Scenes, Cameras & Lighting. Outline  Constructing a scene  Using hierarchy  Camera models  Light models.
CS Reinforcement Learning1 Reinforcement Learning Variation on Supervised Learning Exact target outputs are not given Some variation of reward is.
Chapter 5.4 Artificial Intelligence: Pathfinding.
Search: Heuristic &Optimal Artificial Intelligence CMSC January 16, 2003.
Chapter 8 Architecture Analysis. 8 – Architecture Analysis 8.1 Analysis Techniques 8.2 Quantitative Analysis  Performance Views  Performance.
Presentation on Neural Networks.. Basics Of Neural Networks Neural networks refers to a connectionist model that simulates the biophysical information.
Reinforcement Learning
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
9 Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 9: Topological Path Planning1 Part II Chapter 9: Topological Path Planning.
Swarm Intelligence 虞台文.
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
Using Soar for an indoor robotic search mission Scott Hanford Penn State University Applied Research Lab 1.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Digital Image Processing CCS331 Relationships of Pixel 1.
University of Amsterdam Search, Navigate, and Actuate - Qualitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Qualitative Navigation.
Shape Formation Through Cell Growth and Gradient Exudation Growing arbitrary shapes with more fun than you can shake a caml at! UVa October 4 th,
Wandering Standpoint Algorithm. Wandering Standpoint Algorithm for local path planning Description: –Local path planning algorithm. Required: –Local distance.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
9 Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 9: Topological Path Planning1 Part II Chapter 9: Topological Path Planning.
Service Service metadata what Service is who responsible for service constraints service creation service maintenance service deployment rules rules processing.
Topological Path Planning JBNU, Division of Computer Science and Engineering Parallel Computing Lab Jonghwi Kim Introduction to AI Robots Chapter 9.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Efficient Optimal Linear Boosting of a Pair of Classifiers.
Chapter 10. The Explorer System in Cognitive Systems, Christensen et al. Course: Robots Learning from Humans On, Kyoung-Woon Biointelligence Laboratory.
COMP 417 – Jan 12 th, 2006 Guest Lecturer: David Meger Topic: Camera Networks for Robot Localization.
Artificial Intelligence Lecture No. 6 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Course14 Dynamic Vision. Biological vision can cope with changing world Moving and changing objects Change illumination Change View-point.
Hub Location–Allocation in Intermodal Logistic Networks Hüseyin Utku KIYMAZ.
CSCE 552 Spring 2010 AI (III) By Jijun Tang. A* Pathfinding Directed search algorithm used for finding an optimal path through the game world Used knowledge.
Learning Roomba Module 5 - Localization. Outline What is Localization? Why is Localization important? Why is Localization hard? Some Approaches Using.
Mobile Robot Localization and Mapping Using Range Sensor Data Dr. Joel Burdick, Dr. Stergios Roumeliotis, Samuel Pfister, Kristo Kriechbaum.
CSCE 552 Fall 2012 AI By Jijun Tang. Homework 3 List of AI techniques in games you have played; Select one game and discuss how AI enhances its game play.
Puulajeittainen estimointi ja ei-parametriset menetelmät Multi-scale Geospatial Analysis of Forest Ecosystems Tahko Petteri Packalén Faculty.
Functionality of objects through observation and Interaction Ruzena Bajcsy based on Luca Bogoni’s Ph.D thesis April 2016.
Artificial Intelligence
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
Rapidly-Exploring Random Trees
COGNITIVE APPROACH TO ROBOT SPATIAL MAPPING
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors
Applications of graph theory in complex systems research
Spatial Semantic Hierarchy (SSH)
Part II Chapter 9: Topological Path Planning
Concurrent Graph Exploration with Multiple Robots
Agent-Centered Search
Algorithms for Budget-Constrained Survivable Topology Design
Hierarchical Modeling & Constructive Solid Geometry
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Chapter 6 Network Flow Models.
Semantic Nets and Frames
Volume 50, Issue 1, Pages (April 2006)
Distributed Reinforcement Learning for Multi-Robot Decentralized Collective Construction Gyu-Young Hwang
Presentation transcript:

A Robot Exploration and Mapping Strategy Based on a Semantic Hierarchy of Spatial Representations Benjamine Kuipers and Yung-Tai Byun Tai S. Jang MAE University of Missouri-Columbia ECE 7340 : Building Intelligent Robots Winter, 2005

PRESENTATION OUTLINE INTRODUCTION BACKGROUND THE HIERARCHICAL MAP A ROBOT INSTANCE: NX EXPLORATION RESULTS SUMMARY

INTRODUCTION INTRODUCTION A robust qualitative method is presented for robot exploration, mapping, and navigation in large-scale spatial environments.

INTRODUCTION INTRODUCTION Experiments with a simulated robot in a variety of 2-D environments have demonstrated that the proposed method can build an accurate map of an unknown environment in spite of substantial random and systematic sensorimotor error In this qualitative method, location-specific control algorithms are dynamically selected to control the robot’s interaction with its environment (large - scale). These algorithms define distinctive places and paths, which are linked to form a topological network description. Finally the geometry is obtained from it.

INTRODUCTION INTRODUCTION The Control Level: Distinctive places and path are defined in terms of the control strategies and sensory measures (called d-measures) which support convergence to them from anywhere within a local neighborhood. A distinctive place is defined as the local maximum found by a hill – climbing control strategy. A distinctive path is defined by the d-measure and control strategy (e.g. follow – the – midline) The Topological Level: A topological network description of the global environment is created before the global geometric map, by identifying and linking distinctive places and distinctive paths in the environment. The Geometric Level: The geometric map is created by accumulating, first, local geometric information about places and paths, then global metrical relations among these elements.

INTRODUCTION INTRODUCTION

We do not ask: how big is it? but rather: does it have any holes in it? is it all connected together, or can it be separated into parts? A commonly cited example is the London Underground map. This will not reliably tell you how far it is from one station to other, or even the compass direction from one to the other; but it will tell you how the lines connect up between them. Definition: Topology Definition: Topology

PRESENTATION OUTLINE INTRODUCTION BACKGROUND THE HIERARCHICAL MAP A ROBOT INSTANCE: NX EXPLORATION RESULTS SUMMARY

BACKGROUND Humans perform well at spatial learning and spatial problems solving in spite of sensory and processing limitations and frequently-incomplete knowledge. It is a qualitative approach rather than a metrical or quantitative one. Robot exploration and map-learning problem is a enormous challenge because low mechanical accuracy and sensory errors make difficult to obtain purely metrically accurate map in large- scale space. The layered structure of the cognitive map or topological description is responsible for humans’ robust performance in large-scale space. So here the authors attempt to apply qualitative method to the problem of robot exploration and map-learning.

PRESENTATION OUTLINE INTRODUCTION BACKGROUND THE HIERARCHICAL MAP A ROBOT INSTANCE: NX EXPLORATION RESULTS SUMMARY

PRESENTATION OUTLINE INTRODUCTION BACKGROUND THE HIERARCHICAL MAP A ROBOT INSTANCE: NX EXPLORATION RESULTS SUMMARY

THE HIERARCHICAL MAP The central element of the authors’ hierarchical model is the topological network description, in which nodes correspond to distinctive places and arcs correspond to travel paths. Here how to define distinctive places and travel paths, and their descriptions at the control and metrical levels will be discussed. 1.Distinctive places 2.Distinctive Travel Paths 3.The Basic Exploration Strategy 4.Robust against Errors 5.The Position Referencing Problem 6.The Exploration Agenda 7.The Rehearsal Procedure

THE HIERARCHICAL MAP 1. Distinctive places A Place corresponding to a node must be locally distinctive within its immediate neighborhood by some criterion definable in terms of sensory input. The following distinctiveness measures (d-measures) are defined for example Extent of distant differences to near objects Extent and quality of symmetry across the center of the robot or a line Temporal discontinuity in one or more sensors, experienced over a small step Number of directions of reasonable motion into open spaces around the robot. Temporal change in number of directions of motion provided by the distinct open spaces, experienced over a small step. The point along a path that minimizes or maximizes lateral distance readings. Once the robot recognizes that it is in the neighborhood of a distinctive place, it applies a hill-climbing control strategy to move to the point where some distinctiveness measure ahs its local maximum value.

THE HIERARCHICAL MAP 2. Distinctive Travel Paths The paths followd during exploration are defined by some distinctiveness criterion that is sufficient to specify a one-dimentsional set of points The travel paths connecting two distinctive places are defined in terms of local control strategies (LCS). For example, Follow-the-midline Move-along-Object-on Right Move-along-Object-on-Left Blind Step The knowledge used for selecting and performing the proper LCS is dependent on the robot’s sensorimotor system. Besides connectivity information, locally-observable metrical information is accumulated to describe the geometric features of an path, such as length, lateral width, curvature, net change in orientation, etc.

THE HIERARCHICAL MAP

3. The Basic Exploration Strategy a.From a place, move into an open direction b.Select a control strategy and follow a path c.Detect a neighborhood, select a d-measure, and begin hill-climbing d.Reach a local maximum that defines being at another distinctive place. The topological model is built as a side-effect of motion through this transition graph.

THE HIERARCHICAL MAP 4. Robust against Errors Although the robot is subject to sensory and movement errors, hill-climbing search based on continuous sensory feedback will bring it very near to a distinctive place. The Hill-Climbing search always moves towards the goal. Using heuristics it finds which direction will take it closest to the goal. The name "hill-climbing" comes from an analogy: A hiker is lost halfway up/down (depends on if you are an optimist) a mountain at night. His camp is at the top of the mountain. Even though it is dark, the hiker knows that every step he takes up the mountain is a step towards his goal. So a hill-climbing search always goes to the node closest to the goal.

THE HIERARCHICAL MAP 5. The Position Referencing Problem The current position is described at two levels: topological and metrical. At the topological level, the current position is described by either a distinctive place, or by a pair representing a path and a direction. At the metrical level, then the robot its at a distinctive place, the current local sensory information and its current orientation are given. When it is on a path, the robot’s current position may be describe in terms of the place it is coming from, the distance it has traveled, lateral distance information, and its current orientation.

THE HIERARCHICAL MAP 6. The Rehearsal Procedure When a robot reaches a place during the exploration, the identification of the palce is the most important task. If the place has been visited before and the robot comes back to that place, the robot should recognize it. A new place must be recognized as new. Place matching is done using global topological constraints as well as local metrical comparison

PRESENTATION OUTLINE INTRODUCTION BACKGROUND THE HIERARCHICAL MAP A ROBOT INSTANCE: NX EXPLORATION RESULTS SUMMARY

THE Robot Instance: NX The NX Robot Simulator The robot NX with 16 sensors covering 360 degrees with equal angle differences and an absolute compass for global orientation has used to test this qualitative method. EXPLORATION RESULTS To demonstrate the effect of sensory errors, the authors showed the exploration result for three different random error rates: the error-free, five percent error, and then percent error It showed that the method used is quite robust to sensory errors.

SUMMARY Its is very difficult to build a metrically accurate map within a global coordinate frame, through exploration in an unknown unstructured environment. The authors used a hierarchical description of the spatial environment, in which a topological network description mediates between a control and a metrical level. Distinctive places and paths are defined by their properties at the control level, and serve as the nodes and arcs of the topological model. Each place and path can then accumulate local metrical information Cumulative location error minimized: due to alternating between the path-following and hill- climbing control algorithms. Successful navigation : It doesn’t depend on geometric accuracy. Geometric sensor fusion methods: can be naturally incorporated as methods for acquiring local geometric descriptions of places and paths Indistinguishable places: i.e. places with identical local sensory characteristics can be identified correctly, except in the most pathological environments.

SUMMARY Limitations The robot is currently considered low-speed: A more realistic robot would be high speed requiring a more sophisticated set of control strategies to move through the environment. It requires a improved obstacle-avoidance capabilities to deal with moving agents The environment itself may change, as doors are opened or closed, or parked cars move around requiring diagnosis to discriminate between fixed and changeable aspect of the environment.

Thanks...