Topic 9 Potential fields: Follow your potential

Similar documents
Algorithms for Sensor-Based Robotics: Potential Functions

MEM380 Applied Autonomous Robots I Fall BUG Algorithms Potential Fields

Neural networks III: The delta learning rule with semilinear activation function

Lecture 8: Kinematics: Path and Trajectory Planning

Graph Search Howie Choset

A population of fish is modeled by the logistic equation modified to account for harvesting: 4

Markov Chains and MCMC

Programming Robots in ROS Slides adapted from CMU, Harvard and TU Stuttgart

Analysis of the Lennard-Jones-38 stochastic network

Introduction to Mobile Robotics Probabilistic Sensor Models

Linear Dynamical Systems

A. The Hopfield Network. III. Recurrent Neural Networks. Typical Artificial Neuron. Typical Artificial Neuron. Hopfield Network.

Manipulators. Robotics. Outline. Non-holonomic robots. Sensors. Mobile Robots

The Big Picture. Discuss Examples of unpredictability. Odds, Stanisław Lem, The New Yorker (1974) Chaos, Scientific American (1986)

Machine Learning. Lecture 04: Logistic and Softmax Regression. Nevin L. Zhang

Need for Deep Networks Perceptron. Can only model linear functions. Kernel Machines. Non-linearity provided by kernels

Gross Motion Planning

MAE 598: Multi-Robot Systems Fall 2016

Neural Network Training

Chapter 10 Associative Memory Networks We are in for a surprise though!

Fundamentals of Metaheuristics

CIS 390 Fall 2016 Robotics: Planning and Perception Final Review Questions

Neural Networks Learning the network: Backprop , Fall 2018 Lecture 4

A. The Hopfield Network. III. Recurrent Neural Networks. Typical Artificial Neuron. Typical Artificial Neuron. Hopfield Network.

EARTH S ENERGY SOURCES

Derivative and Integral: Some Concepts for Geodesy

Behavioral Data Mining. Lecture 7 Linear and Logistic Regression

Ngày 20 tháng 7 năm Discrete Optimization Graphs

Linear Regression. CSL603 - Fall 2017 Narayanan C Krishnan

Linear Regression. CSL465/603 - Fall 2016 Narayanan C Krishnan

( ) T. Reading. Lecture 22. Definition of Covariance. Imprinting Multiple Patterns. Characteristics of Hopfield Memory

Guest Lecture: Steering in Games. the. gamedesigninitiative at cornell university

The Belief Roadmap: Efficient Planning in Belief Space by Factoring the Covariance. Samuel Prentice and Nicholas Roy Presentation by Elaine Short

Mathematical optimization

The Relation between the Integral and the Derivative Graphs. Unit #10 : Graphs of Antiderivatives, Substitution Integrals

Gravitational potential. Is this the same as gravitational potential energy?

Neural Networks. Bishop PRML Ch. 5. Alireza Ghane. Feed-forward Networks Network Training Error Backpropagation Applications

Motion Planning in Partially Known Dynamic Environments

Robotics. Path Planning. Marc Toussaint U Stuttgart

A Tutorial On Backward Propagation Through Time (BPTT) In The Gated Recurrent Unit (GRU) RNN

General Theoretical Concepts Related to Multibody Dynamics

Graphs of Antiderivatives, Substitution Integrals

Kinetic Theory. 84 minutes. 62 marks. theonlinephysicstutor.com. facebook.com/theonlinephysicstutor. Name: Class: Date: Time: Marks: Comments:

A harmonic function on a domain Ω R n is a function which satisfies Laplace s equation:

13 : Variational Inference: Loopy Belief Propagation

Capacity Estimation. Based on Joe Mitchell s slides

Unit #10 : Graphs of Antiderivatives, Substitution Integrals

Robot Mapping. Least Squares. Cyrill Stachniss

AQA Physics Checklist

Logistic Regression. Stochastic Gradient Descent

Variational Bayesian Logistic Regression

Robotics. Path Planning. University of Stuttgart Winter 2018/19

Multidisciplinary System Design Optimization (MSDO)

The Whys of Weather Rain

Fire and Ice. The Fate of the Universe. Jon Thaler

CSC321 Lecture 7: Optimization

Linear Regression 1 / 25. Karl Stratos. June 18, 2018

Clustering non-stationary data streams and its applications

1 Introduction to Governing Equations 2 1a Methodology... 2

Discrete Wiskunde II. Lecture 5: Shortest Paths & Spanning Trees

CHAPTER 18 ELECTRIC POTENTIAL

v n+1 = v T + (v 0 - v T )exp(-[n +1]/ N )

ESS15 Lecture 10. Winds and weather The Coriolis force Global circulations of atmosphere & ocean Weather vs. Climate

Multi-robot Coverage and Exploration on Riemannian Manifolds with Boundary

Multiclass Logistic Regression

CSC321 Lecture 8: Optimization

Exploring the energy landscape

IYGB Mathematical Methods 1

5 th Grade Force and Motion Study Guide

Searching in non-deterministic, partially observable and unknown environments

STUDY GUIDE - 6TH GRADE WEEK 12 CCA

Query Processing in Spatial Network Databases

g(2, 1) = cos(2π) + 1 = = 9

Learning in State-Space Reinforcement Learning CIS 32

Sensors Fusion for Mobile Robotics localization. M. De Cecco - Robotics Perception and Action

