1 GRASP Nora Ayanian March 20, 2006 Controller Synthesis in Complex Environments.

Slides:



Advertisements
Similar presentations
Traditional practice separates seismic data processing and further interpretation. However the most efficient processing methods utilize a-priori information.
Advertisements

Reactive and Potential Field Planners
1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Motion Planning for Point Robots CS 659 Kris Hauser.
Manipulator Dynamics Amirkabir University of Technology Computer Engineering & Information Technology Department.
Continuous Collision Detection: Progress and Challenges Gino van den Bergen dtecta
The Structure of Polyhedra Gabriel Indik March 2006 CAS 746 – Advanced Topics in Combinatorial Optimization.
1 Fast Primal-Dual Strategies for MRF Optimization (Fast PD) Robot Perception Lab Taha Hamedani Aug 2014.
Motion planning, control and obstacle avoidance D. Calisi.
Randomized Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
The City College of New York 1 Prepared by Dr. Salah Talha Mobot: Mobile Robot Introduction to ROBOTICS.
An Algorithm for Polytope Decomposition and Exact Computation of Multiple Integrals.
P. Ögren (KTH) N. Leonard (Princeton University)
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles By Jerome Barraquand and Jean-Claude Latombe Presenter:
Continuum Crowds Adrien Treuille, Siggraph 王上文.
Manipulator Dynamics Amirkabir University of Technology Computer Engineering & Information Technology Department.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Line integrals (10/22/04) :vector function of position in 3 dimensions. :space curve With each point P is associated a differential distance vector Definition.
CE 1501 CE 150 Fluid Mechanics G.A. Kallio Dept. of Mechanical Engineering, Mechatronic Engineering & Manufacturing Technology California State University,
Spring Berman MEAM 620 Project March 20, 2006 Simulation of Robot Guidance through Star Worlds via Navigation Functions.
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.
FINDING TOPOLOGY IN A FACTORY: CONFIGURATION SPACES A.ABRAM AND R.GHRIST Also “Robot navigation functions on manifolds with boundary” – Daniel Koditschek.
PHY 042: Electricity and Magnetism
Computer graphics & visualization Collision Detection – Narrow Phase.
Velocities and Static Force
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.
Central Force Motion Chapter 8
Geodesic Minimal Paths Vida Movahedi Elder Lab, January 2010.
© Manfred Huber Autonomous Robots Robot Path Planning.
Robot Crowd Navigation using Predictive Position Fields in the Potential Function Framework Ninad Pradhan, Timothy Burg, and Stan Birchfield Electrical.
Final Project Presentation on autonomous mobile robot
Robotics Chapter 5 – Path and Trajectory Planning
Building Prostate Statistical Atlas using Large-Deformation Image Registration Eric Hui University of Waterloo – MIAMI Bi-weekly.
Introduction to Robot Motion Planning Robotics meet Computer Science.
Progress in identification of damping: Energy-based method with incomplete and noisy data Marco Prandina University of Liverpool.
Chapter 3: Central Forces Introduction Interested in the “2 body” problem! Start out generally, but eventually restrict to motion of 2 bodies interacting.
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
Particle A particle is an object having a non zero mass and the shape of a point (zero size and no internal structure). In various situations we approximate.
Introduction to Projectile Motion. Unit 3: Two Dimensional Motion Warm up question: What role does gravity have on an object’s motion?
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
I.4 Polyhedral Theory 1. Integer Programming  Objective of Study: want to know how to describe the convex hull of the solution set to the IP problem.
Administration Feedback on assignment Late Policy
Kinematic Redundancy A manipulator may have more DOFs than are necessary to control a desired variable What do you do w/ the extra DOFs? However, even.
Navigation & Motion Planning Cell Decomposition Skeletonization Bounded Error Planning (Fine-motion Planning) Landmark-based Planning Online Algorithms.
Feedback Stabilization of Nonlinear Singularly Perturbed Systems MENG Bo JING Yuanwei SHEN Chao College of Information Science and Engineering, Northeastern.
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Central Force Umiatin,M.Si. The aim : to evaluate characteristic of motion under central force field.
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
Stut 11 Robot Path Planning in Unknown Environments Using Particle Swarm Optimization Leandro dos Santos Coelho and Viviana Cocco Mariani.
Understanding Complex Systems May 15, 2007 Javier Alcazar, Ph.D.
Lecture Rigid Body Dynamics.
Morphing and Shape Processing
Linear Motion, Free Fall, and Vectors Combined!
One- and Two-Dimensional Flows
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Digital Control Systems (DCS)
Some Aspects of Continuous-time Sliding Mode Control
Multivariate Analysis: Theory and Geometric Interpretation
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Spline-Based Multi-Level Planning for Autonomous Vehicles
Lecture Outline Chapter 11 Physics, 4th Edition James S. Walker
Lecture Outline Chapter 11 Physics, 4th Edition James S. Walker
I.4 Polyhedral Theory (NW)
Quantum Foundations Lecture 3
I.4 Polyhedral Theory.
Chapter 3 Modeling in the Time Domain
Planning.
Presentation transcript:

