EXERCISES – PATH PLANNING & ROS ISSUES By Vuk Vujovic.

Slides:

Advertisements

Similar presentations

Heuristic Searches. Feedback: Tutorial 1 Describing a state. Entire state space vs. incremental development. Elimination of children. Closed and the solution.

Advertisements

A Moving Strategy for Mobile Sink in Secure Data Collection Zhou Sha.

Problem solving with graph search

Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

D* Lite an incremental version of A* for navigating in unknown terrain Focussed Dynamic A* It implements the same behavior as Stentz’

an incremental version of A*

Motion Planning for Point Robots CS 659 Kris Hauser.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”

CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.

ISEN 601 Location Logistics Dr. Gary M. Gaukler Fall 2011.

Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.

- 1 - Intentional Mobility in Wireless Sensor Networks Deployment, Dispatch, and Applications Dr. You-Chiun Wang ( 王友群 ) Department of Computer Science,

Networked Slepian–Wolf: Theory, Algorithms, and Scaling Laws R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano, Member, IEEE, Martin Vetterli,

RRT-Connect path solving J.J. Kuffner and S.M. LaValle.

CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.

1/53 Key Problems Localization –“where am I ?” Fault Detection –“what’s wrong ?” Mapping –“what is my environment like ?”

Introduction to Robot Motion Planning. Example A robot arm is to build an assembly from a set of parts. Tasks for the robot: Grasping: position gripper.

Dijkstra’s Algorithm and Heuristic Graph Search David Johnson.

Lab 3 How’d it go?.

-Electric Potential Energy and Electric Potential due to Point Charges AP Physics C Mrs. Coyle.

© Manfred Huber Autonomous Robots Robot Path Planning.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

1 Solving problems by searching This Lecture Chapters 3.1 to 3.4 Next Lecture Chapter 3.5 to 3.7 (Please read lecture topic material before and after each.

Introduction to Robot Motion Planning Robotics meet Computer Science.

Pseudocode AStar. Heuristics - how to determine what's a good next step? As mentioned already, the A* algorithm depends on evaluating the best next step.

Informed search strategies Idea: give the algorithm “hints” about the desirability of different states – Use an evaluation function to rank nodes and select.

Administration Feedback on assignment Late Policy

Neural Heuristics For Problem Solving: Using ANNs to Develop Heuristics for the 8-Puzzle by Bambridge E. Peterson.

A* optimality proof, cycle checking CPSC 322 – Search 5 Textbook § 3.6 and January 21, 2011 Taught by Mike Chiang.

Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :

3.5 Informed (Heuristic) Searches This section show how an informed search strategy can find solution more efficiently than uninformed strategy. Best-first.

Ch. 4 – Informed Search Supplemental slides for CSE 327 Prof. Jeff Heflin.

1. For minimum vertex cover problem in the following graph give

1 8puzzle. 2 A* search algorithm A* is a best-first, graph search algorithm that finds the least-cost path from a given initial node to one goal node.

CPSC 322, Lecture 7Slide 1 Heuristic Search Computer Science cpsc322, Lecture 7 (Textbook Chpt 3.6) Sept, 20, 2013.

CSE 326: Data Structures Lecture #17 Heuristic Graph Search Henry Kautz Winter Quarter 2002.

Computer Science cpsc322, Lecture 7

Review: Tree search Initialize the frontier using the starting state

Informed Search and Exploration

Heuristic Search Henry Kautz.

Motion Planning for a Point Robot (2/2)

Crowd Simulation (INFOMCRWS) - A* Search

Designing Algorithms for Multiplication of Fractions

CSE 4705 Artificial Intelligence

Lecture 19-Problem Solving 4 Incremental Method

Multi-Rep Multi-Heuristic A*

5 × 7 = × 7 = 70 9 × 7 = CONNECTIONS IN 7 × TABLE

5 × 8 = 40 4 × 8 = 32 9 × 8 = CONNECTIONS IN 8 × TABLE

Designing Algorithms for Multiplication of Fractions

4 × 6 = 24 8 × 6 = 48 7 × 6 = CONNECTIONS IN 6 × TABLE

5 × 6 = 30 2 × 6 = 12 7 × 6 = CONNECTIONS IN 6 × TABLE

Algorithms Lecture # 29 Dr. Sohail Aslam.

Successive Shortest Path Algorithm

Mobile-Assisted Localization in Sensor Network

Path Planning in Discrete Sampled Space

Announcements This Friday Project 1 due Talk by Jeniya Tabassum

Lecture 12 CSE 331 Sep 22, 2014.

10 × 8 = 80 5 × 8 = 40 6 × 8 = CONNECTIONS IN 8 × TABLE MULTIPLICATION.

3 × 12 = 36 6 × 12 = 72 7 × 12 = CONNECTIONS IN 12 × TABLE

Distance and Displacement

5 × 12 = × 12 = × 12 = CONNECTIONS IN 12 × TABLE MULTIPLICATION.

Lecture 28 Approximation of Set Cover

5 × 9 = 45 6 × 9 = 54 7 × 9 = CONNECTIONS IN 9 × TABLE

Multi-Rep Multi-Heuristic A*

3 × 7 = 21 6 × 7 = 42 7 × 7 = CONNECTIONS IN 7 × TABLE

Optimised Search Techniques

Presentation transcript:

EXERCISES – PATH PLANNING & ROS ISSUES By Vuk Vujovic

APPLICATIONS OF PATH PLANNING

POTENTIAL FIELD APPROACH VS. GRAPH APPROACH

A* ALGORITHM - RECAP

A* APPROACH – DISCUSSION Manhattan distance Manhattan distance Euclidean distance Euclidean distance Which one works better for you and why? Which one works better for you and why? 4-connected or 8-connected? Which one is better for our case? THINK ABOUT HOW IS YOUR ROBOT MOVING! HEURISTIC SHOULD APPROXIMATE THE OPTIMAL DISTANCE FROM CURRENT NODE TO GOAL

ROS TF WHY AND HOW? System for describing relations among different coordinate frames System for describing relations among different coordinate frames Keeps track of relations for you Keeps track of relations for you Perfect for models with multiple bodies like robotic arms and humanoid robots Perfect for models with multiple bodies like robotic arms and humanoid robots

QUESTIONS?