Metric Planning: Overview

 Dayna Julie Walters
 8 months ago
 Views:
Transcription
1 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 implies there exists a metric of comparison Optimal path algorithms computationally expensive Want to make as efficient as possible This approach requires 2 components: 1. Representation Data structure to represent world Must be usable by planning algorithm Should only represent what s necessary for planning 2. Algorithm 2 general types: (a) Ones that treat planning as graph problem (b) Ones that treat planning as a colorfill algorithm Hybrid model must address problem of interleaving deliberation and reaction 1
2 Metric Planning: CSpace Intro Configuration Space (CSpace): Data structure that represents world Usd to situate robot and obstacles in world Degrees of freedom: parameters needed to situate robot in space Need 6 in 3D: 1. 3 Cartesian coordinates (x, y, z) 2. 3 Euler angles (φ, θ, γ: pitch, yaw, roll) Want to use as few as possible to minimize storage 2 (x, y) often sufficient Holonomic robot: one that can turn in place Can be considered round Orientation not a factor in this case Simplifies DOF There are a number of CSpace representations: 1. Meadow map (hybrid vertexgraph freespace model) 2. Generalized Voronoi graph (GVG) 3. Regular grid 4. Quadtree (Octree) Each represents free (unoccupied) space differently 2
3 Metric Planning: CSpace Representations  Meadow Maps Generates CSpace from existing detailed map Expand boundaries of obstacles by radius of robot Can then treat robot as a point without need to worry about collisions Based on convex polygons Can travel from any point on perimeter to any other point on perimeter of convex poly without ever leaving poly If poly encloses free space, robot traveling such a path will have no collisions 3 general steps: 1. Make basic unit/ pixel size = size of robot 3
4 Metric Planning: CSpace Representations  Meadow Maps (2) 2. Create polygons Connect interesting features (corners, door frames,...) Identify useful polygons for partition 3. Create path Need to id points on perimeters of polys that connect polys Collection of these points and edges between result in a graph of free space One possibility: Choose midpoint of perimeter edges that are shared between 2 polys Given a start node and goal node, search graph for path Nodes on path become waypoints (subgoals) 4
5 Metric Planning: CSpace Representations  Meadow Maps (3) Problems: 1. Path is jagged Use path relaxation to alleviate 2. Polygon id computationally complex 3. Path not based on features that can be sensed, but on map artifacts i.e., robot must use selflocalization 4. Hard to update CSpace if original map inaccurate 5
6 Metric Planning: CSpace Representations  Generalized Voronoi Graph (GVG) Path follows lines that are equidistant from all obstacles Such lines called Voronoi edges Points of convergence called Voronoi vertices Often correspond to features that can be sensed in environment Collection of Voronoi edges and vertices create a graph of free space By following edges, robot guaranteed not to collide with obstacle Can be created as robot navigates  do not necessarily need a priori map 6
7 Metric Planning: CSpace Representations  Regular (Occupancy) Grid World divided into regular rectangular cells If any part of cell occupied, entire cell is considered occupied Consider center of each cell a node Collection of nodes and edges between create a graph of free space 4connected cell links to neighbors thru sides 8connected cell links to neighbors thru sides and vertices Problems: 1. Digitation bias: Cell is considered filled if only a small fraction is actually occupied Results in wasted space Solution: Make cells small 2. Small cells require more storage 7
8 Metric Planning: CSpace Representations  Quadtree (Octree) Developed to solve problems of regular grid approach Grid uses large cells If grid partially occupied, subdivide grid into 4 equal subcells Recursively apply subdivision to partially filled subcells Centers of free cells represented as graph nodes Adjacent free nodes connected by graph edges Minimizes wasted free space, maximizes storage efficiency 8
9 Metric Planning: A Algorithm Given a graph, want to find optimal path from start to goal node Do not want algorithm to visit every node in graph: computationally expensive One solution is to use branchandbound algorithms: Those that only consider a path that looks promising When path becomes less promising (more expensive) than others, temporarily abandon it and pursue the more attractive ones A algorithm Basis of A Searches a state space for an optimal path State space is entire graph: all nodes and edges between them From a given node, need to decide which leaving edge is best one to take Decision based on following equation: f(n) = g(n) + h(n), where g(n) is cost of getting from start state to node n h(n) is cost of getting from node n to goal state f(n) is total cost of going from start to goal state via node n Note that h(n) and g(n) are known values Hence, selecting the node n with minimal f(n) as next node to visit from start to goal node, will generate optimal (minimal cost) path Problem: Since assumes h(n) known, can only have been determined by visiting all nodes in the graph, which is what want to avoid 9
10 Metric Planning: A Algorithm Same basic algorithm as A, but uses different evaluation function: f (n) = g (n) + h (n), where * means value is estimated g (n) g(n) since always know actual cost of getting from start to node n h (n) is heuristic function  rule of thumb for estimating cost to goal f(n) is total cost of going from start to goal state via node n Since f (n) is an estimate, how can optimal path be guaranteed? If h (n) h(n), path guaranteed optimal Any algorithm for which this relation is true is called admissible (hence algorithm A) 10
11 Metric Planning: A Algorithm (2) Example: Edges are labeled with the costs of moving between nodes. The following table lists the h values for each node. Node h A 15 B 13 C 9 D 15 E 13 F 12 G 1 H 7 I 9 J 0 Initial state is A Goal state is J 11
12 Partial plan generation: 1. Queue: A(15) Pop A f(b) = = 16 f(c) = = 18 f(d) = = Queue: B(16)D(17)C(18) Pop B f(e) = = 24 f(f ) = = Queue: D(17)C(18)F(19)E(24) Pop D f(h) = = 13 f(i) = = 18 Metric Planning: A Algorithm (3) 4. Queue: H(13)D(17)C(18)I(18)F(19)E(24) Pop H f(c) = = 16 Found a shorter path to C  update queue 5. Queue: C(16)D(17)I(18)F(19)E(24) Pop C f(g) = = Queue: G(16)D(17)I(18)F(19)E(24) etc. 12
13 Metric Planning: A Algorithm (4) For planning where optimal path is shortest, can let h (n) = Euclidean distance between node n and goal Note that since using a metric map, will know coordinates of all nodes Points of interest: Edges cannot have negative costs Algorithm must account for cycles New path to a node may be cheaper than one previously found Can include additional factors in path cost: terrain, presence of enemies, etc. 13
14 Metric Planning: Wavefront Approach Based on concept of heat propagation through solids (or CG colorfill algorithms) Create regular grid From start node, propagate outward Propagation rate dependent on nature of cell If free, conductivity = infinite If occupied, conductivity = 0 Can model types of terrain, etc. by assigning low values to those least desirable Path that reaches goal first is optimal 14
15 Metric Planning: Wavefront Approach (2) 15
16 Metric Planning: Wavefront Approach (3) 16
17 Metric Planning: Wavefront Approach (4) 17
18 Metric Planning: Wavefront Approach (5) 18
19 Metric Planning: Wavefront Approach (6) Trulla developed variant that uses this approach to generate potential field like vectors in each cell Side effect is optimal path to goal from any cell in world 19
20 Metric Planning: Interleaving Planning and Execution Hybrid planners tend to generate paths in terms of waypoints, which are passed to reactive component onebyone 2 problems can arise during reactive execution of metric path: 1. Subgoal obsession (1) Result of goalsatisfaction requirements that are too strict Observed behavior is robot making lots of fine positioning adjustments at subgoal Problem worse for nonholonomic robots Wastes time and effort Can alleviate by easing satisfaction requirements e.g., use tolerance of 1 robot diameter 2. Subgoal obsession (2) Subgoal is unreachable Since in reactive mode, robot may not recognize is stuck Remedy: Impose time limit on subgoal satisfaction 3. Lack of opportunistic improvements Recognizing when current plan should be abandoned in favor of revised plan: Abandoning current subgoal in favor of subsequent one Replanning current path to subgoal 20
21 Metric Planning: Interleaving Planning and Execution (2) Solutions to subgoal obsession and opportunistic improvement 1. D algorithm (Stentz) Uses A to compute optimal path from every node in map 2. Trulla s wavefront algorithm Generates optimal path from every node as part of basic algorithm 3. In both cases, if robot diverted from optimal path, will know optimal path from current location if it can localize itself 4. Problems: (a) May cause excessive wandering or entrapment if many obstacles 5. Solutions to problems: (a) Continuous replanning When encounter unexpected obstacle, update map and adjust paths affected (D ) Problems: i. Computationally expensive ii. Dependent on sensor quality  may result in erratic paths (b) Eventdriven replanning Event triggered by sensor readings causes replanning (Trulla) Problems: i. Cannot take advantage of favorable differences 21
Motion 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 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 informationCollision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering
RBE 550 MOTION PLANNING BASED ON DR. DMITRY BERENSON S RBE 550 Collision Detection Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Euler Angle RBE
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 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 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 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 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 informationRobotic Motion Planning: A* and D* Search
Robotic Motion Planning: A* and D* Search Robotics Institute 675 http://voronoi.sbp.ri.cmu.edu/~motion Howie Choset http://voronoi.sbp.ri.cmu.edu/~choset 675, Howie Choset with slides from G. Ayorker
More informationRecent Results in Path Planning for Mobile Robots Operating in Vast Outdoor Environments
In Proc. 1998 Symposium on Image, Speech, Signal Processing and Robotics, The Chinese University of Hong Kong, September,1998. Recent Results in Path Planning for Mobile Robots Operating in Vast Outdoor
More informationMotion Planning for a Point Robot (2/2) Point Robot on a Grid. Planning requires models. Point Robot on a Grid 1/18/2012.
Motion Planning for a Point Robot (/) Class scribing Position paper 1 Planning requires models Point Robot on a Grid The Bug algorithms are reactive motion strategies ; they are not motion planners To
More informationLecture 3: Motion Planning (cont.)
CS 294115 Algorithmic HumanRobot 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 informationElastic Bands: Connecting Path Planning and Control
Elastic Bands: Connecting Path Planning and Control Sean Quinlan and Oussama Khatib Robotics Laboratory Computer Science Department Stanford University Abstract Elastic bands are proposed as the basis
More informationMotion Planning 2D. Corso di Robotica Prof. Davide Brugali Università degli Studi di Bergamo
Motion Planning 2D Corso di Robotica Prof. Davide Brugali Università degli Studi di Bergamo Tratto dai corsi: CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Prof. J.C. Latombe Stanford
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 informationCS 771 Artificial Intelligence. Informed Search
CS 771 Artificial Intelligence Informed Search Outline Review limitations of uninformed search methods Informed (or heuristic) search Uses problemspecific heuristics to improve efficiency Bestfirst,
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 informationOutline. Bestfirst search
Outline Bestfirst search Greedy bestfirst search A* search Heuristics Admissible Heuristics Graph Search Consistent Heuristics Local search algorithms Hillclimbing search Beam search Simulated annealing
More informationMEM380 Applied Autonomous Robots Fall Depth First Search A* and Dijkstra s Algorithm
MEM380 Applied Autonomous Robots Fall Breadth First Search Depth First Search A* and Dijkstra s Algorithm Admin Stuff Course Website: http://robotics.mem.drexel.edu/mhsieh/courses/mem380i/ Instructor:
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 informationInformed search algorithms
Informed search algorithms This lecture topic Chapter 3.53.7 Next lecture topic Chapter 4.14.2 (Please read lecture topic material before and after each lecture on that topic) Outline Review limitations
More informationInformed Search Algorithms
Informed Search Algorithms CITS3001 Algorithms, Agents and Artificial Intelligence Tim French School of Computer Science and Software Engineering The University of Western Australia 2017, Semester 2 Introduction
More informationCollision Detection based on Spatial Partitioning
Simulation in Computer Graphics Collision Detection based on Spatial Partitioning Matthias Teschner Computer Science Department University of Freiburg Outline introduction uniform grid Octree and kd tree
More informationChapter 12. Path Planning. Beard & McLain, Small Unmanned Aircraft, Princeton University Press, 2012,
Chapter 12 Path Planning Beard & McLain, Small Unmanned Aircraft, Princeton University Press, 212, Chapter 12: Slide 1 Control Architecture destination, obstacles map path planner waypoints status path
More informationManipula0on Algorithms Mo0on Planning. Mo#on Planning I. Katharina Muelling (NREC, Carnegie Mellon University) 1
16843 Manipula0on Algorithms Mo0on Planning Mo#on Planning I Katharina Muelling (NREC, Carnegie Mellon University) 1 Configura0on Space Obstacles Star Algorithm Convex robot, transla#on C obs : convex
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 Cspace combinatorially
More informationComputational Geometry
Lecture 12: Lecture 12: Motivation: Terrains by interpolation To build a model of the terrain surface, we can start with a number of sample points where we know the height. Lecture 12: Motivation: Terrains
More informationAr#ficial)Intelligence!!
Introduc*on! Ar#ficial)Intelligence!! Roman Barták Department of Theoretical Computer Science and Mathematical Logic Uninformed (blind) search algorithms can find an (optimal) solution to the problem,
More informationDiscrete search algorithms
Robot Autonomy (16662, S13) Lecture#08 (Monday February 11) Discrete search algorithms Lecturer: Siddhartha Srinivasa Scribes: Kavya Suresh & David Matten I. INTRODUCTION These notes contain a detailed
More informationOptimal Path Planning with A* Search Algorithm
Optimal Path Planning with A* Search Algorithm M. Michael Nourai Department of Computer Science University of Massachusetts Lowell mnourai@cs.uml.edu ABSTRACT In this paper I describe my findings and implementation
More informationSpatial Data Structures
CSCI 480 Computer Graphics Lecture 7 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids BSP Trees [Ch. 0.] March 8, 0 Jernej Barbic University of Southern California http://wwwbcf.usc.edu/~jbarbic/cs480s/
More informationAlgorithms for SensorBased Robotics: SamplingBased Motion Planning
Algorithms for SensorBased Robotics: SamplingBased 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 informationMotion Planning of Multiple Mobile Robots for Cooperative Manipulation and Transportation
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 19, NO. 2, APRIL 2003 223 Motion Planning of Multiple Mobile Robots for Cooperative Manipulation and Transportation Atsushi Yamashita, Member, IEEE, Tamio
More informationOutline. Bestfirst search
Outline Bestfirst search Greedy bestfirst search A* search Heuristics Local search algorithms Hillclimbing search Beam search Simulated annealing search Genetic algorithms Constraint Satisfaction Problems
More informationCOMPLETE AND SCALABLE MULTIROBOT PLANNING IN TUNNEL ENVIRONMENTS. Mike Peasgood John McPhee Christopher Clark
COMPLETE AND SCALABLE MULTIROBOT PLANNING IN TUNNEL ENVIRONMENTS Mike Peasgood John McPhee Christopher Clark Lab for Intelligent and Autonomous Robotics, Department of Mechanical Engineering, University
More informationLecture 4: Informed/Heuristic Search
Lecture 4: Informed/Heuristic Search Outline Limitations of uninformed search methods Informed (or heuristic) search uses problemspecific heuristics to improve efficiency Bestfirst A* RBFS SMA* Techniques
More informationKinematics of Wheeled Robots
CSE 390/MEAM 40 Kinematics of Wheeled Robots Professor Vijay Kumar Department of Mechanical Engineering and Applied Mechanics University of Pennsylvania September 16, 006 1 Introduction In this chapter,
More information9. Three Dimensional Object Representations
9. Three Dimensional Object Representations Methods: Polygon and Quadric surfaces: For simple Euclidean objects Spline surfaces and construction: For curved surfaces Procedural methods: Eg. Fractals, Particle
More informationSearchbased Planning with Motion Primitives. Maxim Likhachev Carnegie Mellon University
Searchbased 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 Searchbased Planning
More informationCHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL
WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support networkwide requirement.
More informationHeuris'c Search. Reading note: Chapter 4 covers heuristic search.
Heuris'c Search Reading note: Chapter 4 covers heuristic search. Credits: Slides in this deck are drawn from or inspired by a multitude of sources including: Shaul Markovitch Jurgen Strum Sheila McIlraith
More informationCS 380: ARTIFICIAL INTELLIGENCE PROBLEM SOLVING: INFORMED SEARCH, A* Santiago Ontañón
S 380: RTIFIIL INTELLIGENE PROLEM SOLVING: INFORMED SERH, * Santiago Ontañón so367@drexel.edu Note on Graph Search Repeatedstate checking: When the search state is a graph strategies like DFS can get
More informationCS4733 Class Notes. 1 2D Robot Motion Planning Algorithm Using Grown Obstacles
CS4733 Class Notes 1 2D Robot Motion Planning Algorithm Using Grown Obstacles Reference: An Algorithm for Planning Collision Free Paths Among Poyhedral Obstacles by T. LozanoPerez and M. Wesley. This
More informationTheta*: AnyAngle Path Planning on Grids
Theta*: nyngle Path Planning on Grids Kenny Daniel lex Nash Sven Koenig omputer Science Department University of Southern alifornia Los ngeles, alifornia 900890781, US riel Felner Department of Information
More informationECE 497 Introduction to Mobile Robotics Spring 0910
Final Project: Localization and Map Making Lectures: 81 and 82 Reading: Ch. 11, Introduction to AI Robotics (Demonstrations due in class on Monday and Tuesday of Week 10) (Competition in Kahn room on
More information3D Field D*: Improved Path Planning and Replanning in Three Dimensions
Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems October 915, 2006, Beijing, China 3D Field D*: Improved Path Planning and Replanning in Three Dimensions Joseph
More informationApplication of Hybrid A* to an Autonomous Mobile Robot for Path Planning in Unstructured Outdoor Environments
Application of Hybrid A* to an Autonomous Mobile Robot for Path Planning in Unstructured Outdoor Environments Janko Petereit, Thomas Emter, Christian W. Frey Fraunhofer Institute of Optronics, System Technologies
More informationSPATIAL GUIDANCE TO RRT PLANNER USING CELLDECOMPOSITION ALGORITHM
SPATIAL GUIDANCE TO RRT PLANNER USING CELLDECOMPOSITION ALGORITHM Ahmad Abbadi, Radomil Matousek, Pavel Osmera, Lukas Knispel Brno University of Technology Institute of Automation and Computer Science
More informationA.I.: Informed Search Algorithms. Chapter III: Part Deux
A.I.: Informed Search Algorithms Chapter III: Part Deux Bestfirst search Greedy bestfirst search A * search Heuristics Outline Overview Informed Search: uses problemspecific knowledge. General approach:
More information(1) Page #2 26 Even. (2) Page 596 #1 14. (3) Page #15 25 ; FF #26 and 28. (4) Page 603 #1 18. (5) Page #19 26
Geometry/Trigonometry Unit 10: Surface Area and Volume of Solids Notes Name: Date: Period: # (1) Page 590 591 #2 26 Even (2) Page 596 #1 14 (3) Page 596 597 #15 25 ; FF #26 and 28 (4) Page 603 #1 18 (5)
More informationTutorial 9  Fast Marching Methods
236861 Numerical Geometry of Images Tutorial 9 Fast Marching Methods c 2012 Why measure distances? Shape analysis Image analysis Registration Morphology Navigation And many other uses.. There are many
More informationVisible Surface Determination: Intro
Visible Surface Determination: Intro VSD deals with determining what is visible in a scene 2 general approaches are used: 1. Object precision Older approach Designed for vector displays Determines visibility
More informationNonholonomic motion planning for carlike robots
Nonholonomic motion planning for carlike 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 informationHumanOriented Robotics. Robot Motion Planning. Kai Arras Social Robotics Lab, University of Freiburg
Robot Motion Planning Kai Arras, University of Freiburg 1 Contents Introduction Configuration space Combinatorial planning Samplingbased planning Potential fields methods A, AnyAngle A, D/D Lite Dynamic
More information9. VisibleSurface Detection Methods
9. VisibleSurface Detection Methods More information about Modelling and Perspective Viewing: Before going to visible surface detection, we first review and discuss the followings: 1. Modelling Transformation:
More informationVectorization Using Stochastic Local Search
Vectorization Using Stochastic Local Search Byron Knoll CPSC303, University of British Columbia March 29, 2009 Abstract: Stochastic local search can be used for the process of vectorization. In this project,
More informationDiFi: Distance Fields  Fast Computation Using Graphics Hardware
DiFi: Distance Fields  Fast Computation Using Graphics Hardware Avneesh Sud Dinesh Manocha UNCChapel Hill http://gamma.cs.unc.edu/difi Distance Fields Distance Function For a site a scalar function f:r
More informationQuadtrees and Meshing
Computational Geometry Lecture INSTITUT FÜR THEORETISCHE INFORMATIK FAKULTÄT FÜR INFORMATIK Tamara Mchedlidze Darren Strash 14.12.2015 Motivation: Meshing PC Board Layouts To simulate the heat produced
More informationHeuristic Search: A* CPSC 322 Search 4 January 19, Textbook 3.6 Taught by: Vasanth
Heuristic Search: A* CPSC 322 Search 4 January 19, 2011 Textbook 3.6 Taught by: Vasanth 1 Lecture Overview Recap Search heuristics: admissibility and examples Recap of BestFS Heuristic search: A* 2 Example
More informationAutomated Route Finding on Digital Terrains
Automated Route Finding on Digital Terrains D. R. Wichmann and B. C. Wünsche Graphics Group, Dept. of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand. daniel.wichmann@gmail.com,
More informationPolygonization of Implicit Surfaces
Polygonization of Implicit Surfaces Hongxin Zhang and Jieqing Feng 20070111 State Key Lab of CAD&CG Zhejiang University Contents Polygonization of Implicit Surfaces Other Methods for Displaying Implicit
More informationScene Management. Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development
Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development Chap. 5 Scene Management Overview Scene Management vs Rendering This chapter is about rendering
More informationRoadmapBased Path Planning
RoadmapBased d Path Planning Chapter 7 Objectives Understand the definition of a Road Map Investigate techniques for roadmapbased goal directed path planning in 2D environments geometrybased algorithms
More informationx ~ Hemispheric Lighting
Irradiance and Incoming Radiance Imagine a sensor which is a small, flat plane centered at a point ~ x in space and oriented so that its normal points in the direction n. This sensor can compute the total
More informationInformed search algorithms
Artificial Intelligence Topic 4 Informed search algorithms Bestfirst search Greedy search A search Admissible heuristics Memorybounded search IDA SMA Reading: Russell and Norvig, Chapter 4, Sections
More informationIntersection Acceleration
Advanced Computer Graphics Intersection Acceleration Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volume hierarchies uniform grids kdtrees octrees
More information6.141: Robotics systems and science Lecture 9: Configuration Space and Motion Planning
6.141: Robotics systems and science Lecture 9: Configuration Space and Motion Planning Lecture Notes Prepared by Daniela Rus EECS/MIT Spring 2011 Figures by Nancy Amato, Rodney Brooks, Vijay Kumar Reading:
More informationComputer Graphics. BingYu Chen National Taiwan University
Computer Graphics BingYu Chen National Taiwan University VisibleSurface Determination BackFace Culling The DepthSort Algorithm Binary SpacePartitioning Trees The zbuffer Algorithm ScanLine Algorithm
More informationComplex behavior emergent from simpler ones
Reactive Paradigm: Basics Based on ethology Vertical decomposition, as opposed to horizontal decomposition of hierarchical model Primitive behaviors at bottom Higher behaviors at top Each layer has independent
More informationSpatial Data Structures
15462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) April 1, 2003 [Angel 9.10] Frank Pfenning Carnegie
More informationFluent User Services Center
Solver Settings 51 Using the Solver Setting Solver Parameters Convergence Definition Monitoring Stability Accelerating Convergence Accuracy Grid Independence Adaption Appendix: Background Finite Volume
More informationHomework 4: (GRADUATE VERSION)
Homework 4: Wavefront Path Planning and Path Smoothing (GRADUATE VERSION) Assigned: Thursday, October 16, 2008 Due: Friday, October 31, 2008 at 23:59:59 In this assignment, you will write a path planner
More informationCSC Computer Graphics
// CSC. Computer Graphics Lecture Kasun@dscs.sjp.ac.lk Department of Computer Science University of Sri Jayewardanepura Polygon Filling ScanLine Polygon Fill Algorithm Span FloodFill Algorithm Insideoutside
More information! Linear programming"! Duality "! Smallest enclosing disk"
! Linear programming"! Duality "! Smallest enclosing disk" 14. 24.! Define:" " i types of foods (1!i!d).! " j types of vitamins (1!j!n)." " x i the amount of food of type i." " a ji the amount of vitamin
More informationHuman Augmentation in Teleoperation of Arm Manipulators in an Environment with Obstacles
Human Augmentation in Teleoperation of Arm Manipulators in an Environment with Obstacles I. Ivanisevic and V. Lumelsky Robotics Lab, University of WisconsinMadison Madison, Wisconsin 53706, USA iigor@cs.wisc.edu
More informationWho has worked on a voxel engine before? Who wants to? My goal is to give the talk I wish I would have had before I started on our procedural engine.
1 Who has worked on a voxel engine before? Who wants to? My goal is to give the talk I wish I would have had before I started on our procedural engine. Three parts to this talk. A lot of content, so I
More informationVIII. Visibility algorithms (II)
VIII. Visibility algorithms (II) Hybrid algorithsms: priority list algorithms Find the object visibility Combine the operations in object space (examples: comparisons and object partitioning) with operations
More informationFinding a Path. Advanced Pathfinding. Finding a Path. A* Pathfinding Search. Practical Path Planning 3/21/2016. TileBased Navigation Graphs IMGD 4000
3/21/2016 Finding a Path Often seems obvious and natural in real life e.g., Get from point A to B go around lake Advanced Pathfinding http://www.rocket5studios.com/tutorials/makea2dgamewithunity3dusingonlyfreetoolsbeginningenemyaiwithapathfinding/
More informationTwo possible points. Start. Destination. Obstacle
A TwoDimensional Path Planning Algorithm Richard Fox, Antonio Garcia Jr. and Michael Nelson Department of Computer Science The University of Texas Pan American Edinburg, TX 78539, USA Phone: (956) 3813635
More informationCARTR990 CSTR4526 UMIACS September 2003
CARTR990 CSTR4526 UMIACS 200394 September 2003 Objectbased and Imagebased Object Representations Hanan Samet Computer Science Department Center for Automation Research Institute for Advanced Computer
More informationMobile Robot Path Planning in Static Environment
Mobile Robot Path Planning in Static Environment A Thesis Submitted in Partial Fulfilment of the Requirements for the Degree of Bachelor of Technology in Computer Science & Engineering Submitted by: Raman
More informationmywbut.com Informed Search StrategiesI
Informed Search StrategiesI 1 3.1 Introduction We have outlined the different types of search strategies. In the earlier chapter we have looked at different blind search strategies. Uninformed search
More informationChapter 3: Search. c D. Poole, A. Mackworth 2010, W. Menzel 2015 Artificial Intelligence, Chapter 3, Page 1
Chapter 3: Search c D. Poole, A. Mackworth 2010, W. Menzel 2015 Artificial Intelligence, Chapter 3, Page 1 Searching Often we are not given an algorithm to solve a problem, but only a specification of
More informationCS 380: Artificial Intelligence Lecture #4
CS 380: Artificial Intelligence Lecture #4 William Regli Material Chapter 4 Section 13 1 Outline Bestfirst search Greedy bestfirst search A * search Heuristics Local search algorithms Hillclimbing
More informationStatistical Techniques in Robotics (16831, F10) Lecture#06(Thursday September 11) Occupancy Maps
Statistical Techniques in Robotics (16831, F10) Lecture#06(Thursday September 11) Occupancy Maps Lecturer: Drew Bagnell Scribes: {agiri, dmcconac, kumarsha, nbhakta} 1 1 Occupancy Mapping: An Introduction
More information9/17/2015 7:56 AM. CSCE 625 Programing Assignment #1 due: Tues, Sep 22 (by start of class) Objective
CSCE 625 Programing Assignment #1 due: Tues, Sep 22 (by start of class) Objective The goal of this assignment is to implement and compare the performance of Breadthfirst search (BFS), DepthFirst Search
More informationAdvanced Vision Guided Robotics. David Bruce Engineering Manager FANUC America Corporation
Advanced Vision Guided Robotics David Bruce Engineering Manager FANUC America Corporation Traditional Vision vs. Vision based Robot Guidance Traditional Machine Vision Determine if a product passes or
More informationProject 2. Electrical & Computer Engineering Introduction to Mechatronics and Robotic Vision Fall/2010
Electrical & Computer Engineering 43307330 Introduction to Mechatronics and Robotic Vision Fall/2010 Class by DeSouza, Guilherme N. [DeSouzaG[at]missouri.edu] Project 2 Date 12/19/2010 Prashant Revankar[prkv5[at]mail.missouri.edu]
More informationProblem Solving and Search
Artificial Intelligence Problem Solving and Search DaeWon Kim School of Computer Science & Engineering ChungAng University Outline Problemsolving agents Problem types Problem formulation Example problems
More informationSubOptimal Heuristic Search ARA* and Experience Graphs
Robot Autonomy (16662, S13) Lecture#09 (Wednesday Feb 13, 2013) Lecture by: Micheal Phillips SubOptimal Heuristic Search ARA* and Experience Graphs Scribes: S.Selvam Raju and Adam Lebovitz Contents 1
More informationSpatial Data Structures
Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) [Angel 9.10] Outline Ray tracing review what rays matter? Ray tracing speedup faster
More informationInformed Search and Exploration
Informed Search and Exploration Chapter 4 (4.14.3) CS 2710 1 Introduction Ch.3 searches good building blocks for learning about search But vastly inefficient eg: Can we do better? Breadth Depth Uniform
More informationChapter4. Tree Search (Reviewed, Fig. 3.9) BestFirst Search. Search Strategies. BestFirst Search (cont.2) BestFirst Search (cont.
Tree Search (Reviewed, Fig. 3.9) Chapter4 Informed Search and Exploration 20070322 chap4 1 20070322 chap4 2 Search Strategies A search strategy is defined by picking the order of node expansion Uninformed
More informationInformed Search and Exploration
Ch. 03b p.1/51 Informed Search and Exploration Sections 3.5 and 3.6 Nilufer Onder Department of Computer Science Michigan Technological University Ch. 03b p.2/51 Outline Bestfirst search A search Heuristics,
More informationINTEGRATING LOCAL AND GLOBAL NAVIGATION IN UNMANNED GROUND VEHICLES
INTEGRATING LOCAL AND GLOBAL NAVIGATION IN UNMANNED GROUND VEHICLES Juan Pablo Gonzalez*, William Dodson, Robert Dean General Dynamics Robotic Systems Westminster, MD Alberto Lacaze, Leonid Sapronov Robotics
More informationLecture 2 Unstructured Mesh Generation
Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations PerOlof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a
More informationLecture 6: GIS Spatial Analysis. GE 118: INTRODUCTION TO GIS Engr. Meriam M. Santillan Caraga State University
Lecture 6: GIS Spatial Analysis GE 118: INTRODUCTION TO GIS Engr. Meriam M. Santillan Caraga State University 1 Spatial Data It can be most simply defined as information that describes the distribution
More informationLecture 3 of 42. Lecture 3 of 42
Search Problems Discussion: Term Projects 3 of 5 William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: http://snipurl.com/v9v3 Course web site: http://www.kddresearch.org/courses/cis730
More informationPrime Time (Factors and Multiples)
CONFIDENCE LEVEL: Prime Time Knowledge Map for 6 th Grade Math Prime Time (Factors and Multiples). A factor is a whole numbers that is multiplied by another whole number to get a product. (Ex: x 5 = ;
More information1. Meshes. D7013E Lecture 14
D7013E Lecture 14 Quadtrees Mesh Generation 1. Meshes Input: Components in the form of disjoint polygonal objects Integer coordinates, 0, 45, 90, or 135 angles Output: A triangular mesh Conforming: A triangle
More information