Introduction to Information Science and Technology (IST) Part IV: Intelligent Machines and Robotics Planning
|
|
- Vernon Wilcox
- 5 years ago
- Views:
Transcription
1 Introduction to Information Science and Technology (IST) Part IV: Intelligent Machines and Robotics Planning Sören Schwertfeger / 师泽仁 ShanghaiTech University
2 ShanghaiTech University - SIST Autonomous mobile robots move around in the environment. Therefore ALL of them: They need to know where they are. They need to know where their goal is. They need to know how to get there. Different levels: Control: How much power to the motors to move in that direction, reach desired speed Navigation: Avoid obstacles Classify the terrain in front of you Follow a path Planning: Long distance path planning What is the way, optimize for certain parameters
3 ShanghaiTech University - SIST General Control Scheme for Mobile Robot Systems Localization Map Building Position Global Map Cognition & AI Path Planning Lecture 3: Planning Environment Model Local Map Path Perception Information Extraction Vision Raw data Sensing Path Execution Actuator Commands Acting Motion Control Navigation Real World Environment With material from Roland Siegwart and Davide Scaramuzza, ETH Zurich
4 ShanghaiTech University - SIST PATH FOLLOWING Obstacle Avoidance
5 ShanghaiTech University - SIST Navigation, Motion & Motor Control Navigation/ Motion Control: Where to drive to next in order to reach goal Output: motion vector (direction) and speed For example: follow path (Big Model) go to unexplored area (Big Model) drive forward (Small Model) be attracted to goal area (Small Model) Planner Global Goal Path Following/ Local Goal Path (0.1Hz) Navigation Goal (10Hz) 3 Motion Control: How use propulsion to achieve motion vector Motor Control: How much power to achieve propulsion (wheel speed) Motion Control Motor Control 2 Wheel Speeds (1000 Hz) 1
6 ShanghaiTech University - SIST Obstacle Avoidance (Local Path Planning) Goal: avoid collisions with obstacles Usually based on local map Often implemented as independent task However, efficient obstacle avoidance should be optimal with respect to the overall goal the actual speed and kinematics of the robot the on boards sensors the actual and future risk of collision
7 ShanghaiTech University - SIST Obstacle Avoidance: Vector Field Histogram (VFH) Environment represented in a grid (2 DOF) cell values: probability of obstacle Reduction in to 1 DOF histogram Steering direction algorithm: Find all openings for the robot to pass Lowest cost function G Borenstein et al. target_direction = alignment of the robot path with the goal wheel_orientation = difference between the new direction and the currrent wheel orientation previous_direction = difference between the previously selected direction and the new direction
8 ShanghaiTech University - SIST Obstacle Avoidance: The Bubble Band Concept Bubble = Maximum free space which can be reached without any risk of collision generated using the distance to the object and a simplified model of the robot bubbles are used to form a band of bubbles which connects the start point with the goal point Khatib and Chatila
9 ShanghaiTech University - SIST Path Following A path is generated by planning algorithm (next lecture) Goal: Drive along that path Path smoothing or Local planner Control onto the local path For example: Select goal point one meter ahead of path M. Rufli and R. Siegwart: Deformable Lattice Graphs Material from Martin Rufli
10 ShanghaiTech University - SIST PLANNING Mobile Robotics: Generate a Path
11 ShanghaiTech University - SIST General Control Scheme for Mobile Robot Systems Localization Map Building Position Global Map Cognition & AI Path Planning Environment Model Local Map Path Perception Information Extraction Vision Raw data Sensing Path Execution Actuator Commands Acting Motion Control Navigation Real World Environment With material from Roland Siegwart and Davide Scaramuzza, ETH Zurich
12 ShanghaiTech University - SIST The Planning Problem The problem: find a path in the work space (physical space) from the initial position to the goal position avoiding all collisions with the obstacles Assumption: there exists a good enough map of the environment for navigation. Corridor Bill s office Coffee room Topological Map Coarse Grid Map (for reference only)
13 ShanghaiTech University - SIST The Planning Problem We can generally distinguish between (global) path planning and (local) obstacle avoidance. First step: Transformation of the map into a representation useful for planning This step is planner-dependent Second step: Plan a path on the transformed map Third step: Send motion commands to controller This step is planner-dependent (e.g. Model based feed forward, path following)
14 ShanghaiTech University - SIST Configuration Space for a Mobile Robot Mobile robots operating on a flat ground (2D) have 3 DoF: (x, y, θ) Differential Drive: only two motors => only 2 degrees of freedom directly controlled (forward/ backward + turn) => non-holonomic Simplification: assume robot is holonomic and it is a point => configuration space is reduced to 2D (x,y) => inflate obstacle by size of the robot radius to avoid crashes => obstacle growing
15 ShanghaiTech University - SIST Path Planning: Overview of Algorithms 1. Optimal Control Solves truly optimal solution Becomes intractable for even moderately complex as well as nonconvex problems 3. Graph Search Identify a set edges between nodes within the free space Source: 2. Potential Field Imposes a mathematical function over the state/configuration space Many physical metaphors exist Often employed due to its simplicity and similarity to optimal control solutions Where to put the nodes?
16 ShanghaiTech University - SIST Potential Field Path Planning Strategies Robot is treated as a point under the influence of an artificial potential field. Operates in the continuum Generated robot movement is similar to a ball rolling down the hill Goal generates attractive force Obstacle are repulsive forces
17 ShanghaiTech University - SIST Potential Field Path Planning: Notes: Local minima problem exists problem is getting more complex if the robot is not considered as a point mass If objects are non-convex there exists situations where several minimal distances exist can result in oscillations
18 ShanghaiTech University - SIST CONE PATH PLANNING
19 ShanghaiTech University - SIST Problem Statement: Follow a path between cones
20 ShanghaiTech University - SIST th Step (not part of planning): Detect cones Detect Cones, e.g. using Jump Edge Approach: Big jump edge: Beginning of object Big jump edge: End of object First smoothing (averaging)? Good against noise in sensor data Jump edge detection more difficult We assume every object is a cone! Otherwise: Object Classification, e.g. based on curvature
21 ShanghaiTech University - SIST st Step: Create a Map of Cones As you drive along, remember where you have seen cones Use the odometry to update your pose in the map
22 ShanghaiTech University - SIST st Step: Create a Map of Cones As you drive along, remember where you have seen cones Use the odometry to update your pose in the map
23 ShanghaiTech University - SIST st Step: Create a Map of Cones As you drive along, remember where you have seen cones Use the odometry to update your pose in the map
24 ShanghaiTech University - SIST st Step: Create a Map of Cones As you drive along, remember where you have seen cones Use the odometry to update your pose in the map
25 ShanghaiTech University - SIST nd Step: Identify Left and Right Cones Find the closest cone on the left & front Find the 2 nd closest cone on the left & front and so on Same with right cones L2 L1 Don t count: in the back! R 2 R 1
26 ShanghaiTech University - SIST rd Step: Connect left and right Cones Connect the first left cone with: A) the closest right cone or B) the right cone with the same number Test which one is better Continue for all other left cones Make sure that the distance is reasonable (too short or too big might mean something went wrong) L1 L2 R 2 R 1
27 ShanghaiTech University - SIST th Step: Generate path Connect: Robot Frame: robot center or (0,0) in the sensor frame for simplicity Connect Robot Frame with center point of first connection Connect center points of all further connections L2 L1 R 2 R 1
28 ShanghaiTech University - SIST th Step: Generate path Connect: Robot Frame: robot center or (0,0) in the sensor frame for simplicity Connect Robot Frame with center point of first connection Connect center points of all further connections
29 ShanghaiTech University - SIST th Step (not part of planning): Path following Select a point some distance along the path (e.g. 50cm) This is the goal point
30 ShanghaiTech University - SIST th Step (not part of planning): Path following Select a point some distance along the path (e.g. 50cm) This is the goal point Determine: Angle α of goal point w.r.t. Robot Frame The bigger alpha: The faster turn in the correct direction The slower drive forward => if direction is way off turn on the spot => if facing the correct direction drive full speed y x α
31 ShanghaiTech University - SIST Thoughts about this approach Works well if you see more than a few cones Worked well when using the Kinect camera (max range > 6m) Might not work very well for the short range IR sensor Worth a try? Maybe step 1 (create map) is not needed => Work on a single scan
32 ShanghaiTech University - SIST GRAPH SEARCH
33 ShanghaiTech University - SIST Graph Search Overview Solves a least cost problem between two states on a (directed) graph Graph structure is a discrete representation Limitations State space is discretized à completeness is at stake Feasibility of paths is often not inherently encoded Algorithms (Preprocessing steps) Breath first Depth first Dijkstra A* and variants D* and variants
34 ShanghaiTech University - SIST Graph Construction: Visibility Graph Particularly suitable for polygon-like obstacles Shortest path length Grow obstacles to avoid collisions
35 ShanghaiTech University - SIST Graph Construction: Visibility Graph Pros The found path is optimal because it is the shortest length path Implementation simple when obstacles are polygons Cons The solution path found by the visibility graph tend to take the robot as close as possible to the obstacles: the common solution is to grow obstacles by more than robot s radius Number of edges and nodes increases with the number of polygons Thus it can be inefficient in densely populated environments
36 ShanghaiTech University - SIST Graph Construction: Voronoi Diagram Tends to maximize the distance between robot and obstacles
37 ShanghaiTech University - SIST Graph Construction: Voronoi Diagram Pros Using range sensors like laser or sonar, a robot can navigate along the Voronoi diagram using simple control rules Cons Because the Voronoi diagram tends to keep the robot as far as possible from obstacles, any short range sensor will be in danger of failing Voronoi diagram can change drastically in open areas
38 ShanghaiTech University - SIST Deterministic Graph Search Methods Breath First Depth First Dijkstra A* and variants D* and variants...
39 ShanghaiTech University - SIST DIJKSTRA S ALGORITHM
40 ShanghaiTech University - SIST EDSGER WYBE DIJKSTRA "Computer Science is no more about computers than astronomy is about telescopes."
41 ShanghaiTech University - SIST SINGLE-SOURCE SHORTEST PATH PROBLEM Single-Source Shortest Path Problem - The problem of finding shortest paths from a source vertex v to all other vertices in the graph. Graph Set of vertices and edges Vertex: Place in the graph; connected by: Edge: connecting two vertices Directed or undirected (undirected in Dijkstra s Algorithm) Edges can have weight/ distance assigned Dijkstra material from
42 ShanghaiTech University - SIST Diklstra s Algorithm Assign all vertices infinite distance to goal Assign 0 to distance from start Add all vertices to the queue While the queue is not empty: Select vertex with smallest distance and remove it from the queue Visit all neighbor vertices of that vertex, calculate their distance and update their (the neighbors) distance if the new distance is smaller
43 ShanghaiTech University - SIST Diklstra s Algorithm - Pseudocode dist[s] 0 (distance to source vertex is zero) for all v V {s} do dist[v] (set all other distances to infinity) S (S, the set of visited vertices is initially empty) Q V (Q, the queue initially contains all vertices) while Q (while the queue is not empty) do u mindistance(q, dist) (select the element of Q with the min. distance) S S {u} (add u to list of visited vertices) for all v neighbors[u] do if dist[v] > dist[u] + w(u, v) (if new shortest path found) then d[v] d[u] + w(u, v) (set new value of shortest path) (if desired, add traceback code) return dist
44 ShanghaiTech University - SIST Dijkstra Example
45 ShanghaiTech University - SIST Dijkstra Example
46 ShanghaiTech University - SIST Dijkstra Example
47 ShanghaiTech University - SIST Dijkstra Example
48 ShanghaiTech University - SIST Dijkstra Example
49 ShanghaiTech University - SIST Dijkstra Example
50 ShanghaiTech University - SIST Dijkstra Example
51 ShanghaiTech University - SIST Dijkstra Example
52 ShanghaiTech University - SIST Dijkstra Example
53 ShanghaiTech University - SIST Dijkstra Example
54 ShanghaiTech University - SIST APPLICATIONS OF DIJKSTRA'S ALGORITHM - Navigation Systems - Internet Routing
55 ShanghaiTech University - SIST Dijkstra s Algorithm for Path Planning: Topological Maps Topological Map: Places (vertices) in the environment (red dots) Paths (edges) between them (blue lines) Length of path = weight of edge => Apply Dijkstra s Algorithm to find path from start vertex to goal vertex
56 ShanghaiTech University - SIST Dijkstra s Algorithm for Path Planning: Grid Maps Graph: Neighboring free cells are connected: 4-neighborhood: up/ down/ left right 8-neighborhood: also diagonals All edges have weight 1 Stop once goal vertex is reached Per vertex: save edge over which the shortest distance from start was reached => Path
57 ShanghaiTech University - SIST Graph Search Strategies: Breath-First Search Corresponds to a wavefront expansion on a 2D grid Breath-First: Dijkstra s search where all edges have weight 1
58 ShanghaiTech University - SIST Graph Search Strategies: Depth-First Search A A A A A A A B C D B C D B C D B C D B C D B C D B C D E E F E F E F E F E F G H G H G H G H D I D A I D A I L First path found! NOT optimal A A A A A A A B C D B C D B C D B C D B C D B C D B C D E F E F E F G E F G E F G E F G E F G G H G H G H G H F I G H F I G H F I G H F I D I K D I K D I K D I K D I K C H D I K C H D I K C H A L A L L A L L A L L A L L A L L A A L L A K A A E D A B C D F G G H F I I L K L C A H K L E D A B C D F G G H F I I L K L C A H K L L A=initial B C D F E G H I K L=goal
59 ShanghaiTech University - SIST Graph Search Strategies: A* Search Similar to Dijkstra s algorithm, except that it uses a heuristic function h(n) f(n) = g(n) + ε h(n)
60 ShanghaiTech University - SIST Graph Search Strategies: Randomized Search Most popular version is the rapidly exploring random tree (RRT) Well suited for high-dimensional search spaces Often produces highly suboptimal solutions
CS283: Robotics Fall 2016: Robot Arms
CS83: Fall 016: Robot Arms Sören Schwertfeger / 师泽仁 ShanghaiTech University ShanghaiTech University - SIST - 0.11.016 REVIEW ShanghaiTech University - SIST - 0.11.016 3 General Control Scheme for Mobile
More informationAutonomous Mobile Robots, Chapter 6 Planning and Navigation Where am I going? How do I get there? Localization. Cognition. Real World Environment
Planning and Navigation Where am I going? How do I get there?? Localization "Position" Global Map Cognition Environment Model Local Map Perception Real World Environment Path Motion Control Competencies
More informationZürich. Roland Siegwart Margarita Chli Martin Rufli Davide Scaramuzza. ETH Master Course: L Autonomous Mobile Robots Summary
Roland Siegwart Margarita Chli Martin Rufli Davide Scaramuzza ETH Master Course: 151-0854-00L Autonomous Mobile Robots Summary 2 Lecture Overview Mobile Robot Control Scheme knowledge, data base mission
More informationPath Planning. Marcello Restelli. Dipartimento di Elettronica e Informazione Politecnico di Milano tel:
Marcello Restelli Dipartimento di Elettronica e Informazione Politecnico di Milano email: restelli@elet.polimi.it tel: 02 2399 3470 Path Planning Robotica for Computer Engineering students A.A. 2006/2007
More informationRobot Motion Control Matteo Matteucci
Robot Motion Control Open loop control A mobile robot is meant to move from one place to another Pre-compute a smooth trajectory based on motion segments (e.g., line and circle segments) from start to
More informationCognitive Robotics Robot Motion Planning Matteo Matteucci
Cognitive Robotics Robot Motion Planning Robot Motion Planning eminently necessary since, by definition, a robot accomplishes tasks by moving in the real world. J.-C. Latombe (1991) Robot Motion Planning
More informationAutonomous Robotics 6905
6905 Lecture 5: to Path-Planning and Navigation Dalhousie University i October 7, 2011 1 Lecture Outline based on diagrams and lecture notes adapted from: Probabilistic bili i Robotics (Thrun, et. al.)
More informationDescription of The Algorithm
Description of The Algorithm Dijkstra s algorithm works by solving the sub-problem k, which computes the shortest path from the source to vertices among the k closest vertices to the source. For the dijkstra
More informationCS283: Robotics Fall 2016: Sensors
CS283: Robotics Fall 2016: Sensors Sören Schwertfeger / 师泽仁 ShanghaiTech University Robotics ShanghaiTech University - SIST - 23.09.2016 2 REVIEW TRANSFORMS Robotics ShanghaiTech University - SIST - 23.09.2016
More informationEE631 Cooperating Autonomous Mobile Robots
EE631 Cooperating Autonomous Mobile Robots Lecture 3: Path Planning Algorithm Prof. Yi Guo ECE Dept. Plan Representing the Space Path Planning Methods A* Search Algorithm D* Search Algorithm Representing
More informationCS283: Robotics Fall 2016: Software
CS283: Robotics Fall 2016: Software Sören Schwertfeger / 师泽仁 ShanghaiTech University Mobile Robotics ShanghaiTech University - SIST - 18.09.2016 2 Review Definition Robot: A machine capable of performing
More informationAdvanced Robotics Path Planning & Navigation
Advanced Robotics Path Planning & Navigation 1 Agenda Motivation Basic Definitions Configuration Space Global Planning Local Planning Obstacle Avoidance ROS Navigation Stack 2 Literature Choset, Lynch,
More informationObstacle Avoidance (Local Path Planning)
Obstacle Avoidance (Local Path Planning) The goal of the obstacle avoidance algorithms is to avoid collisions with obstacles It is usually based on local map Often implemented as a more or less independent
More informationVisibility Graph. How does a Mobile Robot get from A to B?
Robot Path Planning Things to Consider: Spatial reasoning/understanding: robots can have many dimensions in space, obstacles can be complicated Global Planning: Do we know the environment apriori? Online
More informationMotion Planning, Part III Graph Search, Part I. Howie Choset
Motion Planning, Part III Graph Search, Part I Howie Choset Happy President s Day The Configuration Space What it is A set of reachable areas constructed from knowledge of both the robot and the world
More informationPath Planning. Jacky Baltes Dept. of Computer Science University of Manitoba 11/21/10
Path Planning Jacky Baltes Autonomous Agents Lab Department of Computer Science University of Manitoba Email: jacky@cs.umanitoba.ca http://www.cs.umanitoba.ca/~jacky Path Planning Jacky Baltes Dept. of
More informationAdvanced Robotics Path Planning & Navigation
Advanced Robotics Path Planning & Navigation 1 Agenda Motivation Basic Definitions Configuration Space Global Planning Local Planning Obstacle Avoidance ROS Navigation Stack 2 Literature Choset, Lynch,
More informationVisual Navigation for Flying Robots. Motion Planning
Computer Vision Group Prof. Daniel Cremers Visual Navigation for Flying Robots Motion Planning Dr. Jürgen Sturm Motivation: Flying Through Forests 3 1 2 Visual Navigation for Flying Robots 2 Motion Planning
More informationSung-Eui Yoon ( 윤성의 )
Path Planning for Point Robots Sung-Eui Yoon ( 윤성의 ) Course URL: http://sglab.kaist.ac.kr/~sungeui/mpa Class Objectives Motion planning framework Classic motion planning approaches 2 3 Configuration Space:
More informationSpring Localization II. Roland Siegwart, Margarita Chli, Martin Rufli. ASL Autonomous Systems Lab. Autonomous Mobile Robots
Spring 2016 Localization II Localization I 25.04.2016 1 knowledge, data base mission commands Localization Map Building environment model local map position global map Cognition Path Planning path Perception
More informationIntroduction to Mobile Robotics Path Planning and Collision Avoidance. Wolfram Burgard, Maren Bennewitz, Diego Tipaldi, Luciano Spinello
Introduction to Mobile Robotics Path Planning and Collision Avoidance Wolfram Burgard, Maren Bennewitz, Diego Tipaldi, Luciano Spinello 1 Motion Planning Latombe (1991): is eminently necessary since, by
More informationProbabilistic Methods for Kinodynamic Path Planning
16.412/6.834J Cognitive Robotics February 7 th, 2005 Probabilistic Methods for Kinodynamic Path Planning Based on Past Student Lectures by: Paul Elliott, Aisha Walcott, Nathan Ickes and Stanislav Funiak
More informationMotion Planning. Howie CHoset
Motion Planning Howie CHoset Questions Where are we? Where do we go? Which is more important? Encoders Encoders Incremental Photodetector Encoder disk LED Photoemitter Encoders - Incremental Encoders -
More informationLocalization, Where am I?
5.1 Localization, Where am I?? position Position Update (Estimation?) Encoder Prediction of Position (e.g. odometry) YES matched observations Map data base predicted position Matching Odometry, Dead Reckoning
More informationECE276B: Planning & Learning in Robotics Lecture 5: Configuration Space
ECE276B: Planning & Learning in Robotics Lecture 5: Configuration Space Lecturer: Nikolay Atanasov: natanasov@ucsd.edu Teaching Assistants: Tianyu Wang: tiw161@eng.ucsd.edu Yongxi Lu: yol070@eng.ucsd.edu
More informationRobotics Tasks. CS 188: Artificial Intelligence Spring Manipulator Robots. Mobile Robots. Degrees of Freedom. Sensors and Effectors
CS 188: Artificial Intelligence Spring 2006 Lecture 5: Robot Motion Planning 1/31/2006 Dan Klein UC Berkeley Many slides from either Stuart Russell or Andrew Moore Motion planning (today) How to move from
More informationAlgorithms for Sensor-Based Robotics: Sampling-Based Motion Planning
Algorithms for Sensor-Based Robotics: Sampling-Based Motion Planning Computer Science 336 http://www.cs.jhu.edu/~hager/teaching/cs336 Professor Hager http://www.cs.jhu.edu/~hager Recall Earlier Methods
More informationIntroduction to Mobile Robotics Path Planning and Collision Avoidance
Introduction to Mobile Robotics Path Planning and Collision Avoidance Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Giorgio Grisetti, Kai Arras 1 Motion Planning Latombe (1991): eminently necessary
More informationRobot Motion Planning
Robot Motion Planning slides by Jan Faigl Department of Computer Science and Engineering Faculty of Electrical Engineering, Czech Technical University in Prague lecture A4M36PAH - Planning and Games Dpt.
More informationSpring 2010: Lecture 9. Ashutosh Saxena. Ashutosh Saxena
CS 4758/6758: Robot Learning Spring 2010: Lecture 9 Why planning and control? Video Typical Architecture Planning 0.1 Hz Control 50 Hz Does it apply to all robots and all scenarios? Previous Lecture: Potential
More informationNavigation and Metric Path Planning
Navigation and Metric Path Planning October 4, 2011 Minerva tour guide robot (CMU): Gave tours in Smithsonian s National Museum of History Example of Minerva s occupancy map used for navigation Objectives
More informationRoadmaps. Vertex Visibility Graph. Reduced visibility graph, i.e., not including segments that extend into obstacles on either side.
Roadmaps Vertex Visibility Graph Full visibility graph Reduced visibility graph, i.e., not including segments that extend into obstacles on either side. (but keeping endpoints roads) what else might we
More informationComputer Game Programming Basic Path Finding
15-466 Computer Game Programming Basic Path Finding Robotics Institute Path Planning Sven Path Planning needs to be very fast (especially for games with many characters) needs to generate believable paths
More informationMetric Planning: Overview
Also called quantitative planning Tries to find optimal path to goal Metric Planning: Overview As opposed to some path as per qualitative approach Usually plans path as series of subgoals (waypoints) Optimal/best
More informationLesson 1 Introduction to Path Planning Graph Searches: BFS and DFS
Lesson 1 Introduction to Path Planning Graph Searches: BFS and DFS DASL Summer Program Path Planning References: http://robotics.mem.drexel.edu/mhsieh/courses/mem380i/index.html http://dasl.mem.drexel.edu/hing/bfsdfstutorial.htm
More informationHumanoid Robotics. Path Planning and Walking. Maren Bennewitz
Humanoid Robotics Path Planning and Walking Maren Bennewitz 1 Introduction Given the robot s pose in a model of the environment Compute a path to a target location First: 2D path in a 2D grid map representation
More information6.141: Robotics systems and science Lecture 10: Motion Planning III
6.141: Robotics systems and science Lecture 10: Motion Planning III Lecture Notes Prepared by N. Roy and D. Rus EECS/MIT Spring 2012 Reading: Chapter 3, and Craig: Robotics http://courses.csail.mit.edu/6.141/!
More informationIntroduction to Mobile Robotics Path and Motion Planning. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello
Introduction to Mobile Robotics Path and Motion Planning Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello 1 Motion Planning Latombe (1991): eminently necessary since,
More informationFinal Exam Practice Fall Semester, 2012
COS 495 - Autonomous Robot Navigation Final Exam Practice Fall Semester, 2012 Duration: Total Marks: 70 Closed Book 2 hours Start Time: End Time: By signing this exam, I agree to the honor code Name: Signature:
More informationLocal Search Methods. CS 188: Artificial Intelligence Fall Announcements. Hill Climbing. Hill Climbing Diagram. Today
CS 188: Artificial Intelligence Fall 2006 Lecture 5: Robot Motion Planning 9/14/2006 Local Search Methods Queue-based algorithms keep fallback options (backtracking) Local search: improve what you have
More informationPlanning, Execution and Learning Application: Examples of Planning for Mobile Manipulation and Articulated Robots
15-887 Planning, Execution and Learning Application: Examples of Planning for Mobile Manipulation and Articulated Robots Maxim Likhachev Robotics Institute Carnegie Mellon University Two Examples Planning
More informationObstacle Avoidance (Local Path Planning)
6.2.2 Obstacle Avoidance (Local Path Planning) The goal of the obstacle avoidance algorithms is to avoid collisions with obstacles It is usually based on local map Often implemented as a more or less independent
More informationMotion Planning. Howie CHoset
Motion Planning Howie CHoset What is Motion Planning? What is Motion Planning? Determining where to go Overview The Basics Motion Planning Statement The World and Robot Configuration Space Metrics Algorithms
More informationMobile Robots Locomotion
Mobile Robots Locomotion Institute for Software Technology 1 Course Outline 1. Introduction to Mobile Robots 2. Locomotion 3. Sensors 4. Localization 5. Environment Modelling 6. Reactive Navigation 2 Today
More informationRobot Motion Planning and (a little) Computational Geometry
Images taken from slides b B. Baazit, G. Dudek, J. C. Latombe and A. Moore Robot Motion Planning and (a little) Computational Geometr Topics: Transforms Topological Methods Configuration space Skeletonization
More informationLocalization and Map Building
Localization and Map Building Noise and aliasing; odometric position estimation To localize or not to localize Belief representation Map representation Probabilistic map-based localization Other examples
More informationGeometric Path Planning McGill COMP 765 Oct 12 th, 2017
Geometric Path Planning McGill COMP 765 Oct 12 th, 2017 The Motion Planning Problem Intuition: Find a safe path/trajectory from start to goal More precisely: A path is a series of robot configurations
More informationAnnouncements. CS 188: Artificial Intelligence Fall Robot motion planning! Today. Robotics Tasks. Mobile Robots
CS 188: Artificial Intelligence Fall 2007 Lecture 6: Robot Motion Planning 9/13/2007 Announcements Project 1 due (yesterday)! Project 2 (Pacman with ghosts) up in a few days Reminder: you are allowed to
More informationCS 188: Artificial Intelligence Fall Announcements
CS 188: Artificial Intelligence Fall 2007 Lecture 6: Robot Motion Planning 9/13/2007 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore Announcements Project
More informationPlanning: Part 1 Classical Planning
Planning: Part 1 Classical Planning Computer Science 6912 Department of Computer Science Memorial University of Newfoundland July 12, 2016 COMP 6912 (MUN) Planning July 12, 2016 1 / 9 Planning Localization
More informationRobotics. CSPP Artificial Intelligence March 10, 2004
Robotics CSPP 56553 Artificial Intelligence March 10, 2004 Roadmap Robotics is AI-complete Integration of many AI techniques Classic AI Search in configuration space (Ultra) Modern AI Subsumption architecture
More information6.141: Robotics systems and science Lecture 10: Implementing Motion Planning
6.141: Robotics systems and science Lecture 10: Implementing Motion Planning Lecture Notes Prepared by N. Roy and D. Rus EECS/MIT Spring 2011 Reading: Chapter 3, and Craig: Robotics http://courses.csail.mit.edu/6.141/!
More informationConfiguration Space of a Robot
Robot Path Planning Overview: 1. Visibility Graphs 2. Voronoi Graphs 3. Potential Fields 4. Sampling-Based Planners PRM: Probabilistic Roadmap Methods RRTs: Rapidly-exploring Random Trees Configuration
More informationAlgorithms for Sensor-Based Robotics: Sampling-Based Motion Planning
Algorithms for Sensor-Based Robotics: Sampling-Based Motion Planning Computer Science 336 http://www.cs.jhu.edu/~hager/teaching/cs336 Professor Hager http://www.cs.jhu.edu/~hager Recall Earlier Methods
More informationRobot Motion Planning
Robot Motion Planning James Bruce Computer Science Department Carnegie Mellon University April 7, 2004 Agent Planning An agent is a situated entity which can choose and execute actions within in an environment.
More information6 Planning and Navigation:
6 Planning and Navigation: Where am I going? How do I get there? 231 6 Planning and Navigation: Where am I going? How do I get there? 6.1 Introduction This text has focused on the elements of a mobile
More informationPath Planning. Ioannis Rekleitis
Path Planning Ioannis Rekleitis Outline Path Planning Visibility Graph Potential Fields Bug Algorithms Skeletons/Voronoi Graphs C-Space CSCE-574 Robotics 2 Mo+on Planning The ability to go from A to B
More informationBasic Motion Planning Algorithms
Basic Motion Planning Algorithms Sohaib Younis Intelligent Robotics 7 January, 2013 1 Outline Introduction Environment Map Dijkstra's algorithm A* algorithm Summary 2 Introduction Definition: Motion Planning
More informationCOS Lecture 13 Autonomous Robot Navigation
COS 495 - Lecture 13 Autonomous Robot Navigation Instructor: Chris Clark Semester: Fall 2011 1 Figures courtesy of Siegwart & Nourbakhsh Control Structure Prior Knowledge Operator Commands Localization
More informationPractical Robotics (PRAC)
Practical Robotics (PRAC) A Mobile Robot Navigation System (1) - Sensor and Kinematic Modelling Nick Pears University of York, Department of Computer Science December 17, 2014 nep (UoY CS) PRAC Practical
More informationSimultaneous Localization and Mapping (SLAM)
Simultaneous Localization and Mapping (SLAM) RSS Lecture 16 April 8, 2013 Prof. Teller Text: Siegwart and Nourbakhsh S. 5.8 SLAM Problem Statement Inputs: No external coordinate reference Time series of
More informationSampling-based Planning 2
RBE MOTION PLANNING Sampling-based Planning 2 Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Problem with KD-tree RBE MOTION PLANNING Curse of dimension
More informationMobile Robots: An Introduction.
Mobile Robots: An Introduction Amirkabir University of Technology Computer Engineering & Information Technology Department http://ce.aut.ac.ir/~shiry/lecture/robotics-2004/robotics04.html Introduction
More informationSub-optimal Heuristic Search and its Application to Planning for Manipulation
Sub-optimal Heuristic Search and its Application to Planning for Manipulation Mike Phillips Slides adapted from Planning for Mobile Manipulation What planning tasks are there? robotic bartender demo at
More informationApproximate path planning. Computational Geometry csci3250 Laura Toma Bowdoin College
Approximate path planning Computational Geometry csci3250 Laura Toma Bowdoin College Outline Path planning Combinatorial Approximate Combinatorial path planning Idea: Compute free C-space combinatorially
More informationIntroduction to Autonomous Mobile Robots
Introduction to Autonomous Mobile Robots second edition Roland Siegwart, Illah R. Nourbakhsh, and Davide Scaramuzza The MIT Press Cambridge, Massachusetts London, England Contents Acknowledgments xiii
More informationUnit 5: Part 1 Planning
Unit 5: Part 1 Planning Computer Science 4766/6778 Department of Computer Science Memorial University of Newfoundland March 25, 2014 COMP 4766/6778 (MUN) Planning March 25, 2014 1 / 9 Planning Localization
More informationNotes. Video Game AI: Lecture 5 Planning for Pathfinding. Lecture Overview. Knowledge vs Search. Jonathan Schaeffer this Friday
Notes Video Game AI: Lecture 5 Planning for Pathfinding Nathan Sturtevant COMP 3705 Jonathan Schaeffer this Friday Planning vs localization We cover planning today Localization is just mapping a real-valued
More informationDiscrete Motion Planning
RBE MOTION PLANNING Discrete Motion Planning Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Announcement Homework 1 is out Due Date - Feb 1 Updated
More informationDIJKSTRA'S ALGORITHM. By Laksman Veeravagu and Luis Barrera
DIJKSTRA'S ALGORITHM By Laksman Veeravagu and Luis Barrera THE AUTHOR: EDSGER WYBE DIJKSTRA "Computer Science is no more about computers than astronomy is about telescopes." http://www.cs.utexas.edu/~ewd/
More informationSimultaneous Localization
Simultaneous Localization and Mapping (SLAM) RSS Technical Lecture 16 April 9, 2012 Prof. Teller Text: Siegwart and Nourbakhsh S. 5.8 Navigation Overview Where am I? Where am I going? Localization Assumed
More informationIntroduction to State-of-the-art Motion Planning Algorithms. Presented by Konstantinos Tsianos
Introduction to State-of-the-art Motion Planning Algorithms Presented by Konstantinos Tsianos Robots need to move! Motion Robot motion must be continuous Geometric constraints Dynamic constraints Safety
More informationSub-Optimal Heuristic Search ARA* and Experience Graphs
Robot Autonomy (16-662, S13) Lecture#09 (Wednesday Feb 13, 2013) Lecture by: Micheal Phillips Sub-Optimal Heuristic Search ARA* and Experience Graphs Scribes: S.Selvam Raju and Adam Lebovitz Contents 1
More informationRobotics/Perception II
Robotics/Perception II Artificial Intelligence and Integrated Computer Systems Division (AIICS) Outline Sensors - summary Computer systems Robotic architectures Mapping and Localization Motion planning
More informationPath Planning for Point Robots. NUS CS 5247 David Hsu
Path Planning for Point Robots NUS CS 5247 David Hsu Problem Input Robot represented as a point in the plane Obstacles represented as polygons Initial and goal positions Output A collision-free path between
More informationCOMPARISON OF ROBOT NAVIGATION METHODS USING PERFORMANCE METRICS
COMPARISON OF ROBOT NAVIGATION METHODS USING PERFORMANCE METRICS Adriano Flores Dantas, Rodrigo Porfírio da Silva Sacchi, Valguima V. V. A. Odakura Faculdade de Ciências Exatas e Tecnologia (FACET) Universidade
More informationNon-holonomic Planning
Non-holonomic Planning Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Recap We have learned about RRTs. q new q init q near q rand But the standard
More informationSearch-based Planning with Motion Primitives. Maxim Likhachev Carnegie Mellon University
Search-based Planning with Motion Primitives Maxim Likhachev Carnegie Mellon University generate a graph representation of the planning problem search the graph for a solution What is Search-based Planning
More informationExam in DD2426 Robotics and Autonomous Systems
Exam in DD2426 Robotics and Autonomous Systems Lecturer: Patric Jensfelt KTH, March 16, 2010, 9-12 No aids are allowed on the exam, i.e. no notes, no books, no calculators, etc. You need a minimum of 20
More informationGeometric Computations for Simulation
1 Geometric Computations for Simulation David E. Johnson I. INTRODUCTION A static virtual world would be boring and unlikely to draw in a user enough to create a sense of immersion. Simulation allows things
More informationTopological Navigation and Path Planning
Topological Navigation and Path Planning Topological Navigation and Path Planning Based upon points of interest E.g., landmarks Navigation is relational between points of interest E.g., Go past the corner
More informationMobile Robots Summery. Autonomous Mobile Robots
Mobile Robots Summery Roland Siegwart Mike Bosse, Marco Hutter, Martin Rufli, Davide Scaramuzza, (Margarita Chli, Paul Furgale) Mobile Robots Summery 1 Introduction probabilistic map-based localization
More informationPerception. Autonomous Mobile Robots. Sensors Vision Uncertainties, Line extraction from laser scans. Autonomous Systems Lab. Zürich.
Autonomous Mobile Robots Localization "Position" Global Map Cognition Environment Model Local Map Path Perception Real World Environment Motion Control Perception Sensors Vision Uncertainties, Line extraction
More informationSpring Localization II. Roland Siegwart, Margarita Chli, Juan Nieto, Nick Lawrance. ASL Autonomous Systems Lab. Autonomous Mobile Robots
Spring 2018 Localization II Localization I 16.04.2018 1 knowledge, data base mission commands Localization Map Building environment model local map position global map Cognition Path Planning path Perception
More informationCS4733 Class Notes, Computer Vision
CS4733 Class Notes, Computer Vision Sources for online computer vision tutorials and demos - http://www.dai.ed.ac.uk/hipr and Computer Vision resources online - http://www.dai.ed.ac.uk/cvonline Vision
More informationProbabilistic Robotics
Probabilistic Robotics Probabilistic Motion and Sensor Models Some slides adopted from: Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Kai Arras and Probabilistic Robotics Book SA-1 Sensors for Mobile
More informationTrajectory Optimization
Trajectory Optimization Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Recap We heard about RRT*, a sampling-based planning in high-dimensional cost
More informationJo-Car2 Autonomous Mode. Path Planning (Cost Matrix Algorithm)
Chapter 8.2 Jo-Car2 Autonomous Mode Path Planning (Cost Matrix Algorithm) Introduction: In order to achieve its mission and reach the GPS goal safely; without crashing into obstacles or leaving the lane,
More information15-494/694: Cognitive Robotics
15-494/694: Cognitive Robotics Dave Touretzky Lecture 9: Path Planning with Rapidly-exploring Random Trees Navigating with the Pilot Image from http://www.futuristgerd.com/2015/09/10 Outline How is path
More informationMotion Planning, Part IV Graph Search Part II. Howie Choset
Motion Planning, Part IV Graph Search Part II Howie Choset Map-Based Approaches: Properties of a roadmap: Roadmap Theory Accessibility: there exists a collision-free path from the start to the road map
More informationCinematica dei Robot Mobili su Ruote. Corso di Robotica Prof. Davide Brugali Università degli Studi di Bergamo
Cinematica dei Robot Mobili su Ruote Corso di Robotica Prof. Davide Brugali Università degli Studi di Bergamo Riferimenti bibliografici Roland SIEGWART, Illah R. NOURBAKHSH Introduction to Autonomous Mobile
More informationPlanning in Mobile Robotics
Planning in Mobile Robotics Part I. Miroslav Kulich Intelligent and Mobile Robotics Group Gerstner Laboratory for Intelligent Decision Making and Control Czech Technical University in Prague Tuesday 26/07/2011
More informationLecture 3: Motion Planning (cont.)
CS 294-115 Algorithmic Human-Robot Interaction Fall 2016 Lecture 3: Motion Planning (cont.) Scribes: Molly Nicholas, Chelsea Zhang 3.1 Previously in class... Recall that we defined configuration spaces.
More informationCS4733 Class Notes. 1 2-D Robot Motion Planning Algorithm Using Grown Obstacles
CS4733 Class Notes 1 2-D Robot Motion Planning Algorithm Using Grown Obstacles Reference: An Algorithm for Planning Collision Free Paths Among Poyhedral Obstacles by T. Lozano-Perez and M. Wesley. This
More informationRobot Mapping. SLAM Front-Ends. Cyrill Stachniss. Partial image courtesy: Edwin Olson 1
Robot Mapping SLAM Front-Ends Cyrill Stachniss Partial image courtesy: Edwin Olson 1 Graph-Based SLAM Constraints connect the nodes through odometry and observations Robot pose Constraint 2 Graph-Based
More informationFast Local Planner for Autonomous Helicopter
Fast Local Planner for Autonomous Helicopter Alexander Washburn talexan@seas.upenn.edu Faculty advisor: Maxim Likhachev April 22, 2008 Abstract: One challenge of autonomous flight is creating a system
More informationCMU-Q Lecture 2: Search problems Uninformed search. Teacher: Gianni A. Di Caro
CMU-Q 15-381 Lecture 2: Search problems Uninformed search Teacher: Gianni A. Di Caro RECAP: ACT RATIONALLY Think like people Think rationally Agent Sensors? Actuators Percepts Actions Environment Act like
More informationCourse Outline. Video Game AI: Lecture 7 Heuristics & Smoothing. Finding the best location out of several. Variable size units / special movement?
Course Outline Video Game AI: Lecture 7 Heuristics & Smoothing Nathan Sturtevant COMP 3705 http://aigamedev.com/ now has free interviews! Miscellaneous details Heuristics How better heuristics can be built
More informationCSE-571. Deterministic Path Planning in Robotics. Maxim Likhachev 1. Motion/Path Planning. Courtesy of Maxim Likhachev University of Pennsylvania
Motion/Path Planning CSE-57 Deterministic Path Planning in Robotics Courtesy of Maxim Likhachev University of Pennsylvania Tas k : find a feasible (and cost-minimal) path/motion from the current configuration
More informationNonholonomic motion planning for car-like robots
Nonholonomic motion planning for car-like robots A. Sánchez L. 2, J. Abraham Arenas B. 1, and René Zapata. 2 1 Computer Science Dept., BUAP Puebla, Pue., México {aarenas}@cs.buap.mx 2 LIRMM, UMR5506 CNRS,
More information