1 GRASP Nora Ayanian March 20, 2006 Controller Synthesis in Complex Environments

2 GRASP Introduction Many different approaches to robot motion planning and control  Continuous: Navigation function Configuration space must be a generalized sphere world Any vehicle dynamics  Combined continuous and discrete: Decomposition of state space Can handle more complex configuration space Difficulty with complex dynamics

3 GRASP Continuous Method Rimon and Koditschek [1] present a method to guide a bounded torque robot to a goal configuration from almost any initial configuration in an environment that is:  Completely known  Static  Deformable to a sphere world  Admits a navigation function Create an artificial potential field that solves the three separate steps of robot navigation  Path planning  Trajectory planning  Control [1] *E. Rimon and D.E. Koditschek, “Exact Robot Navigation Using Artificial Potential Functions,” IEEE Transactions on Robotics and Automation, vol. 8, no. 5, pp , 1992.

4 GRASP Continuous Method Let V be a map  With a unique minimum at the goal configuration, q d  That is uniformly maximal over the boundary of the free space, F V determines a feedback control law of the form The robot copies the qualitative behavior of V ’s gradient [2]

5 GRASP Navigation Function Method Star shaped sets  Star shaped sets contain a distinguished “center point” from which all rays cross the boundary of the set only once.  Map the star onto a disk diffeomorphically: translated scaling map  Scales each ray starting at q i by i, then translates along p i *[1] Rimon & Koditschek pipi qiqi D S

6 GRASP Combined Continuous and Discrete Method Habets & van Schuppen [7] decompose the state space into polytopes Each polytope is a different discrete mode of the system Objective: steer the state of an affine system to a specific facet Focus is on simplices  Points contained in a simplex are described by a unique linear combination of the vertices [7] *L.C.G.J.M. Habets and J.H. van Schuppen, “A Control Problem for Affine Dynamical Systems on a Full-Dimensional Polytope,” Automatica, no. 40, pp. 21–35, 2004.

7 GRASP Combined Method: Problem Definition Consider the affine system on P N For any initial state x 0  P N, find a time instant T 0 ≥ 0 and an input function u: [0,T 0 ]  U, such that   t  [0, T 0 ]: x(t)  P N,  x(T 0 )  F j, and T 0 is the smallest time-instant in the interval [0,∞) for which the state reaches the exit facet F j , i.e. the velocity vector at the point x(T 0 )  F j has a positive component in the direction of n j. This implies that in the point x(T 0 ), the velocity vector points out of the polytope P N.

8 GRASP Combined Method: Necessary Conditions If the control problem is solvable by a continuous state feedback f, then there exist inputs u 1, …,u M  U such that   j  V 1 : n 1 T (Av j + Bu j + a) > 0,  i  W j \ {1}: n i T (Av j + Bu j + a) ≤ 0.   j  {1, …,M} \ V 1 :  i  W j : n 1 T (Av j + Bu j + a) ≤ 0, Illustration of Polyhedral Cones Habets & van Schuppen,2004

9 GRASP Applying the Combined Method A 1-dimensional integrator problem x x'

10 GRASP Thank You