Class material vs. Lab material – Lab 2, 3 vs. 4,5, 6 BeagleBoard / TI / Digilent GoPro.

Slides:



Advertisements
Similar presentations
COMP Robotics: An Introduction
Advertisements

Visual Servo Control Tutorial Part 1: Basic Approaches Chayatat Ratanasawanya December 2, 2009 Ref: Article by Francois Chaumette & Seth Hutchinson.
Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.
Motion Planning for Point Robots CS 659 Kris Hauser.
1 C02,C03 – ,27,29 Advanced Robotics for Autonomous Manipulation Department of Mechanical EngineeringME 696 – Advanced Topics in Mechanical Engineering.
Introduction University of Bridgeport 1 Introduction to ROBOTICS.
1 Singularity Handling on PUMA in Operational Space Formulation Author: Denny Oetomo*, Marcelo Ang Jr*, Lim Ser Yong** * National University of Singapore,
University of Amsterdam Search, Navigate, and Actuate - Quantitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Quantative Navigation.
Trajectory Generation
Neural Network Grasping Controller for Continuum Robots David Braganza, Darren M. Dawson, Ian D. Walker, and Nitendra Nath David Braganza, Darren M. Dawson,
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
CS 326 A: Motion Planning Coordination of Multiple Robots.
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
Paper by Kevin M.Lynch, Naoji Shiroma, Hirohiko Arai, and Kazuo Tanie
Introduction to Robotics
Trajectory Week 8. Learning Outcomes By the end of week 8 session, students will trajectory of industrial robots.
Robotics R&N: ch 25 based on material from Jean- Claude Latombe, Daphne Koller, Stuart Russell.
Forward Kinematics.
Chapter 25: Robotics April 27, The Week Ahead … Wednesday: Dmitrii Zagorodnov Thursday: Jeff Elser’s presentation, general discussion Friday: Rafal.
BINARY MORPHOLOGY and APPLICATIONS IN ROBOTICS. Applications of Minkowski Sum 1.Minkowski addition plays a central role in mathematical morphology 2.It.
Mobile Robotics: 11. Kinematics 2
CS 326 A: Motion Planning Coordination of Multiple Robots.
Mechatronics 1 Week 11. Learning Outcomes By the end of week 11 session, students will understand some sorts of mobile robot and locomotion of wheeled.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
Definition of an Industrial Robot
Motion Control (wheeled robots)
1 CMPUT 412 Motion Control – Wheeled robots Csaba Szepesvári University of Alberta TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
Bearing and Degrees Of Freedom (DOF). If a farmer goes to milk her cows in the morning carrying a stool under one hand and a pail under another the other.
9/14/2015CS225B Kurt Konolige Locomotion of Wheeled Robots 3 wheels are sufficient and guarantee stability Differential drive (TurtleBot) Car drive (Ackerman.
© Manfred Huber Autonomous Robots Robot Path Planning.
Inverse Kinematics Find the required joint angles to place the robot at a given location Places the frame {T} at a point relative to the frame {S} Often.
Robotics Chapter 5 – Path and Trajectory Planning
MAE505: Robotics Final Project – Papers Review. Presented By: Tao Gan Advisor: Dr. Venkat Krovi. Main Topic: Nonholonomic-Wheel Mobile Robot (WMR). Sub-Topics:
Beyond trial and error…. Establish mathematically how robot should move Kinematics: how robot will move given motor inputs Inverse-kinematics: how to.
TGI Friday’s Mistletoe Drone /12/10/mistletoe- quadcopter-draws- blood/
T. Bajd, M. Mihelj, J. Lenarčič, A. Stanovnik, M. Munih, Robotics, Springer, 2010 ROBOT CONTROL T. Bajd and M. Mihelj.
How are things going? Core AI Problem Mobile robot path planning: identifying a trajectory that, when executed, will enable the robot to reach the goal.
Lecture 22 Dimitar Stefanov.
Robotics Sharif In the name of Allah. Robotics Sharif Introduction to Robotics o Leila Sharif o o Lecture #2: The.
ME451 Kinematics and Dynamics of Machine Systems Vel. And Acc. of a Fixed Point in Moving Frame Basic Concepts in Planar Kinematics February.
Review: Differential Kinematics
Chapter 7: Trajectory Generation Faculty of Engineering - Mechanical Engineering Department ROBOTICS Outline: 1.
yG7s#t=15 yG7s#t=15.
COMP322/S2000/L281 Task Planning Three types of planning: l Gross Motion Planning concerns objects being moved from point A to point B without problems,
MA4248 Weeks 6-7. Topics Work and Energy, Single Particle Constraints, Multiple Particle Constraints, The Principle of Virtual Work and d’Alembert’s Principle.
Outline: Introduction Solvability Manipulator subspace when n<6
Robotics Chapter 5 – Path and Trajectory Planning
City College of New York 1 John (Jizhong) Xiao Department of Electrical Engineering City College of New York Mobile Robot Control G3300:
Robotics Sharif In the name of Allah Robotics Sharif Introduction to Robotics o Leila Sharif o o Lecture #4: The.
Basilio Bona DAUIN – Politecnico di Torino
James Irwin Amirkhosro Vosughi Mon 1-5pm
KAASHIV INFOTECH – A SOFTWARE CUM RESEARCH COMPANY IN ELECTRONICS, ELECTRICAL, CIVIL AND MECHANICAL AREAS
NUS CS 5247 David Hsu Configuration Space. 2 What is a path?
Gaits Cost of Transportation Wheeled Mobile Robots Most popular locomotion mechanism Highly efficient Simple mechanical implementation Balancing is.
Singularity-Robust Task Priority Redundancy Resolution for Real-time Kinematic Control of Robot Manipulators Stefano Chiaverini.
Yueshi Shen Dept. of Information Engineering
MAE505: Robotics Final Project – Papers Review.
Special English for Industrial Robot
Mobile Robot Kinematics
Day 29 Bug Algorithms 12/7/2018.
Day 29 Bug Algorithms 12/8/2018.
Chap 11 – Case Studies.
Inverse Kinematics 12/30/2018.
© Sharif University of Technology - CEDRA By: Professor Ali Meghdari
Outline: Introduction Solvability Manipulator subspace when n<6
Special English for Industrial Robot
Chapter 4 . Trajectory planning and Inverse kinematics
Presentation transcript:

Class material vs. Lab material – Lab 2, 3 vs. 4,5, 6 BeagleBoard / TI / Digilent GoPro

Class material vs. Lab material – Lab 2, 3 vs. 4,5, 6 BeagleBoard / TI / Digilent GoPro

There is no ideal drive configuration that simultaneously maximizes stability, maneuverability, and controllability. For example, typically inverse correlation between controllability and maneuverability.

Holonomicity If the controllable degrees of freedom is equal to the total degrees of freedom then the robot is said to be holonomic. – Holonomic constraints reduce the number of degrees of freedom of the system If the controllable degrees of freedom are less than the total degrees of freedom it is non-holonomic. A robot is considered to be redundant if it has more controllable degrees of freedom than degrees of freedom in its task space.

Why study holonomic constraints? How many independent motions can our turtlebot robot produce? – 2 at the most How many DOF in the task space does the robot need to control? – 3 DOF The difference implies that our system has holonomic constraints

Open loop control vs. Closed loop control

Recap – Control Architectures – Sensors & Vision – Control & Kinematics

Core AI Problem Mobile robot path planning: identifying a trajectory that, when executed, will enable the robot to reach the goal location Representation – State (state space) – Actions (operators) – Initial and goal states Plan: – Sequence of actions/states that achieve desired goal state.

11 Model of the world Compute Path Smooth it and satisfy differential constraints Design a trajectory (velocity function) along the path Design a feedback control law that tracks the trajectory Execute

Fundamental Questions How is a plan represented? How is a plan computed? What does the plan achieve? How do we evaluate a plan’s quality?

1) World is known, goal is not