Bayesian Learning in Undirected Graphical Models

Period Three, Chaos and Fractals

Unit #10 : Graphs of Antiderivatives; Substitution Integrals

Curriculum Area: Mathematics A Level - 2 year course (AQA) Year: 12. Aspire Learn Achieve

Lecture 22: Graph-SLAM (2)

Toward Online Probabilistic Path Replanning

Mock Exam Künstliche Intelligenz-1. Different problems test different skills and knowledge, so do not get stuck on one problem.

Activation Energy. Notes #22

Falling Objects and Projectile Motion

Hopfield Networks and Boltzmann Machines. Christian Borgelt Artificial Neural Networks and Deep Learning 296

Protein Folding by Robotics

Machine Learning Basics III

Inference as Optimization

BACKPROPAGATION. Neural network training optimization problem. Deriving backpropagation

Maximum Flow. Jie Wang. University of Massachusetts Lowell Department of Computer Science. J. Wang (UMass Lowell) Maximum Flow 1 / 27

Ocean Township High School Mathematics Department

Neural Nets and Symbolic Reasoning Hopfield Networks

ACTIVITY 3 Introducing Energy Diagrams for Atoms

Chapter 4. The Laws of Motion

A* Search. 1 Dijkstra Shortest Path

Translational Mechanical Systems

Analysis of Algorithms. Outline. Single Source Shortest Path. Andres Mendez-Vazquez. November 9, Notes. Notes

= 1 2 kx2 dw =! F! d! r = Fdr cosθ. T.E. initial. = T.E. Final. = P.E. final. + K.E. initial. + P.E. initial. K.E. initial =

ENERGY IN CHEMISTRY. R. Ashby Duplication by permission only.

Name: Unit 4 Benchmark Review

Transcription:

Topic 9 Potential fields: Follow your potential

Path Planning B: Goal Find intermediate poses forming a path to the goal ) How can we find such paths? 2) Define pose and controls? Path on a graph: vertices - robot poses A: Start edges - traversable connection between poses (note edges are directed)

Approaches to path planning Search (fixed graph) DFS, BFS, Dijkstra, A* Search (build graph): Probabilistic Road Maps Rapidly-exploring Random Trees Optimization (local search): Potential fields, gradient descent

Potential field volcanic on fire Energy potential converges at goal heating up How do we define this potential? colder a little warmer cold

Potential Energy Energy stored in a physical system For objects acting only w.r.t. gravity PE = mass*height*gravity

Convergent Potentials let s call these attractor landscapes Start Start Goal Goal basin of attraction

2D potential navigation z: height indicates potential at location x = Start x d = Goal basin of attraction x-y plane: robot position

Cone Attractor x d = Goal Attractor Start w: weight (x d -x): direction x d -x : distance u = w(x d -x)/ x d -x x = Start Goal top view side view

Cone Attractor x d = Goal Attractor x d -x Start w: weight (x d -x): direction x d -x : distance (x d -x) u = w(x d -x)/ x d -x x = Start Goal top view side view

Cone Attractor x d = Goal Attractor x d -x Start w: weight (x d -x): direction x d -x : distance (x d -x) unit vector (x d -x)/ x d -x u = w(x d -x)/ x d -x x = Start Goal top view side view

Cone Attractor x d = Goal Attractor x d -x Start w: weight (x d -x): direction x d -x : distance (x d -x) unit vector (x d -x)/ x d -x u = w(x d -x)/ x d -x w x = Start Goal top view side view

Bowl Attractor x d = Goal Start u = exp(- x d -x /w) (x d -x) Goal x = Start top view side view

exp(-d/w) exp(-d/0) exp(-d/w) : influence of potential exp(-d/) exp(-d/0.5) exp(-d/.0) d = distance exp(-d/2)

Multiple potentials Output of potential field is a vector potential 2 (x) potential (x) How to combine or select between multiple potentials?

Multiple potentials i potential i (x) Output of potential field is a vector potential 2 (x) potential (x) Combine multiple potentials through vector summation u = i potential i (x) or u = potential (x)+ potential (x)

describe performance for this case Goal Current

describe performance for this case Goal Obstacles Repellors Current

describe performance for this case how do we deal with repellors? Goal Obstacles Repellors Current

Cone Repellor potential problems Obstacle Repellor Goal reverse direction u = w(x-x d )/ x d -x x = Start Start top view side view

Bowl Repellor Obstacle Repellor Goal u = exp(- x-x d /w) (x d -x) Start x = Start top view side view

describe performance for this case Goal Current

describe performance for this case Goal Current

describe performance for this case Goal Current

matlab example /course/cs48/pub/pfield.m How to address local minima?

[Prin. of Robot Motion] Wavefront planning Combine search with potential field Start: mark with 0 0 Goal: mark with 2

[Prin. of Robot Motion] Wavefront planning Obstacles: mark with 0

[Prin. of Robot Motion] Wavefront planning 0 BFS away from goal, mark depth unless

[Prin. of Robot Motion] Wavefront planning 0

[Prin. of Robot Motion] Wavefront planning 0

[Prin. of Robot Motion] Wavefront planning 0

[Prin. of Robot Motion] Wavefront planning 0

[Prin. of Robot Motion] Wavefront planning

[Prin. of Robot Motion] Wavefront planning Once start reached, follow potential to goal