2) Goal is known, world is not

3) World is known, goal is known

4) Finding shortest path?

5) Finding shortest path with costs

The World consists of... Obstacles – Places where the robot can’t (shouldn’t) go Free Space – Unoccupied space within the world – Robots “might” be able to go here There may be unknown obstacles The state may be unreachable

Configuration Space (C-Space) Configuration Space: the space of all possible robot configurations. – Data structure that allows us to represent occupied and free space in the environment

Configuration Space For a point robot moving in 2-D plane, C-space is q goal q init C C free C obs Point robot (no constraints)

What if the robot is not a point?

22 Expand obstacle(s) Reduce robot What if the robot is not a point?

Example Workspace

If we want to preserve the angular component…

Rigid Body Planning

Transfer in Reinforcement Learning via Shared Features: Konidaris, Scheidwasser, and Barto, 2002

Back to Path Planning… Typical simplifying assumptions for indoor mobile robots: – 2 DOF for representation – robot is round, so that orientation doesn’t matter – robot is holonomic, can move in any direction

Back to Path Planning…  How is a plan represented?  How is a plan computed?  What does the plan achieve?  How do we evaluate a plan’s quality? Fundamental Questions start goal

start goal

Occupancy Grid start goal

Occupancy Grid, accounting for C-Space start goal

Occupancy Grid, accounting for C-Space start goal Slightly larger grid size can make the goal unreachable. Problem if grid is “too small”?